Table of Contents

• Towards a Polynomial Kernel for Directed Feedback Vertex SetBergougnoux Benjamin, Eiben Eduard, Ganian Robert, Ordyniak Sebastian, Ramanujan M. S.. [doi]
• Being Even Slightly Shallow Makes Life HardIrene Muzi, Michael P. O'Brien, Felix Reidl, Blair D. Sullivan. [doi]
• Grammars for Indentation-Sensitive ParsingHärmel Nestra. [doi]
• Communication Complexity of Pairs of Graph Families with ApplicationsSudeshna Kolay, Fahad Panolan, Saket Saurabh 0001. [doi]
• Lower Bounds and PIT for Non-Commutative Arithmetic Circuits with Restricted Parse TreesGuillaume Lagarde, Nutan Limaye, Srikanth Srinivasan 0001. [doi]
• Selecting Nodes and Buying Links to Maximize the Information Diffusion in a NetworkGianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj. [doi]
• New Insights on the (Non-)Hardness of Circuit Minimization and Related ProblemsEric Allender, Shuichi Hirahara. [doi]
• Does Looking Inside a Circuit Help?Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Pierre McKenzie, Shadab Romani. [doi]
• The Hardness of Solving Simple Word EquationsJoel D. Day, Florin Manea, Dirk Nowotka. [doi]
• Combinatorial Properties and Recognition of Unit Square Visibility GraphsKatrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides. [doi]
• Better Complexity Bounds for Cost Register AutomataEric Allender, Andreas Krebs, Pierre McKenzie. [doi]
• Variations on Inductive-Recursive DefinitionsNeil Ghani, Conor McBride, Fredrik Nordvall Forsberg, Stephan Spahn. [doi]
• Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching ProgramsLudmila Glinskih, Dmitry Itsykson. [doi]
• On Definable and Recognizable Properties of Graphs of Bounded Treewidth (Invited Talk)Michal Pilipczuk. [doi]
• Two-Planar Graphs Are QuasiplanarMichael Hoffmann 0001, Csaba D. Tóth. [doi]
• Recognizing Graphs Close to Bipartite GraphsMarthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson 0002, Daniël Paulusma. [doi]
• The Complexity of Quantum DisjointnessHartmut Klauck. [doi]
• Small-Space LCE Data Structure with Constant-Time QueriesYuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda. [doi]
• The Quantum Monad on Relational StructuresSamson Abramsky, Rui Soares Barbosa, Nadish de Silva, Octavio Zapata. [doi]
• The Power of Linear-Time Data Reduction for Maximum MatchingGeorge B. Mertzios, André Nichterlein, Rolf Niedermeier. [doi]
• Generalized Predecessor Existence Problems for Boolean Finite Dynamical SystemsAkinori Kawachi, Mitsunori Ogihara, Kei Uchizawa. [doi]
• Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected GraphsKrishnendu Chatterjee, Rasmus Ibsen-Jensen, Martin A. Nowak. [doi]
• On Multidimensional and Monotone k-SUMChloe Ching-Yun Hsu, Chris Umans. [doi]
• The Equivalence, Unambiguity and Sequentiality Problems of Finitely Ambiguous Max-Plus Tree Automata are DecidableErik Paul. [doi]
• Faster Algorithms for Mean-Payoff Parity GamesKrishnendu Chatterjee, Monika Henzinger, Alexander Svozil. [doi]
• Compositional Weak Metrics for Group Key UpdateRuggero Lanotte, Massimo Merro, Simone Tini. [doi]
• Making Metric Temporal Logic RationalShankara Narayanan Krishna, Khushraj Madnani, Paritosh K. Pandya. [doi]
• The Complexity of Boolean Surjective General-Valued CSPsPeter Fulla, Stanislav Zivny. [doi]
• Hypercube LSH for Approximate near NeighborsThijs Laarhoven. [doi]
• Dividing Splittable Goods Evenly and With Limited FragmentationPeter Damaschke. [doi]
• Domains for Higher-Order GamesMatthew Hague, Roland Meyer, Sebastian Muskalla. [doi]
• Hardness and Approximation of High-Dimensional Search Problems (Invited Talk)Rasmus Pagh. [doi]
• One-Dimensional Logic over TreesEmanuel Kieronski, Antti Kuusisto. [doi]
• Temporal Logics for Multi-Agent Systems (Invited Talk)Nicolas Markey. [doi]
• Ideal-Based Algorithms for the Symbolic Verification of Well-Structured Systems (Invited Talk)Philippe Schnoebelen. [doi]
• Walrasian Pricing in Multi-Unit AuctionsSimina Brânzei, Aris Filos-Ratsikas, Peter Bro Miltersen, Yulong Zeng. [doi]
• Emptiness Problems for Integer CircuitsDominik Barth, Moritz Beck, Titus Dose, Christian Glaßer, Larissa Michler, Marc Technau. [doi]
• Reversible Kleene latticesPaul Brunet. [doi]
• An Improved FPT Algorithm for the Flip Distance ProblemShaohua Li, Qilong Feng, XiangZhong Meng, Jianxin Wang. [doi]
• Parameterized Algorithms and Kernels for Rainbow MatchingSushmita Gupta, Sanjukta Roy, Saket Saurabh 0001, Meirav Zehavi. [doi]
• Lossy Kernels for Hitting SubgraphsEduard Eiben, Danny Hermelin, M. S. Ramanujan. [doi]
• Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive HexagonNarayan Vikas. [doi]
• Induced Embeddings into Hamming GraphsMartin Milanic, Peter Mursic, Marcelo Mydlarz. [doi]
• 0 Circuits for Algorithmic Problems in Nilpotent GroupsAlexei G. Myasnikov, Armin Weiß. [doi]
• Approximation and Parameterized Algorithms for Geometric Independent Set with ShrinkingMichal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese. [doi]
• Timed Network GamesGuy Avni, Shibashis Guha, Orna Kupferman. [doi]
• On the Exact Amount of Missing Information that Makes Finding Possible Winners HardPalash Dey, Neeldhara Misra. [doi]
• A Characterisation of Pi^0_2 Regular Tree LanguagesFilippo Cavallari, Henryk Michalewski, Michal Skrzypczak. [doi]
• Structured Connectivity AugmentationFedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos. [doi]
• The Complexity of SORE-definability ProblemsPing Lu, Zhilin Wu, Haiming Chen. [doi]
• Kernelization of the Subset General Position Problem in GeometryJean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay. [doi]
• Smoothed and Average-Case Approximation Ratios of Mechanisms: Beyond the Worst-Case AnalysisXiaotie Deng, Yansong Gao, Jie Zhang 0008. [doi]
• Automata in the Category of Glued Vector SpacesThomas Colcombet, Daniela Petrisan. [doi]
• Regular Language Distance and EntropyAustin J. Parker, Kelly B. Yancey, Matthew P. Yancey. [doi]
• The Shortest Identities for Max-Plus Automata with Two StatesLaure Daviaud, Marianne Johnson. [doi]
• K4-free Graphs as a Free AlgebraEnric Cosme-Llópez, Damien Pous. [doi]
• Eilenberg Theorems for FreeHenning Urbat, Jirí Adámek, Liang-Ting Chen, Stefan Milius. [doi]
• Distributed Strategies Made EasySimon Castellan, Pierre Clairambault, Glynn Winskel. [doi]
• Monitor Logics for Quantitative Monitor AutomataErik Paul. [doi]
• Computing the Maximum using (min, +) FormulasMeena Mahajan, Prajakta Nimbhorkar, Anuj Tawari. [doi]
• Counting Problems for Parikh ImagesChristoph Haase, Stefan Kiefer, Markus Lohrey. [doi]
• ZX-Calculus: Cyclotomic Supplementarity and Incompleteness for Clifford+T Quantum MechanicsEmmanuel Jeandel, Simon Perdrix, Renaud Vilmart, Quanlong Wang. [doi]
• On the Upward/Downward Closures of Petri NetsMohamed Faouzi Atig, Roland Meyer, Sebastian Muskalla, Prakash Saivasan. [doi]
• Membership Problem in GL(2, Z) Extended by Singular MatricesIgor Potapov, Pavel Semukhin. [doi]
• The Complexity of Quantified Constraints Using the Algebraic FormulationCatarina Carvalho, Barnaby Martin, Dmitriy Zhuk. [doi]
• On the Expressive Power of Quasiperiodic SFTBruno Durand, Andrei E. Romashchenko. [doi]
• The 2CNF Boolean Formula Satisfiability Problem and the Linear Space HypothesisTomoyuki Yamakami. [doi]
• Undecidable Problems for Probabilistic Network ProgrammingDavid M. Kahn. [doi]
• Parameterized Algorithms for Partitioning Graphs into Highly Connected ClustersIvan Bliznets, Nikolay Karpov. [doi]
• Clique-Width for Graph Classes Closed under ComplementationAlexandre Blanché, Konrad K. Dabrowski, Matthew Johnson 0002, Vadim V. Lozin, Daniël Paulusma, Viktor Zamaraev. [doi]
• Model Checking and Validity in Propositional and Modal Inclusion LogicsLauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema. [doi]
• Efficient Identity Testing and Polynomial Factorization in Nonassociative Free RingsVikraman Arvind, Rajit Datta, Partha Mukhopadhyay, S. Raja 0001. [doi]
• Complexity of Restricted Variants of Skolem and Related ProblemsS. Akshay, Nikhil Balaji, Nikhil Vyas. [doi]
• A Formal Semantics of Influence in Bayesian ReasoningBart Jacobs 0001, Fabio Zanasi. [doi]
• Fine-Grained Complexity of Rainbow Coloring and its VariantsAkanksha Agrawal. [doi]
• Time Complexity of Constraint Satisfaction via Universal AlgebraPeter Jonsson, Victor Lagerkvist, Biman Roy. [doi]
• Another Characterization of the Higher K-TrivialsPaul-Elliot Anglès d'Auriac, Benoit Monin. [doi]
• The Power of Programs over Monoids in DANathan Grosshans, Pierre McKenzie, Luc Segoufin. [doi]
• Binary Search in Graphs RevisitedArgyrios Deligkas, George B. Mertzios, Paul G. Spirakis. [doi]
• Comparison of Max-Plus Automata and Joint Spectral Radius of Tropical MatricesLaure Daviaud, Pierre Guillon 0001, Glenn Merlet. [doi]
• Weighted Operator Precedence LanguagesManfred Droste, Stefan Dück, Dino Mandrioli, Matteo Pradella. [doi]
• Attainable Values of Reset ThresholdsMichalina Dzyga, Robert Ferens, Vladimir V. Gusev, Marek Szykula. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph ParametersTatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou. [doi]
• Strategy Complexity of Concurrent Safety GamesKrishnendu Chatterjee, Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen. [doi]
• Fractal Intersections and Products via Algorithmic DimensionNeil Lutz. [doi]