Table of Contents

• Greed is Good for Deterministic Scale-Free NetworksAnkit Chauhan, Tobias Friedrich 0001, Ralf Rothenberger. [doi]
• My O Is Bigger Than Yours (Invited Talk)Holger Hermanns. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers [doi]
• Fast and Powerful Hashing Using Tabulation (Invited Talk)Mikkel Thorup. [doi]
• Tunable Online MUS/MSS EnumerationJaroslav Bendík, Nikola Benes, Ivana Cerná, Jiri Barnat. [doi]
• Aperiodicity of Rational Functions Is PSPACE-CompleteEmmanuel Filiot, Olivier Gauwin, Nathan Lhote. [doi]
• Local Testing for Membership in LatticesKarthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu. [doi]
• The Zero-Error Randomized Query Complexity of the Pointer FunctionJaikumar Radhakrishnan, Swagato Sanyal. [doi]
• Characterization and Lower Bounds for Branching Program Size Using Projective DimensionDinesh Krishnamoorthy 0001, Sajin Koroth, Jayalal Sarma. [doi]
• LZ77 Factorisation of TreesPawel Gawrychowski, Artur Jez. [doi]
• Why Liveness for Timed Automata Is Hard, and What We Can Do About ItFrédéric Herbreteau, B. Srivathsan, Thanh-Tung Tran, Igor Walukiewicz. [doi]
• Querying Regular Languages over Sliding WindowsMoses Ganardi, Danny Hucke, Markus Lohrey. [doi]
• Independent-Set Reconfiguration Thresholds of Hereditary Graph ClassesMark de Berg, Bart M. P. Jansen, Debankur Mukherjee. [doi]
• Fréchet Distance Between a Line and Avatar Point SetAritra Banik, Fahad Panolan, Venkatesh Raman 0001, Vibha Sahlot. [doi]
• Finer Separations Between Shallow Arithmetic CircuitsMrinal Kumar, Ramprasad Saptharishi. [doi]
• Super-Fast MST Algorithms in the Congested Clique Using o(m) MessagesSriram V. Pemmaraju, Vivek B. Sardeshmukh. [doi]
• Homomorphism Problems for First-Order Definable StructuresBartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk. [doi]
• Prompt DelayFelix Klein 0001, Martin Zimmermann 0002. [doi]
• Side Channel Analysis Using a Model Counting Constraint Solver and Symbolic Execution (Invited Talk)Tevfik Bultan. [doi]
• Sum of Products of Read-Once FormulasRamya C., B. V. Raghavendra Rao. [doi]
• FO-Definable Transformations of Infinite StringsVrunda Dave, Shankara Narayanan Krishna, Ashutosh Trivedi. [doi]
• Understanding Cutting Planes for QBFsOlaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla. [doi]
• Graph Decompositions and Algorithms (Invited Talk)Fedor V. Fomin. [doi]
• Probabilistic Mu-Calculus: Decidability and Complete AxiomatizationKim G. Larsen, Radu Mardare, Bingtian Xue. [doi]
• Model Checking Population ProtocolsJavier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar. [doi]
• Interval vs. Point Temporal Logic Model Checking: an Expressiveness ComparisonLaura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala. [doi]
• Lossy Kernels for Graph Contraction ProblemsR. Krithika, Pranabendu Misra, Ashutosh Rai 0001, Prafullkumar Tale. [doi]
• Parameterized Algorithms for List K-CycleFahad Panolan, Meirav Zehavi. [doi]
• The Power and Limitations of Uniform Samples in Testing Properties of FiguresPiotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova. [doi]
• Decidability and Complexity of Tree Share FormulasXuan Bach Le, Aquinas Hobor, Anthony W. Lin. [doi]
• Stable Matching Games: Manipulation via Subgraph IsomorphismSushmita Gupta, Sanjukta Roy. [doi]
• The Adwords Problem with Strict Capacity ConstraintsUmang Bhaskar, Ajil Jalal, Rahul Vaze. [doi]
• Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite TournamentsMithilesh Kumar, Daniel Lokshtanov. [doi]
• Finger Search in Grammar-Compressed StringsPhilip Bille, Anders Roy Christiansen, Patrick Hagge Cording, Inge Li Gørtz. [doi]
• On the Sensitivity Conjecture for Disjunctive Normal FormsKarthik C. S., Sébastien Tavenas. [doi]
• Strong Parameterized Deletion: Bipartite GraphsAshutosh Rai 0001, M. S. Ramanujan. [doi]
• Verified Analysis of List Update AlgorithmsMaximilian P. L. Haslbeck, Tobias Nipkow. [doi]
• Capacitated k-Center Problem with Vertex WeightsAounon Kumar. [doi]
• Mixed-Criticality Scheduling to Minimize MakespanSanjoy K. Baruah, Arvind Easwaran, Zhishan Guo. [doi]
• Relational Logic with Framing and HypothesesAnindya Banerjee, David A. Naumann, Mohammad Nikouei. [doi]
• Most Likely Voronoi Diagrams in Higher DimensionsNirman Kumar, Benjamin Raichel, Subhash Suri, Kevin Verbeek. [doi]
• Mean-Payoff Games on Timed AutomataShibashis Guha, Marcin Jurdzinski, Shankara Narayanan Krishna, Ashutosh Trivedi. [doi]
• Embedding Approximately Low-Dimensional l_2^2 Metrics into l_1Amit Deshpande, Prahladh Harsha, Rakesh Venkat. [doi]
• One-Counter Automata with Counter ObservabilityBenedikt Bollig. [doi]
• Visibly Linear Dynamic LogicAlexander Weinert, Martin Zimmermann 0002. [doi]
• Robust Multiplication-Based Tests for Reed-Muller CodesPrahladh Harsha, Srikanth Srinivasan. [doi]
• Simple Invariants for Proving the Safety of Distributed Protocols (Invited Talk)Mooly Sagiv. [doi]
• Continuous Optimization: The "Right" Language for Graph Algorithms? (Invited Talk)Aleksander Madry. [doi]
• Improved Pseudo-Polynomial-Time Approximation for Strip PackingWaldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Arindam Khan. [doi]
• Admissibility in Quantitative Graph GamesRomain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur. [doi]
• Summaries for Context-Free GamesLukás Holík, Roland Meyer, Sebastian Muskalla. [doi]