Download or read book Approximation and Online Algorithms written by Klaus Jansen and published by Springer. This book was released on 2017-01-06 with total page 223 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the thoroughly refereed post-workshop proceedings of the 14th International Workshop on Approximation and Online Algorithms, WAOA 2016, held in Aarhus, Denmark, in August 2016 as part of ALGO 2016. The 16 revised full papers presented together with 2 invited lectures were carefully reviewed and selected from 33 submissions. Topics of interest for WAOA 2016 were: coloring and partitioning, competitive analysis, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real world applications, and scheduling problems.

Download or read book Discrete Geometry for Computer Imagery written by Michel Couprie and published by Springer. This book was released on 2019-03-19 with total page 500 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the thoroughly refereed proceedings of the 21st IAPR International Conference on Discrete Geometry for Computer Imagery, DGCI 2019, held in Marne-la-Vallée, France, in March 2019. The 38 full papers were carefully selected from 50 submissions. The papers are organized in topical sections on discrete geometric models and transforms; discrete topology; graph-based models, analysis and segmentation; mathematical morphology; shape representation, recognition and analysis; and geometric computation.

Download or read book Proceedings of the Seventeenth Annual ACM SIAM Symposium on Discrete Algorithms written by SIAM Activity Group on Discrete Mathematics and published by SIAM. This book was released on 2006-01-01 with total page 1264 pages. Available in PDF, EPUB and Kindle. Book excerpt: Symposium held in Miami, Florida, January 22–24, 2006.This symposium is jointly sponsored by the ACM Special Interest Group on Algorithms and Computation Theory and the SIAM Activity Group on Discrete Mathematics.Contents Preface; Acknowledgments; Session 1A: Confronting Hardness Using a Hybrid Approach, Virginia Vassilevska, Ryan Williams, and Shan Leung Maverick Woo; A New Approach to Proving Upper Bounds for MAX-2-SAT, Arist Kojevnikov and Alexander S. Kulikov, Measure and Conquer: A Simple O(20.288n) Independent Set Algorithm, Fedor V. Fomin, Fabrizio Grandoni, and Dieter Kratsch; A Polynomial Algorithm to Find an Independent Set of Maximum Weight in a Fork-Free Graph, Vadim V. Lozin and Martin Milanic; The Knuth-Yao Quadrangle-Inequality Speedup is a Consequence of Total-Monotonicity, Wolfgang W. Bein, Mordecai J. Golin, Larry L. Larmore, and Yan Zhang; Session 1B: Local Versus Global Properties of Metric Spaces, Sanjeev Arora, László Lovász, Ilan Newman, Yuval Rabani, Yuri Rabinovich, and Santosh Vempala; Directed Metrics and Directed Graph Partitioning Problems, Moses Charikar, Konstantin Makarychev, and Yury Makarychev; Improved Embeddings of Graph Metrics into Random Trees, Kedar Dhamdhere, Anupam Gupta, and Harald Räcke; Small Hop-diameter Sparse Spanners for Doubling Metrics, T-H. Hubert Chan and Anupam Gupta; Metric Cotype, Manor Mendel and Assaf Naor; Session 1C: On Nash Equilibria for a Network Creation Game, Susanne Albers, Stefan Eilts, Eyal Even-Dar, Yishay Mansour, and Liam Roditty; Approximating Unique Games, Anupam Gupta and Kunal Talwar; Computing Sequential Equilibria for Two-Player Games, Peter Bro Miltersen and Troels Bjerre Sørensen; A Deterministic Subexponential Algorithm for Solving Parity Games, Marcin Jurdzinski, Mike Paterson, and Uri Zwick; Finding Nucleolus of Flow Game, Xiaotie Deng, Qizhi Fang, and Xiaoxun Sun, Session 2: Invited Plenary Abstract: Predicting the “Unpredictable”, Rakesh V. Vohra, Northwestern University; Session 3A: A Near-Tight Approximation Lower Bound and Algorithm for the Kidnapped Robot Problem, Sven Koenig, Apurva Mudgal, and Craig Tovey; An Asymptotic Approximation Algorithm for 3D-Strip Packing, Klaus Jansen and Roberto Solis-Oba; Facility Location with Hierarchical Facility Costs, Zoya Svitkina and Éva Tardos; Combination Can Be Hard: Approximability of the Unique Coverage Problem, Erik D. Demaine, Uriel Feige, Mohammad Taghi Hajiaghayi, and Mohammad R. Salavatipour; Computing Steiner Minimum Trees in Hamming Metric, Ernst Althaus and Rouven Naujoks; Session 3B: Robust Shape Fitting via Peeling and Grating Coresets, Pankaj K. Agarwal, Sariel Har-Peled, and Hai Yu; Tightening Non-Simple Paths and Cycles on Surfaces, Éric Colin de Verdière and Jeff Erickson; Anisotropic Surface Meshing, Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos, and Rephael Wenger; Simultaneous Diagonal Flips in Plane Triangulations, Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, and David R. Wood; Morphing Orthogonal Planar Graph Drawings, Anna Lubiw, Mark Petrick, and Michael Spriggs; Session 3C: Overhang, Mike Paterson and Uri Zwick; On the Capacity of Information Networks, Micah Adler, Nicholas J. A. Harvey, Kamal Jain, Robert Kleinberg, and April Rasala Lehman; Lower Bounds for Asymmetric Communication Channels and Distributed Source Coding, Micah Adler, Erik D. Demaine, Nicholas J. A. Harvey, and Mihai Patrascu; Self-Improving Algorithms, Nir Ailon, Bernard Chazelle, Seshadhri Comandur, and Ding Liu; Cake Cutting Really is Not a Piece of Cake, Jeff Edmonds and Kirk Pruhs; Session 4A: Testing Triangle-Freeness in General Graphs, Noga Alon, Tali Kaufman, Michael Krivelevich, and Dana Ron; Constraint Solving via Fractional Edge Covers, Martin Grohe and Dániel Marx; Testing Graph Isomorphism, Eldar Fischer and Arie Matsliah; Efficient Construction of Unit Circular-Arc Models, Min Chih Lin and Jayme L. Szwarcfiter, On The Chromatic Number of Some Geometric Hypergraphs, Shakhar Smorodinsky; Session 4B: A Robust Maximum Completion Time Measure for Scheduling, Moses Charikar and Samir Khuller; Extra Unit-Speed Machines are Almost as Powerful as Speedy Machines for Competitive Flow Time Scheduling, Ho-Leung Chan, Tak-Wah Lam, and Kin-Shing Liu; Improved Approximation Algorithms for Broadcast Scheduling, Nikhil Bansal, Don Coppersmith, and Maxim Sviridenko; Distributed Selfish Load Balancing, Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul Goldberg, Zengjian Hu, and Russell Martin; Scheduling Unit Tasks to Minimize the Number of Idle Periods: A Polynomial Time Algorithm for Offline Dynamic Power Management, Philippe Baptiste; Session 4C: Rank/Select Operations on Large Alphabets: A Tool for Text Indexing, Alexander Golynski, J. Ian Munro, and S. Srinivasa Rao; O(log log n)-Competitive Dynamic Binary Search Trees, Chengwen Chris Wang, Jonathan Derryberry, and Daniel Dominic Sleator; The Rainbow Skip Graph: A Fault-Tolerant Constant-Degree Distributed Data Structure, Michael T. Goodrich, Michael J. Nelson, and Jonathan Z. Sun; Design of Data Structures for Mergeable Trees, Loukas Georgiadis, Robert E. Tarjan, and Renato F. Werneck; Implicit Dictionaries with O(1) Modifications per Update and Fast Search, Gianni Franceschini and J. Ian Munro; Session 5A: Sampling Binary Contingency Tables with a Greedy Start, Ivona Bezáková, Nayantara Bhatnagar, and Eric Vigoda; Asymmetric Balanced Allocation with Simple Hash Functions, Philipp Woelfel; Balanced Allocation on Graphs, Krishnaram Kenthapadi and Rina Panigrahy; Superiority and Complexity of the Spaced Seeds, Ming Li, Bin Ma, and Louxin Zhang; Solving Random Satisfiable 3CNF Formulas in Expected Polynomial Time, Michael Krivelevich and Dan Vilenchik; Session 5B: Analysis of Incomplete Data and an Intrinsic-Dimension Helly Theorem, Jie Gao, Michael Langberg, and Leonard J. Schulman; Finding Large Sticks and Potatoes in Polygons, Olaf Hall-Holt, Matthew J. Katz, Piyush Kumar, Joseph S. B. Mitchell, and Arik Sityon; Randomized Incremental Construction of Three-Dimensional Convex Hulls and Planar Voronoi Diagrams, and Approximate Range Counting, Haim Kaplan and Micha Sharir; Vertical Ray Shooting and Computing Depth Orders for Fat Objects, Mark de Berg and Chris Gray; On the Number of Plane Graphs, Oswin Aichholzer, Thomas Hackl, Birgit Vogtenhuber, Clemens Huemer, Ferran Hurtado, and Hannes Krasser; Session 5C: All-Pairs Shortest Paths for Unweighted Undirected Graphs in o(mn) Time, Timothy M. Chan; An O(n log n) Algorithm for Maximum st-Flow in a Directed Planar Graph, Glencora Borradaile and Philip Klein; A Simple GAP-Canceling Algorithm for the Generalized Maximum Flow Problem, Mateo Restrepo and David P. Williamson; Four Point Conditions and Exponential Neighborhoods for Symmetric TSP, Vladimir Deineko, Bettina Klinz, and Gerhard J. Woeginger; Upper Degree-Constrained Partial Orientations, Harold N. Gabow; Session 7A: On the Tandem Duplication-Random Loss Model of Genome Rearrangement, Kamalika Chaudhuri, Kevin Chen, Radu Mihaescu, and Satish Rao; Reducing Tile Complexity for Self-Assembly Through Temperature Programming, Ming-Yang Kao and Robert Schweller; Cache-Oblivious String Dictionaries, Gerth Stølting Brodal and Rolf Fagerberg; Cache-Oblivious Dynamic Programming, Rezaul Alam Chowdhury and Vijaya Ramachandran; A Computational Study of External-Memory BFS Algorithms, Deepak Ajwani, Roman Dementiev, and Ulrich Meyer; Session 7B: Tight Approximation Algorithms for Maximum General Assignment Problems, Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, and Maxim Sviridenko; Approximating the k-Multicut Problem, Daniel Golovin, Viswanath Nagarajan, and Mohit Singh; The Prize-Collecting Generalized Steiner Tree Problem Via A New Approach Of Primal-Dual Schema, Mohammad Taghi Hajiaghayi and Kamal Jain; 8/7-Approximation Algorithm for (1,2)-TSP, Piotr Berman and Marek Karpinski; Improved Lower and Upper Bounds for Universal TSP in Planar Metrics, Mohammad T. Hajiaghayi, Robert Kleinberg, and Tom Leighton; Session 7C: Leontief Economies Encode NonZero Sum Two-Player Games, B. Codenotti, A. Saberi, K. Varadarajan, and Y. Ye; Bottleneck Links, Variable Demand, and the Tragedy of the Commons, Richard Cole, Yevgeniy Dodis, and Tim Roughgarden; The Complexity of Quantitative Concurrent Parity Games, Krishnendu Chatterjee, Luca de Alfaro, and Thomas A. Henzinger; Equilibria for Economies with Production: Constant-Returns Technologies and Production Planning Constraints, Kamal Jain and Kasturi Varadarajan; Session 8A: Approximation Algorithms for Wavelet Transform Coding of Data Streams, Sudipto Guha and Boulos Harb; Simpler Algorithm for Estimating Frequency Moments of Data Streams, Lakshimath Bhuvanagiri, Sumit Ganguly, Deepanjan Kesh, and Chandan Saha; Trading Off Space for Passes in Graph Streaming Problems, Camil Demetrescu, Irene Finocchi, and Andrea Ribichini; Maintaining Significant Stream Statistics over Sliding Windows, L.K. Lee and H.F. Ting; Streaming and Sublinear Approximation of Entropy and Information Distances, Sudipto Guha, Andrew McGregor, and Suresh Venkatasubramanian; Session 8B: FPTAS for Mixed-Integer Polynomial Optimization with a Fixed Number of Variables, J. A. De Loera, R. Hemmecke, M. Köppe, and R. Weismantel; Linear Programming and Unique Sink Orientations, Bernd Gärtner and Ingo Schurr; Generating All Vertices of a Polyhedron is Hard, Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled Elbassioni, and Vladimir Gurvich; A Semidefinite Programming Approach to Tensegrity Theory and Realizability of Graphs, Anthony Man-Cho So and Yinyu Ye; Ordering by Weighted Number of Wins Gives a Good Ranking for Weighted Tournaments, Don Coppersmith, Lisa Fleischer, and Atri Rudra; Session 8C: Weighted Isotonic Regression under L1 Norm, Stanislav Angelov, Boulos Harb, Sampath Kannan, and Li-San Wang; Oblivious String Embeddings and Edit Distance Approximations, Tugkan Batu, Funda Ergun, and Cenk Sahinalp0898716012\\This comprehensive book not only introduces the C and C++ programming languages but also shows how to use them in the numerical solution of partial differential equations (PDEs). It leads the reader through the entire solution process, from the original PDE, through the discretization stage, to the numerical solution of the resulting algebraic system. The well-debugged and tested code segments implement the numerical methods efficiently and transparently. Basic and advanced numerical methods are introduced and implemented easily and efficiently in a unified object-oriented approach.

