Abstract is missing.
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Graph Pattern PolynomialsMarkus Bläser, Balagopal Komarath, Karteek Sreenivasaiah. [doi]
- Reducing Transducer Equivalence to Register Automata Problems Solved by "Hilbert Method"Adrien Boiret, Radoslaw Piórkowski, Janusz Schmude. [doi]
- Combinatorial Algorithms for General Linear Arrow-Debreu MarketsBhaskar Ray Chaudhury, Kurt Mehlhorn. [doi]
- Lambda-Definable Order-3 Tree Functions are Well-Quasi-OrderedKazuyuki Asada, Naoki Kobayashi 0001. [doi]
- On the Way to Alternating Weak AutomataUdi Boker, Karoliina Lehtinen. [doi]
- Random Testing for Distributed Systems with Theoretical Guarantees (Invited Paper)Rupak Majumdar. [doi]
- The Parikh Property for Weighted Context-Free GrammarsPierre Ganty, Elena Gutiérrez. [doi]
- Shortest k-Disjoint Paths via DeterminantsSamir Datta, Siddharth Iyer, Raghav Kulkarni, Anish Mukherjee 0001. [doi]
- A Symbolic Framework to Analyse Physical Proximity in Security ProtocolsAlexandre Debant, Stéphanie Delaune, Cyrille Wiedling. [doi]
- Popular Matchings in Complete GraphsÁgnes Cseh, Telikepalli Kavitha. [doi]
- On the Welfare of Cardinal Voting MechanismsUmang Bhaskar, Abheek Ghosh. [doi]
- Constant Factor Approximation Algorithm for Uniform Hard Capacitated Knapsack Median ProblemSapna Grover, Neelima Gupta, Samir Khuller, Aditya Pancholi. [doi]
- Univariate Ideal Membership Parameterized by Rank, Degree, and Number of GeneratorsVikraman Arvind, Abhranil Chatterjee 0001, Rajit Datta, Partha Mukhopadhyay. [doi]
- Büchi Good-for-Games Automata Are Efficiently RecognizableMarc Bagnol, Denis Kuperberg. [doi]
- On the Inner Product Predicate and a Generalization of Matching Vector FamiliesBalthazar Bauer, Jevgenijs Vihrovs, Hoeteck Wee. [doi]
- A 5-Approximation for Universal Facility LocationManisha Bansal, Naveen Garg 0001, Neelima Gupta. [doi]
- Safe and Optimal Scheduling for Hard and Soft TasksGilles Geeraerts, Shibashis Guha, Jean-François Raskin. [doi]
- Continuous Algorithms (Invited Paper)Santosh Vempala. [doi]
- Model Checking Randomized Security Protocols (Invited Paper)A. Prasad Sistla. [doi]
- Verification of Timed Asynchronous ProgramsParosh Aziz Abdulla, Mohamed Faouzi Atig, Shankara Narayanan Krishna, Shaan Vaidya. [doi]
- On the Probabilistic Degree of OR over the RealsSiddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan 0001. [doi]
- On the Boundedness Problem for Higher-Order Pushdown Vector Addition SystemsVincent Penelle, Sylvain Salvati, Grégoire Sutre. [doi]
- On Canonical Models for Rational Functions over Infinite WordsEmmanuel Filiot, Olivier Gauwin, Nathan Lhote, Anca Muscholl. [doi]
- Symbolic Approximation of Weighted Timed GamesDamien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier. [doi]
- Reachability for Two-Counter Machines with One Test and One ResetAlain Finkel, Jérôme Leroux, Grégoire Sutre. [doi]
- On Fair Division for Indivisible ItemsBhaskar Ray Chaudhury, Yun Kuen Cheung, Jugal Garg, Naveen Garg 0001, Martin Hoefer, Kurt Mehlhorn. [doi]
- Origin-Equivalence of Two-Way Word Transducers Is in PSPACESougata Bose, Anca Muscholl, Vincent Penelle, Gabriele Puppis. [doi]
- Hyper Partial Order LogicBéatrice Bérard, Stefan Haar, Loïc Hélouët. [doi]
- Space Complexity of Two Adaptive Bitprobe Schemes Storing Three ElementsDeepanjan Kesh. [doi]
- Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence NumberPranabendu Misra, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi. [doi]
- The Complexity of Separation for Levels in Concatenation HierarchiesThomas Place, Marc Zeitoun. [doi]
- Deterministic Algorithms for Maximum Matching on General Graphs in the Semi-Streaming ModelSumedh Tirodkar. [doi]
- Bundled Fragments of First-Order Modal Logic: (Un)DecidabilityAnantha Padmanabha, R. Ramanujam, Yanjing Wang. [doi]
- Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCSKarl Bringmann, Bhaskar Ray Chaudhury. [doi]
- Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner NetworkAmy Babay, Michael Dinitz, Zeyu Zhang. [doi]
- Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup ModelSwaroop N. Prabhakar, Vikram Sharma 0001. [doi]
- Uniformly Automatic Classes of Finite StructuresFaried Abu Zaid. [doi]
- The Cayley-Graph of the Queue Monoid: Logic and DecidabilityFaried Abu Zaid, Chris Köcher. [doi]
- New Constructions with Quadratic Separation between Sensitivity and Block SensitivitySiddhesh Chaubal, Anna Gál. [doi]
- Extending Propositional Separation Logic for Robustness PropertiesAlessio Mansutti. [doi]
- Quasipolynomial Hitting Sets for Circuits with Restricted Parse TreesRamprasad Saptharishi, Anamay Tengse. [doi]
- Algorithms for the Asymmetric Traveling Salesman Problem (Invited Paper)Ola Svensson. [doi]
- The Delta-FrameworkFurio Honsell, Luigi Liquori, Claude Stolze, Ivan Scagnetto. [doi]
- Extending Finite-Memory Determinacy by Boolean Combination of Winning ConditionsStéphane Le Roux 0001, Arno Pauly, Mickael Randour. [doi]
- A Hypersequent Calculus with Clusters for Tense Logic over OrdinalsDavid Baelde, Anthony Lick, Sylvain Schmitz. [doi]
- Parameterized Dynamic Cluster EditingJunjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier. [doi]
- Towards a General Direct Product Testing TheoremElazar Goldenberg, Karthik C. S.. [doi]
- On the Parameterized Complexity of [1, j]-Domination ProblemsMohsen Alambardar Meybodi, Fedor V. Fomin, Amer E. Mouawad, Fahad Panolan. [doi]