Abstract is missing.
- Front Matter, Table of Contents, Preface, Conference OrganizationErnst W. Mayr, Nicolas Ollinger. [doi]
- Overcoming Intractability in Unsupervised Learning (Invited Talk)Sanjeev Arora. 1-1 [doi]
- The Complexity of Constraint Satisfaction Problems (Invited Talk)Manuel Bodirsky. 2-9 [doi]
- Parallel Algorithms Reconsidered (Invited Talk)Peter Sanders. 10-18 [doi]
- Computational Social Choice (Tutorial)Felix Brandt. 19-19 [doi]
- Algorithmic Game Theory (Tutorial)Paul W. Goldberg. 20-20 [doi]
- The Minimum Oracle Circuit Size ProblemEric Allender, Dhiraj Holden, Valentine Kabanets. 21-33 [doi]
- Graph Searching Games and Width Measures for Directed GraphsSaeed Akhoondian Amiri, Lukasz Kaiser, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz. 34-47 [doi]
- Subset Sum in the Absence of ConcentrationPer Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof. 48-61 [doi]
- On Sharing, Memoization, and Polynomial TimeMartin Avanzini, Ugo Dal Lago. 62-75 [doi]
- Proof Complexity of Resolution-based QBF CalculiOlaf Beyersdorff, Leroy Chew, Mikolás Janota. 76-89 [doi]
- Welfare Maximization with Friends-of-Friends Network ExternalitiesSayan Bhattacharya, Wolfgang Dvorák, Monika Henzinger, Martin Starnberger. 90-102 [doi]
- Markov Decision Processes and Stochastic Games with Total Effective PayoffEndre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino. 103-115 [doi]
- Advice Complexity for a Class of Online ProblemsJoan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen. 116-129 [doi]
- Las Vegas Computability and Algorithmic RandomnessVasco Brattka, Guido Gherardi, Rupert Hölzl. 130-142 [doi]
- Understanding Model Counting for beta-acyclic CNF-formulasJohann Brault-Baron, Florent Capelli, Stefan Mengel. 143-156 [doi]
- Parameterized Complexity Dichotomy for Steiner MulticutKarl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen. 157-170 [doi]
- Solving Totally Unimodular LPs with the Shadow Vertex AlgorithmTobias Brunsch, Anna Großwendt, Heiko Röglin. 171-183 [doi]
- Improved Local Search for Geometric Hitting SetNorbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray. 184-196 [doi]
- Arc Diagrams, Flip Distances, and Hamiltonian TriangulationsJean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein. 197-210 [doi]
- Tractable Probabilistic mu-Calculus That Expresses Probabilistic Temporal LogicsPablo F. Castro, Cecilia Kilmurray, Nir Piterman. 211-223 [doi]
- Tribes Is Hard in the Message Passing ModelArkadev Chattopadhyay, Sagnik Mukhopadhyay. 224-237 [doi]
- Network Design Problems with Bounded Distances via Shallow-Light Steiner TreesMarkus Chimani, Joachim Spoerhase. 238-248 [doi]
- Combinatorial Expressions and Lower BoundsThomas Colcombet, Amaldev Manuel. 249-261 [doi]
- Construction of mu-Limit Sets of Two-dimensional Cellular AutomataMartin Delacourt, Benjamin Hellouin de Menibus. 262-274 [doi]
- Derandomized Graph Product Results Using the Low Degree Long CodeIrit Dinur, Prahladh Harsha, Srikanth Srinivasan, Girish Varma. 275-287 [doi]
- Space-efficient Basic Graph AlgorithmsAmr Elmasry, Torben Hagerup, Frank Kammer. 288-301 [doi]
- Pattern Matching with Variables: Fast Algorithms and New Hardness ResultsHenning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid. 302-315 [doi]
- Approximating the Generalized Terminal Backup Problem via Half-integral Multiflow RelaxationTakuro Fukunaga. 316-328 [doi]
- On Matrix Powering in Low DimensionsEsther Galby, Joël Ouaknine, James Worrell. 329-340 [doi]
- The Complexity of Recognizing Unique Sink OrientationsBernd Gärtner, Antonis Thomas. 341-353 [doi]
- New Geometric Representations and Domination Problems on Tolerance and Multitolerance GraphsArchontia C. Giannopoulou, George B. Mertzios. 354-366 [doi]
- Comparing 1D and 2D Real Time on Cellular AutomataAnaël Grandjean, Victor Poupet. 367-378 [doi]
- Tropical Effective Primary and Dual Nullstellens"atzeDima Grigoriev, Vladimir V. Podolskii. 379-391 [doi]
- Upper Tail Estimates with Combinatorial ProofsJan Hazla, Thomas Holenstein. 392-405 [doi]
- Minimum Cost Flows in Graphs with Unit CapacitiesAndrew V. Goldberg, Haim Kaplan, Sagi Hed, Robert Endre Tarjan. 406-419 [doi]
- Inductive Inference and Reverse MathematicsRupert Hölzl, Sanjay Jain, Frank Stephan. 420-433 [doi]
- Dynamic Planar Embeddings of Dynamic GraphsJacob Holm, Eva Rotenberg. 434-446 [doi]
- On the Information Carried by Programs about the Objects They ComputeMathieu Hoyrup, Cristobal Rojas. 447-459 [doi]
- Communication Complexity of Approximate Matching in Distributed GraphsZengfeng Huang, Bozidar Radunovic, Milan Vojnovic, Qin Zhang. 460-473 [doi]
- Stochastic Scheduling of Heavy-tailed JobsSungjin Im, Benjamin Moseley, Kirk Pruhs. 474-486 [doi]
- On Finding the Adams Consensus TreeJesper Jansson, Zhaoxian Li, Wing-Kin Sung. 487-499 [doi]
- Flip Distance Is in FPT Time O(n+ k * c^k)Iyad A. Kanj, Ge Xia. 500-512 [doi]
- New Pairwise SpannersTelikepalli Kavitha. 513-526 [doi]
- Multi-k-ic Depth Three Circuit Lower BoundNeeraj Kayal, Chandan Saha. 527-539 [doi]
- Automorphism Groups of Geometrically Represented GraphsPavel Klavík, Peter Zeman. 540-553 [doi]
- Correlation Clustering and Two-edge-connected Augmentation for Planar GraphsPhilip N. Klein, Claire Mathieu, Hang Zhou. 554-567 [doi]
- Extended Formulation Lower Bounds via Hypergraph Coloring?Stavros G. Kolliopoulos, Yannis Moysoglou. 568-581 [doi]
- Lempel-Ziv Factorization May Be Harder Than Computing All RunsDmitry Kosolobov. 582-593 [doi]
- Visibly Counter Languages and Constant Depth CircuitsAndreas Krebs, Klaus-Jörn Lange, Michael Ludwig. 594-607 [doi]
- Optimal Decremental Connectivity in Planar GraphsJakub Lacki, Piotr Sankowski. 608-621 [doi]
- Testing Small Set Expansion in General GraphsAngsheng Li, Pan Peng. 622-635 [doi]
- Paid Exchanges are Worth the PriceAlejandro López-Ortiz, Marc P. Renault, Adi Rosén. 636-648 [doi]
- Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of WordsTurlough Neary. 649-661 [doi]
- Separation and the Successor RelationThomas Place, Marc Zeitoun. 662-675 [doi]
- Computing 2-Walks in Polynomial TimeAndreas Schmid, Jens M. Schmidt. 676-688 [doi]
- Towards an Isomorphism Dichotomy for Hereditary Graph ClassesPascal Schweitzer. 689-702 [doi]
- Existential Second-order Logic over Graphs: A Complete Complexity-theoretic ClassificationTill Tantau. 703-715 [doi]
- The Returning SecretaryShai Vardi. 716-729 [doi]
- Homomorphism Reconfiguration via HomotopyMarcin Wrochna. 730-742 [doi]
- Computing Downward Closures for Stacked Counter AutomataGeorg Zetzsche. 743-756 [doi]