Download or read book Motion in Games written by Ronan Boulic and published by Springer. This book was released on 2010-11-02 with total page 446 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the proceedings of the Second International Workshop on Motion in Games, held in Utrecht, The Netherlands, in November 2010. The 30 revised full papers presented together with 9 revised poster papers in this volume were carefully reviewed and selected. The papers are organized in topical sections on body simulation, learning movements, body control, motion planning, physically-based character control, crowds and formation, geometry, autonomous characters, navigation, motion synthesis, perception, real-time graphics, and posters.

Download or read book Combinatorial Optimization and Applications written by Weili Wu and published by Springer Nature. This book was released on 2020-12-04 with total page 834 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume constitutes the proceedings of the 14th International Conference on Combinatorial Optimization and Applications, COCOA 2020, held in Dallas, TX, USA, in December 2020. The 55 full papers presented in this volume were carefully reviewed and selected from 104 submissions. The papers are grouped into the following topics: Approximation Algorithms; Scheduling; Network Optimization; Complexity and Logic; Search, Facility and Graphs; Geometric Problem; Sensors, Vehicles and Graphs; and Graph Problems. Due to the Corona pandemic this event was held virtually.

Download or read book Algorithms ESA 2010 written by Mark de Berg and published by Springer Science & Business Media. This book was released on 2010-08-30 with total page 603 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the proceedings of the 18th Annual European Symposium on Algorithms, held in Liverpool, UK in September 2010.

