Table of Contents

• Packing Sporadic Real-Time Tasks on Identical Multiprocessor SystemsJian-Jia Chen, Nikhil Bansal, Samarjit Chakraborty, Georg von der Brüggen. [doi]
• Colouring (P_r+P_s)-Free GraphsTereza Klimosova, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová. [doi]
• Cluster Editing in Multi-Layer and Temporal GraphsJiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý. [doi]
• Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC AlgorithmAndreas Björklund, Thore Husfeldt. [doi]
• Minimizing Distance-to-Sight in Polygonal DomainsEunjin Oh 0003. [doi]
• Extending the Centerpoint Theorem to Multiple PointsAlexander Pilz, Patrick Schnider. [doi]
• Impatient Online MatchingXingwu Liu, Zhida Pan, Yuyi Wang, Roger Wattenhofer. [doi]
• Stabbing Pairwise Intersecting Disks by Five PointsSariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert. [doi]
• Going Beyond Traditional Characterizations in the Age of Big Data and Network Sciences (Invited Talk)Shang-Hua Teng. [doi]
• A Dichotomy Result for Cyclic-Order Traversing GamesYen-Ting Chen, Meng-Tsung Tsai, Shi-Chun Tsai. [doi]
• Approximate Minimum-Weight Matching with Outliers Under TranslationPankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Günter Rote, Micha Sharir, Allen Xiao. [doi]
• Deciding the Closure of Inconsistent Rooted Triples Is NP-CompleteMatthew P. Johnson. [doi]
• Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell ComplexityTimothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar 0001, Joachim Spoerhase, Alexander Wolff. [doi]
• Partially Walking a PolygonFranz Aurenhammer, Michael Steinkogler, Rolf Klein. [doi]
• Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free GraphsAndrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, Marcin Witkowski. [doi]
• Algorithms for Coloring Reconfiguration Under Recolorability ConstraintsHiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Polyline Drawings with Topological ConstraintsEmilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani. [doi]
• Covering Clients with Types and BudgetsDimitris Fotakis, Laurent Gourvès, Claire Mathieu, Abhinav Srivastav. [doi]
• New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds DecompositionQilong Feng, Guanlan Tan, Senmin Zhu, Bin Fu, Jianxin Wang. [doi]
• A Cut Tree Representation for Pendant PairsOn-Hei Solomon Lo, Jens M. Schmidt. [doi]
• Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based AlgorithmAnnette M. C. Ficker, Thomas Erlebach, Matús Mihalák, Frits C. R. Spieksma. [doi]
• Longest Unbordered Factor in Quasilinear TimeTomasz Kociumaka, Ritu Kundu, Manal Mohamed, Solon P. Pissis. [doi]
• Computing Vertex-Disjoint Paths in Large Graphs Using MAOsJohanna E. Preißer, Jens M. Schmidt. [doi]
• Improved Algorithms for the Shortest Vector Problem and the Closest Vector Problem in the Infinity NormDivesh Aggarwal, Priyanka Mukhopadhyay. [doi]
• A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree SpannersDavide Bilò, Kleitos Papadopoulos. [doi]
• Coresets for Fuzzy K-Means with ApplicationsJohannes Blömer, Sascha Brauer, Kathrin Bujna. [doi]
• Half-Duplex Communication ComplexityKenneth Hoover, Russell Impagliazzo, Ivan Mihajlin, Alexander V. Smal. [doi]
• Correlation Clustering GeneralizedDavid F. Gleich, Nate Veldt, Anthony Wirth. [doi]
• Tree Path Majority Data StructuresTravis Gagie, Meng He 0001, Gonzalo Navarro. [doi]
• Approximate Query Processing over Static Sets and Sliding WindowsRan Ben-Basat, Seungbum Jo, Srinivasa Rao Satti, Shubham Ugare. [doi]
• Approximate Matchings in Massive Graphs via Local Structure (Invited Talk)Clifford Stein. [doi]
• Convex Partial Transversals of Planar RegionsVahideh Keikha, Mees van de Kerkhof, Marc J. van Kreveld, Irina Kostitsyna, Maarten Löffler, Frank Staals, Jérôme Urhausen, Jordi L. Vermeulen, Lionov Wiratma. [doi]
• Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance BookingsKelin Luo, Thomas Erlebach, Yinfeng Xu. [doi]
• Simple 2^f-Color Choice DictionariesFrank Kammer, Andrej Sajenko. [doi]
• The b-Matching Problem in Distance-Hereditary Graphs and BeyondGuillaume Ducoffe , Alexandru Popa 0001. [doi]
• Parameterized Query Complexity of Hitting Set Using Stability of SunflowersArijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh 0001. [doi]
• Competitive Searching for a Line on a Line ArrangementQuirijn W. Bouts, Thom Castermans, Arthur van Goethem, Marc J. van Kreveld, Wouter Meulemans. [doi]
• Planar Maximum Matching: Towards a Parallel AlgorithmSamir Datta, Raghav Kulkarni, Ashish Kumar, Anish Mukherjee 0001. [doi]
• Counting Connected Subgraphs with Maximum-Degree-Aware SievingAndreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto. [doi]
• Packing Returning SecretariesMartin Hoefer, Lisa Wilhelmi. [doi]
• Diversity Maximization in Doubling MetricsAlfonso Cevallos, Friedrich Eisenbrand, Sarah Morell. [doi]
• Almost Optimal Algorithms for Diameter-Optimally Augmenting TreesDavide Bilò. [doi]
• An Adaptive Version of Brandes' Algorithm for Betweenness CentralityMatthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier. [doi]
• Encoding Two-Dimensional Range Top-k Queries RevisitedSeungbum Jo, Srinivasa Rao Satti. [doi]
• Approximation Algorithms for Facial Cycles in Planar EmbeddingsGiordano Da Lozzo, Ignaz Rutter. [doi]
• An Algorithm for the Maximum Weight Strongly Stable Matching ProblemAdam Kunysz. [doi]
• Approximation Algorithm for Vertex Cover with Multiple Covering ConstraintsEunpyeong Hong, Mong-Jen Kao. [doi]
• On the Complexity of Stable Fractional Hypergraph MatchingTakashi Ishizuka, Naoyuki Kamiyama. [doi]
• Exploiting Sparsity for Bipartite HamiltonicityAndreas Björklund. [doi]
• The Use of a Pruned Modular Decomposition for Maximum Matching Algorithms on Some Graph ClassesGuillaume Ducoffe , Alexandru Popa 0001. [doi]
• Deterministic Treasure Hunt in the Plane with Angular HintsSébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit. [doi]
• Reconstructing Phylogenetic Tree From Multipartite Quartet SystemHiroshi Hirai 0001, Yuni Iwamasa. [doi]
• A Relaxed FPTAS for Chance-Constrained KnapsackGalia Shabtai, Danny Raz, Yuval Shavitt. [doi]
• Opinion Forming in Erdös-Rényi Random Graph and ExpandersAhad N. Zehmakan. [doi]
• Algorithmic Channel DesignGeorgia Avarikioti, Yuyi Wang, Roger Wattenhofer. [doi]
• On Counting Oracles for Path ProblemsIvona Bezáková, Andrew Searns. [doi]
• Complexity of Unordered CNF GamesMd Lutfar Rahman, Thomas Watson 0001. [doi]
• On Polynomial Time Constructions of Minimum Height Decision TreeNader H. Bshouty, Waseem Makhoul. [doi]
• Data-Compression for Parametrized Counting Problems on Sparse GraphsEun Jung Kim 0002, Maria J. Serna, Dimitrios M. Thilikos. [doi]
• Succinct Data Structures for Chordal GraphsJ. Ian Munro, Kaiyu Wu. [doi]
• Computing Approximate Statistical DiscrepancyMichael Matheny, Jeff M. Phillips. [doi]
• Rectilinear Link Diameter and Radius in a Rectilinear Polygonal DomainElena Arseneva, Man-Kwun Chiu, Matias Korman, Aleksandar Markovic 0001, Yoshio Okamoto, Aurélien Ooms, André van Renssen, Marcel Roeloffzen. [doi]
• Computing Optimal Shortcuts for NetworksDelia Garijo, Alberto Márquez, Natalia Rodríguez, Rodrigo I. Silveira. [doi]
• Streaming Algorithms for Planar Convex HullsMartin Farach-Colton, Meng Li, Meng-Tsung Tsai. [doi]
• An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path NetworksBinay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh. [doi]
• Multi-Finger Binary Search TreesParinya Chalermsook, Mayank Goswami, László Kozma 0002, Kurt Mehlhorn, Thatchaphol Saranurak. [doi]
• New and Improved Algorithms for Unordered Tree InclusionTatsuya Akutsu, Jesper Jansson, Ruiming Li, Atsuhiro Takasu, Takeyuki Tamura. [doi]
• Point Location in Incremental Planar SubdivisionsEunjin Oh 0003. [doi]
• Extensions of Self-Improving SortersSiu-Wing Cheng, Lie Yan. [doi]
• Target Set Selection in Dense Graph ClassesPavel Dvorák, Dusan Knop, Tomás Toufar. [doi]
• Beyond-Planarity: Turán-Type Results for Non-Planar Bipartite GraphsPatrizio Angelini, Michael A. Bekos, Michael Kaufmann 0001, Maximilian Pfister, Torsten Ueckerdt. [doi]
• Proving the Turing Universality of Oritatami Co-Transcriptional FoldingCody W. Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki. [doi]
• Efficient Enumeration of Dominating Sets for Sparse GraphsKazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno. [doi]