| Accepted Papers |
| |
|
| Eric Allender and Dhiraj Holden: The Minimum Oracle Circuit Size Problem |
| Saeed Akhoondian Amiri, Lukasz Kaiser, Stephan Kreutzer, Roman Rabinovich and Sebastian Siebertz: Graph Searching Games and Width Measures for Directed Graphs |
| Per Austrin, Petteri Kaski, Mikko Koivisto and Jesper Nederlof: Subset Sum in the Absence of Concentration |
| Martin Avanzini and Ugo Dal Lago: On Sharing, Memoization, and Polynomial Time |
| Olaf Beyersdorff, Leroy Chew and Mikolas Janota: Proof Complexity of Resolution-based QBF Calculi |
| Sayan Bhattacharya, Wolfgang Dvořák, Monika Henzinger and Martin Starnberger: Welfare Maximization with Friends-of-Friends Network Externalities |
| Endre Boros, Khaled Elbassioni, Vladimir Gurvich and Kazuhisa Makino: Markov Decision Processes and Stochastic Games with Total Effective Payoff |
| Joan Boyar, Lene Favrholdt, Christian Kudahl and Jesper W. Mikkelsen: Advice Complexity for a Class of Online Problems |
| Vasco Brattka, Guido Gherardi and Rupert Hölzl: Las Vegas Computability and Algorithmic Randomness |
| Johann Brault-Baron, Florent Capelli and Stefan Mengel: Understanding model counting for β-acyclic CNF-formulas |
| Karl Bringmann, Danny Hermelin, Matthias Mnich and Erik Jan van Leeuwen: Parameterized Complexity Dichotomy for Steiner Multicut |
| Tobias Brunsch, Anna Großwendt and Heiko Röglin: Solving Totally Unimodular LPs with the Shadow Vertex Algorithm |
| Norbert Bus, Shashwat Garg, Nabil Mustafa and Saurabh Ray: Improved Local Search for Geometric Hitting Set |
| Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Toth and Manuel Wettstein: Arc diagrams, flip distances, and Hamiltonian triangulations |
| Pablo Castro, Cecilia Kilmurray and Nir Piterman: Tractable Probabilistic μ-Calculus that Expresses Probabilistic Temporal Logics |
| Arkadev Chattopadhyay and Sagnik Mukhopadhyay: Tribes is hard in the message passing model |
| Markus Chimani and Joachim Spoerhase: Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees |
| Thomas Colcombet and Amaldev Manuel: Combinatorial Expressions and Lowerbounds |
| Martin Delacourt and Benjamin Hellouin de Ménibus: Construction of μ-Limit Sets of Two-Dimensional Cellular Automata |
| Irit Dinur, Prahladh Harsha, Srikanth Srinivasan and Girish Varma: Derandomized Graph Product Results using the Low Degree Long Code |
| Amr Elmasry, Torben Hagerup and Frank Kammer: Space-Efficient Basic Graph Algorithms |
| Henning Fernau, Florin Manea, Robert Mercas and Markus L. Schmid: Pattern Matching with Variables: Fast Algorithms and New Hardness Results |
| Takuro Fukunaga: Approximating the generalized terminal backup problem via half-integral multiflow relaxation |
| Esther Galby, Joel Ouaknine and James Worrell: On Matrix Powering in Low Dimensions |
| Bernd Gärtner and Antonis Thomas: The Complexity of Recognizing Unique Sink Orientations |
| Archontia Giannopoulou and George Mertzios: New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs |
| Anaël Grandjean and Victor Poupet: Comparing 1D and 2D Real Time on Cellular Automata |
| Dima Grigoriev and Vladimir Podolskii: Tropical Effective Primary and Dual Nullstellensatze |
| Jan Hązła and Thomas Holenstein: Upper Tail Estimates with Combinatorial Proofs |
| Sagi Hed, Haim Kaplan, Andrew Goldberg and Robert Tarjan:Minimum Cost Flows in Graphs with Unit Capacities |
| Rupert Hölzl, Sanjay Jain and Frank Stephan: Inductive Inference and Reverse Mathematics |
| Mathieu Hoyrup and Cristobal Rojas: On the information carried by programs about the objects they compute |
| Zengfeng Huang, Bozidar Radunovic, Milan Vojnovic and Qin Zhang: Communication Complexity of Approximate Matching in Distributed Graphs |
| Sungjin Im, Benjamin Moseley and Kirk Pruhs: Stochastic Scheduling of Heavy-tailed Jobs |
| Jesper Jansson, Zhaoxian Li and Wing-Kin Sung: On Finding the Adams Consensus Tree |
| Iyad Kanj and Ge Xia: Flip Distance is in FPT time O(n+ k * c^k) |
| Telikepalli Kavitha: New Pairwise Spanners |
| Neeraj Kayal and Chandan Saha: Multi-k-ic depth three circuit lower bound |
| Philip N. Klein, Claire Mathieu and Hang Zhou: Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs |
| Stavros Kolliopoulos and Yannis Moysoglou: Extended Formulation Lower Bounds via Hypergraph Coloring? |
| Dmitry Kosolobov: Lempel-Ziv Factorization May Be Harder Than Computing All Runs |
| Andreas Krebs, Klaus-Joern Lange and Michael Ludwig: Visibly Counter Languages and Constant Depth Circuits |
| Jakub Łącki and Piotr Sankowski: Optimal decremental connectivity in planar graphs |
| Angsheng Li and Pan Peng: Testing Small Set Expansion in General Graphs |
| Alejandro López-Ortiz, Marc Renault and Adi Rosen: Paid Exchanges are Worth the Price |
| Turlough Neary: Undecidability in binary tag systems and the Post correspondence problem for four pairs of words |
| Thomas Place and Marc Zeitoun: Separation and the Successor Relation |
| Eva Rotenberg and Jacob Holm: Dynamic planar embeddings of dynamic graphs |
| Andreas Schmid and Jens M. Schmidt: Computing 2-Walks in Polynomial Time |
| Pascal Schweitzer: Towards an Isomorphism Dichotomy for Hereditary Graph Classes |
| Till Tantau: Existential Second-Order Logic Over Graphs: A Complete Complexity-Theoretic Classification |
| Shai Vardi: The Returning Secretary |
| Marcin Wrochna: Homomorphism reconfiguration via homotopy |
| Peter Zeman and Pavel Klavík: Automorphism Groups of Geometrically Represented Graphs |
| Georg Zetzsche: Computing downward closures for stacked counter automata |