Download or read book Spatial Databases written by Yannis Manolopoulos and published by IGI Global. This book was released on 2005-01-01 with total page 340 pages. Available in PDF, EPUB and Kindle. Book excerpt: Spatial Databases: Technologies, Techniques and Trends introduces the reader to the world of spatial databases, and related subtopics. The broad range of topics covered within the chapters includes spatial data modeling, indexing of spatial and spatiotemporal objects, data mining and knowledge discovery in spatial and spatiotemporal management issues and query processing for moving objects. The reader will be able to get in touch with several important research issues the research community is dealing with today. Covering fundamental aspects up to advanced material, Spatial Databases: Technologies, Techniques and Trends appeals to a broad computer science audience. Although perfect for specialists, each chapter is self contained, making it easy for non-specialists to grasp the main issues involved.

Download or read book Similarity Search and Applications written by Giuseppe Amato and published by Springer. This book was released on 2015-10-06 with total page 363 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the proceedings of the 8th International Conference on Similarity Search and Applications, SISAP 2015, held in Glasgow, UK, in October 2015. The 19 full papers, 12 short and 9 demo and poster papers presented in this volume were carefully reviewed and selected from 68 submissions. They are organized in topical sections named: improving similarity search methods and techniques; metrics and evaluation; applications and specific domains; implementation and engineering solutions; posters; demo papers.

