Table of Contents

• On Regularity of Unary Probabilistic AutomataS. Akshay, Blaise Genest, Bruno Karelovic, Nikhil Vyas. [doi]
• Time-Approximation Trade-offs for Inapproximable ProblemsÉdouard Bonnet, Michael Lampis, Vangelis Th. Paschos. [doi]
• The Complexity of Phylogeny Constraint SatisfactionManuel Bodirsky, Peter Jonsson, Van Trung Pham. [doi]
• On the Number of Lambda Terms With Prescribed Size of Their De Bruijn RepresentationBernhard Gittenberger, Zbigniew Golebiewski. [doi]
• Dense Subset Sum May Be the HardestPer Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof. [doi]
• Semantic Versus Syntactic Cutting PlanesYuval Filmus, Pavel Hrubes, Massimo Lauria. [doi]
• Cost Functions Definable by Min/Max AutomataThomas Colcombet, Denis Kuperberg, Amaldev Manuel, Szymon Torunczyk. [doi]
• Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three CircuitsNeeraj Kayal, Vineet Nair, Chandan Saha. [doi]
• Catalytic Space: Non-determinism and HierarchyHarry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman. [doi]
• Graph Reconstruction with a Betweenness OracleMikkel Abrahamsen, Greg Bodwin, Eva Rotenberg, Morten Stöckel. [doi]
• On Space Efficiency of Algorithms Working on Structural Decompositions of GraphsMichal Pilipczuk, Marcin Wrochna. [doi]
• Fine-Grained Algorithms and Complexity (Invited Talk)Virginia Vassilevska Williams. [doi]
• Periods and Borders of Random WordsStepan Holub, Jeffrey Shallit. [doi]
• Testing Shape Restrictions of Discrete DistributionsClément L. Canonne, Ilias Diakonikolas, Themis Gouleakis, Ronitt Rubinfeld. [doi]
• Varieties of Cost FunctionsLaure Daviaud, Denis Kuperberg, Jean-Éric Pin. [doi]
• Improved Approximation Algorithms for Balanced Partitioning ProblemsHarald Räcke, Richard Stotz. [doi]
• Efficiently Finding All Maximal alpha-gapped RepeatsPawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea. [doi]
• Deciding Circular-Arc Graph Isomorphism in Parameterized LogspaceMaurice Chandoo. [doi]
• Are Short Proofs Narrow? QBF Resolution is not SimpleOlaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla. [doi]
• Computing the L1 Geodesic Diameter and Center of a Polygonal DomainSang Won Bae, Matias Korman, Joseph S. B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, Haitao Wang. [doi]
• Bottleneck Paths and Trees and Deterministic Graphical GamesShiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir, Uri Zwick. [doi]
• The MSO+U Theory of (N, <) Is UndecidableMikolaj Bojanczyk, Pawel Parys, Szymon Torunczyk. [doi]
• A Randomized Polynomial Kernel for Subset Feedback Vertex SetEva-Maria C. Hols, Stefan Kratsch. [doi]
• Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially TightBart M. P. Jansen. [doi]
• Tightening the Complexity of Equivalence Problems for Commutative GrammarsChristoph Haase, Piotr Hofman. [doi]
• Complexity and Expressive Power of Ontology-Mediated Queries (Invited Talk)Carsten Lutz. [doi]
• Derandomizing Isolation Lemma for K3, 3-free and K5-free Bipartite GraphsRahul Arora, Ashu Gupta, Rohit Gurjar, Raghunath Tewari. [doi]
• Front Matter, Foreword, Conference Organization, External Reviewers, Table of Contents [doi]
• Towards an Atlas of Computational Learning TheoryTimo Kötzing, Martin Schirneck. [doi]
• Faster Algorithms for the Constrained k-Means ProblemAnup Bhattacharya, Ragesh Jaiswal, Amit Kumar 0001. [doi]
• The Complexity of the Hamilton Cycle Problem in Hypergraphs of High Minimum CodegreeFrederik Garbe, Richard Mycroft. [doi]
• Quantum Query Complexity of Subgraph Isomorphism and HomomorphismRaghav Kulkarni, Supartha Podder. [doi]
• On a Fragment of AMSO and Tiling SystemsAchim Blumensath, Thomas Colcombet, Pawel Parys. [doi]
• FPTAS for Hardcore and Ising Models on HypergraphsPinyan Lu, Kuan Yang, Chihao Zhang. [doi]
• Size-Treewidth Tradeoffs for Circuits Computing the Element Distinctness FunctionMateus de Oliveira Oliveira. [doi]
• Copyless Cost-Register Automata: Structure, Expressiveness, and Closure PropertiesFilip Mazowiecki, Cristian Riveros. [doi]
• Ideal Decompositions for Vector Addition Systems (Invited Talk)Jérôme Leroux, Sylvain Schmitz. [doi]
• Canonizing Graphs of Bounded Tree Width in LogspaceMichael Elberfeld, Pascal Schweitzer. [doi]
• Tutorial on Cellular Automata and Tilings (Tutorial)Jarkko Kari. [doi]
• Sub-exponential Approximation Schemes for CSPs: From Dense to Almost SparseDimitris Fotakis, Michael Lampis, Vangelis Th. Paschos. [doi]
• Knapsack in Graph Groups, HNN-Extensions and Amalgamated ProductsMarkus Lohrey, Georg Zetzsche. [doi]
• Algorithmic Statistics, Prediction and Machine LearningAlexey Milovanov. [doi]
• Entropy Games and Matrix Multiplication GamesEugene Asarin, Julien Cervelle, Aldric Degorre, Catalin Dima, Florian Horn, Victor Kozyakin. [doi]
• Multiple-Edge-Fault-Tolerant Approximate Shortest-Path TreesDavide Bilò, Luciano Gualà, Stefano Leucci 0001, Guido Proietti. [doi]
• Packing Groups of Items into Multiple KnapsacksLin Chen, Guochuan Zhang. [doi]
• Editing to Connected f-Degree GraphFedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh. [doi]
• Polynomial Kernels for Deletion to Classes of Acyclic DigraphsMatthias Mnich, Erik Jan van Leeuwen. [doi]
• Autoreducibility of NP-Complete SetsJohn M. Hitchcock, Hadi Shafei. [doi]
• Simultaneous Feedback Vertex Set: A Parameterized PerspectiveAkanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh. [doi]
• Good Predictions Are Worth a Few ComparisonsNicolas Auger, Cyril Nicaud, Carine Pivoteau. [doi]
• Faster Exact and Parameterized Algorithm for Feedback Vertex Set in TournamentsMithilesh Kumar, Daniel Lokshtanov. [doi]
• The Expanding Search Ratio of a GraphSpyros Angelopoulos 0001, Christoph Dürr, Thomas Lidbetter. [doi]
• Efficient Enumeration of Solutions Produced by Closure OperationsArnaud Mary, Yann Strozecki. [doi]
• Preprocessing Under UncertaintyStefan Fafianie, Stefan Kratsch, Vuong Anh Quyen. [doi]
• Kernelization and Sparseness: the Case of Dominating SetPål Grønås Drange, Markus Sortland Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Fernando Sanchez Villaamil, Saket Saurabh, Sebastian Siebertz, Somnath Sikdar. [doi]
• Airports and Railways: Facility Location Meets Network DesignAnna Adamaszek, Antonios Antoniadis, Tobias Mömke. [doi]
• External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic UpdatesGerth Stølting Brodal. [doi]
• A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player GamesVittorio Bilò, Marios Mavronicolas. [doi]
• Characterisation of an Algebraic Algorithm for Probabilistic AutomataNathanaël Fijalkow. [doi]