Accepted papers

  • Vittorio Bilo' and Marios Mavronicolas. A Catalog of $\exists {\mathbb{R}}$-Complete Decision Problems about Nash Equilibria in Multi-Player Games
  • Eva-Maria Hols and Stefan Kratsch. A randomized polynomial kernel for Subset Feedback Vertex Set
  • Anna Adamaszek, Antonios Antoniadis and Tobias Mömke. Airports and Railways: Facility Location Meets Network Design
  • Alexey Milovanov. Algorithmic statistics, prediction and machine learning
  • Olaf Beyersdorff, Leroy Chew, Meena Mahajan and Anil Shukla. Are Short Proofs Narrow? QBF Resolution is not Simple.
  • John M. Hitchcock and Hadi Shafei. Autoreducibility of NP-Complete Sets
  • Shiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir and Uri Zwick. Bottleneck Paths and Trees and Deterministic Graphical Games
  • Michael Elberfeld and Pascal Schweitzer. Canonizing Graphs of Bounded Tree Width in Logspace
  • Harry Buhrman, Michal Koucký, Bruno Loff and Florian Speelman. Catalytic space: non-determinism and hierarchy
  • Nathanaël Fijalkow. Characterisation of an Algebraic Algorithm for Probabilistic Automata
  • Sang Won Bae, Matias Korman, Joseph Mitchell, Yoshio Okamoto, Valentin Polishchuk and Haitao Wang. Computing the L1 Geodesic Diameter and Center of a Polygonal Domain
  • Bart M. P. Jansen. Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight
  • Filip Mazowiecki and Cristian Riveros. Copyless cost-register automata: structure, expressiveness, and closure properties
  • Thomas Colcombet, Denis Kuperberg, Amaldev Manuel and Szymon Toruńczyk. Cost Functions Definable by Min/Max Automata
  • Maurice Chandoo. Deciding Circular-Arc Graph Isomorphism in Parameterized Logspace
  • Per Austrin, Petteri Kaski, Mikko Koivisto and Jesper Nederlof. Dense Subset Sum may be the hardest
  • Rahul Arora, Ashu Gupta, Rohit Gurjar and Raghunath Tewari. Derandomizing Isolation Lemma for K_{3,3}-free and K_5-free Bipartite Graphs
  • Fedor Fomin, Petr Golovach, Fahad Panolan and Saket Saurabh. Editing to Connected f -Degree Graph
  • Yann Strozecki and Arnaud Mary. Efficient enumeration of solutions produced by closure operations
  • Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl and Florin Manea. Efficiently Finding All Maximal α-gapped Repeats
  • Eugene Asarin, Julien Cervelle, Aldric Degorre, Catalin Dima, Florian Horn and Victor Kozyakin. Entropy games and matrix multiplication games
  • Gerth Stølting Brodal. External Memory Three-Sided Range Reporting and Top-$k$ Queries with Sublogarithmic Updates
  • Anup Bhattacharya, Ragesh Jaiswal and Amit Kumar. Faster Algorithms for the Constrained k-means Problem
  • Mithilesh Kumar and Daniel Lokshtanov. Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments
  • Pinyan Lu, Kuan Yang and Chihao Zhang. FPTAS for Hardcore and Ising Models on Hypergraphs
  • Nicolas Auger, Cyril Nicaud and Carine Pivoteau. Good predictions are worth a few comparisons
  • Mikkel Abrahamsen, Greg Bodwin, Eva Rotenberg and Morten Stockel. Graph Reconstruction with a Betweenness Oracle
  • Harald Räcke and Richard Stotz. Improved Approximation Algorithms for Balanced Partitioning Problems
  • Pål Grønås Drange, Markus Dregi, Fedor Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Felix Reidl, Fernando Sanchez Villaamil, Saket Saurabh, Sebastian Siebertz and Somnath Sikdar. Kernelization and Sparseness: the case of Dominating Set
  • Markus Lohrey and Georg Zetzsche. Knapsack in graph groups, HNN-extensions and amalgamated products
  • Davide Bilò, Luciano Gualà, Stefano Leucci and Guido Proietti. Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees
  • S. Akshay, Blaise Genest, Bruno Karelovic and Nikhil Vyas. On Regularity of unary Probabilistic Automata
  • Michał Pilipczuk and Marcin Wrochna. On space efficiency of algorithms working on structural decompositions of graphs
  • Bernhard Gittenberger and Zbigniew Golebiewski. On the number of lambda terms with prescribed size of their De Bruijn representation
  • Lin Chen and Guochuan Zhang. Packing groups of items into multiple knapsacks
  • Stepan Holub and Jeffrey Shallit. Periods and borders of random words
  • Matthias Mnich and Erik Jan van Leeuwen. Polynomial Kernels for Deletion to Acyclic Digraphs
  • Stefan Fafianie, Stefan Kratsch and Vuong Anh Quyen. Preprocessing under uncertainty
  • Raghav Kulkarni and Supartha Podder. Quantum Query Complexity of Subgraph Isomorphism and Homomorphism
  • Achim Blumensath, Thomas Colcombet and Paweł Parys. Satisfiability is Decidable for a Fragment of AMSO Logic on Infinite Words
  • Yuval Filmus, Pavel Hrubes and Massimo Lauria. Semantic versus syntactic cutting planes
  • Neeraj Kayal, Vineet Nair and Chandan Saha. Separation between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits
  • Akanksha Agrawal, Daniel Lokshtanov, Amer Mouawad and Saket Saurabh. Simultaneous Feedback Vertex Set: A Parameterized Perspective
  • Mateus de Oliveira Oliveira. Size-Treewidth Tradeoffs for Circuits Computing the Element Distinctness Function
  • Dimitris Fotakis, Michael Lampis and Vangelis Paschos. Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse
  • Clément Canonne, Ilias Diakonikolas, Themistoklis Gouleakis and Ronitt Rubinfeld. Testing Shape Restrictions of Discrete Distributions
  • Manuel Bodirsky, Peter Jonsson and Trung V. Pham. The Complexity of Phylogeny Constraint Satisfaction
  • Frederik Garbe and Richard Mycroft. The complexity of the Hamilton cycle problem in dense hypergraphs
  • Spyros Angelopoulos, Christoph Dürr and Thomas Lidbetter. The expanding search ratio of a graph
  • Mikolaj Bojanczyk, Paweł Parys and Szymon Toruńczyk. The MSO+U Theory of (N,<) Is Undecidable
  • Christoph Haase and Piotr Hofman. Tightening the Complexity of Equivalence Problems for Commutative Grammars
  • Edouard Bonnet, Michael Lampis and Vangelis Paschos. Time-Approximation Trade-offs for Inapproximable Problems
  • Timo Kötzing and Martin Schirneck. Towards an Atlas of Computational Learning Theory
  • Laure Daviaud, Denis Kuperberg and Jean-Éric Pin. Varieties of cost functions