Download or read book Approximation Randomization and Combinatorial Optimization Algorithms and Techniques written by Irit Dinur and published by Springer Science & Business Media. This book was released on 2009-08-06 with total page 750 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the joint refereed proceedings of the 12th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2009, and the 13th International Workshop on Randomization and Computation, RANDOM 2009, held in Berkeley, CA, USA, in August 2009. The 25 revised full papers of the APPROX 2009 workshop and the 28 revised full papers of the RANDOM 2009 workshop included in this volume, were carefully reviewed and selected from 56 and 58 submissions, respectively. APPROX focuses on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM is concerned with applications of randomness to computational and combinatorial problems.

Download or read book Rendering Techniques 2000 written by B. Peroche and published by Springer Science & Business Media. This book was released on 2013-11-11 with total page 435 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book contains the proceedings of the 11th Eurographics Workshop on Rendering, which took place from the 26th to the 28th of June, 2000, in Brno, Czech Republic. Over the past 10 years, the Workshop has become the premier forum dedicated to research in rendering. Much of the work in rendering now appearing in other conferences and journals builds on ideas originally presented at the Workshop. This year we received a total of 84 submissions. Bachpaper was carefully reviewed by two of the 25 international programme committee members, as weil as external reviewers, selected by the co-chairs from a pool of 121 individuals (The programme committee and external reviewers are listed following the contents pages). In this review process, all submissions and reviews were handled electronically, with the exception of videos submitted with a few of the papers (however, some mpeg movies were also sent electronically). The overall quality of the submissions was exceptionally high. Space and time constraints forced the committee to make some difficult decisions. In the end, 33 papers were accepted, and they appear here. Almost all papers are accompanied by color images, which appear at the end of the book. The papers treat the following varied topics: radiosity, ray tracing, methods for global illumination, visibility, reftectance, filtering, perception, hardware assisted methods, real time rendering, modeling for effi cient rendering and new image representations.

Download or read book Advances in Visual Computing written by Richard Boyle and published by Springer. This book was released on 2009-11-26 with total page 1238 pages. Available in PDF, EPUB and Kindle. Book excerpt: It is with greatpleasure that we present the proceedings of the 5th International Symposium on Visual Computing (ISVC 2009), which was held in Las Vegas, Nevada. ISVC o?ers a common umbrella for the four main areas of visual c- puting includingvision,graphics,visualization,andvirtualreality.Thegoalisto provide a forum for researchers, scientists, engineers, and practitioners throu- out the world to present their latest research ?ndings, ideas, developments, and applications in the broader area of visual computing. This year, the program consisted of 16 oral sessions, one poster session, 7 special tracks, and 6 keynote presentations. Also, this year ISVC hosted the Third Semantic Robot Vision Challenge.The responseto the call for papers was verygood;wereceivedover320submissionsfor themainsymposiumfromwhich we accepted 97 papers for oral presentation and 63 papers for poster presen- tion. Special track papers were solicited separately through the Organizing and Program Committees of each track. A total of 40 papers were accepted for oral presentation and 15 papers for poster presentation in the special tracks. All papers were reviewed with an emphasis on potential to contribute to the state of the art in the ?eld. Selection criteria included accuracy and originality of ideas, clarity and signi?cance of results, and presentation quality. The review process was quite rigorous, involving two to three independent blind reviews followed by several days of discussion. During the discussion period we tried to correct anomalies and errors that might have existed in the initial reviews.

Download or read book Algorithms and Computation written by Khaled Elbassioni and published by Springer. This book was released on 2015-12-07 with total page 786 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 26th International Symposium on Algorithms and Computation, ISAAC 2015, held in Nagoya, Japan, in December 2015. The 65 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 180 submissions for inclusion in the book. The focus of the volume is on the following topics: computational geometry; data structures; combinatorial optimization and approximation algorithms; randomized algorithms; graph algorithms and FPT; computational complexity; graph drawing and planar graphs; online and streaming algorithms; and string and DNA algorithms.

Download or read book Foundations of Data Visualization written by Min Chen and published by Springer Nature. This book was released on 2020-08-11 with total page 395 pages. Available in PDF, EPUB and Kindle. Book excerpt: This is the first book that focuses entirely on the fundamental questions in visualization. Unlike other existing books in the field, it contains discussions that go far beyond individual visual representations and individual visualization algorithms. It offers a collection of investigative discourses that probe these questions from different perspectives, including concepts that help frame these questions and their potential answers, mathematical methods that underpin the scientific reasoning of these questions, empirical methods that facilitate the validation and falsification of potential answers, and case studies that stimulate hypotheses about potential answers while providing practical evidence for such hypotheses. Readers are not instructed to follow a specific theory, but their attention is brought to a broad range of schools of thoughts and different ways of investigating fundamental questions. As such, the book represents the by now most significant collective effort for gathering a large collection of discourses on the foundation of data visualization. Data visualization is a relatively young scientific discipline. Over the last three decades, a large collection of computer-supported visualization techniques have been developed, and the merits and benefits of using these techniques have been evidenced by numerous applications in practice. These technical advancements have given rise to the scientific curiosity about some fundamental questions such as why and how visualization works, when it is useful or effective and when it is not, what are the primary factors affecting its usefulness and effectiveness, and so on. This book signifies timely and exciting opportunities to answer such fundamental questions by building on the wealth of knowledge and experience accumulated in developing and deploying visualization technology in practice.

Download or read book Algorithms and Data Structures written by Zachary Friggstad and published by Springer. This book was released on 2019-07-31 with total page 610 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 16th International Symposium on Algorithms and Data Structures, WADS, 2019, held in Edmonton, AB, Canada, in August 2019. The 42 full papers presented together with 3 invited lectures, we carefully reviewed and selected from a total of 88 submissions. They present original research on the theory and application of algorithms and data structures in many areas, including combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.

Download or read book Higher dimensional modelling of geographic information written by Ken Arroyo Ohori and published by Lulu.com. This book was released on 2016-03-02 with total page 248 pages. Available in PDF, EPUB and Kindle. Book excerpt: Higher-dimensional modelling of geographic information

Download or read book Learning to Understand Remote Sensing Images written by Qi Wang and published by MDPI. This book was released on 2019-09-30 with total page 376 pages. Available in PDF, EPUB and Kindle. Book excerpt: With the recent advances in remote sensing technologies for Earth observation, many different remote sensors are collecting data with distinctive properties. The obtained data are so large and complex that analyzing them manually becomes impractical or even impossible. Therefore, understanding remote sensing images effectively, in connection with physics, has been the primary concern of the remote sensing research community in recent years. For this purpose, machine learning is thought to be a promising technique because it can make the system learn to improve itself. With this distinctive characteristic, the algorithms will be more adaptive, automatic, and intelligent. This book introduces some of the most challenging issues of machine learning in the field of remote sensing, and the latest advanced technologies developed for different applications. It integrates with multi-source/multi-temporal/multi-scale data, and mainly focuses on learning to understand remote sensing images. Particularly, it presents many more effective techniques based on the popular concepts of deep learning and big data to reach new heights of data understanding. Through reporting recent advances in the machine learning approaches towards analyzing and understanding remote sensing images, this book can help readers become more familiar with knowledge frontier and foster an increased interest in this field.

Download or read book Computing and Combinatorics written by Zhipeng Cai and published by Springer. This book was released on 2014-07-05 with total page 704 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 20th International Conference on Computing and Combinatorics, COCOON 2014, held in Atlanta, GA, USA, in August 2014. The 51 revised full papers presented were carefully reviewed and selected from 110 submissions. There was a co-organized workshop on computational social networks (CSoNet 2014) where 8 papers were accepted. The papers cover the following topics: sampling and randomized methods; logic, algebra and automata; database and data structures; parameterized complexity and algorithms; computational complexity; computational biology and computational geometry; approximation algorithm; graph theory and algorithms; game theory and cryptography; scheduling algorithms and circuit complexity and CSoNet.