Abstract is missing.
- Frontmatter, Table of Contents, Preface, Conference Organization [doi]
- Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk)Javier Esparza. 1-10 [doi]
- Semi-algebraic geometry in computational game theory - a consumer's perspective (Invited Talk)Peter Bro Miltersen. 11-12 [doi]
- A glimpse on constant delay enumeration (Invited Talk)Luc Segoufin. 13-27 [doi]
- Arithmetic Circuit Complexity (Tutorial)Neeraj Kayal. 28-28 [doi]
- Submodular Stochastic Probing on MatroidsMarek Adamczyk, Maxim Sviridenko, Justin Ward. 29-40 [doi]
- On Symmetric Circuits and Fixed-Point LogicsMatthew Anderson, Anuj Dawar. 41-52 [doi]
- Throughput Maximization in the Speed-Scaling SettingEric Angel, Evripidis Bampis, Vincent Chau. 53-62 [doi]
- Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off SchedulesAntonios Antoniadis, Neal Barcelo, Mario E. Consuegra, Peter Kling, Michael Nugent, Kirk Pruhs, Michele Scquizzato. 63-74 [doi]
- Weighted Coloring in TreesJúlio Araújo, Nicolas Nisse, Stéphane Pérennes. 75-86 [doi]
- Generalized Reordering Buffer ManagementYossi Azar, Matthias Englert, Iftah Gamzu, Eytan Kidron. 87-98 [doi]
- Shapley meets ShapleyHaris Aziz, Bart de Keijzer. 99-111 [doi]
- Complexity classes on spatially periodic Cellular AutomataNicolas Bacquey. 112-124 [doi]
- Asymmetry of the Kolmogorov complexity of online predicting odd and even bitsBruno Bauwens. 125-136 [doi]
- Two-Page Book Embeddings of 4-Planar GraphsMichael A. Bekos, Martin Gronemann, Chrysanthi N. Raftopoulou. 137-148 [doi]
- Palindrome Recognition In The Streaming ModelPetra Berenbrink, Funda Ergün, Frederik Mallmann-Trenn, Erfan Sadeqi Azer. 149-161 [doi]
- New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate StringsFrancine Blanchet-Sadri, Michelle Bodnar, Benjamin De Winkle. 162-173 [doi]
- Online Bin Packing with AdviceJoan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz. 174-186 [doi]
- Balls into bins via local search: cover time and maximum loadKarl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun 0001. 187-198 [doi]
- Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative GamesVéronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin. 199-213 [doi]
- Chordal Editing is Fixed-Parameter TractableYixin Cao, Dániel Marx. 214-225 [doi]
- Online Dynamic Power Management with Hard Real-Time GuaranteesJian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner. 226-238 [doi]
- Depth-4 Lower Bounds, Determinantal Complexity: A Unified ApproachSuryajith Chillara, Partha Mukhopadhyay. 239-250 [doi]
- Constant Factor Approximation for Capacitated k-Center with OutliersMarek Cygan, Tomasz Kociumaka. 251-262 [doi]
- Bounds on the Cover Time of Parallel Rotor WalksDariusz Dereniowski, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski. 263-275 [doi]
- Packing a Knapsack of Unknown CapacityYann Disser, Max Klimm, Nicole Megow, Sebastian Stiller. 276-287 [doi]
- Exploring Subexponential Parameterized Complexity of Completion ProblemsPål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger. 288-299 [doi]
- From Small Space to Small Width in ResolutionYuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals. 300-311 [doi]
- Explicit Linear Kernels via Dynamic ProgrammingValentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos. 312-324 [doi]
- Partition ExpandersDmitry Gavinsky, Pavel Pudlák. 325-336 [doi]
- Testing Generalised Freeness of WordsPawel Gawrychowski, Florin Manea, Dirk Nowotka. 337-349 [doi]
- Counting Homomorphisms to Cactus Graphs Modulo 2Andreas Göbel 0001, Leslie Ann Goldberg, David Richerby. 350-361 [doi]
- Irreversible computable functionsMathieu Hoyrup. 362-373 [doi]
- Ehrenfeucht-Fraïssé Games on Omega-TermsMartin Huschenbett, Manfred Kufleitner. 374-385 [doi]
- Faster Sparse Suffix SortingTomohiro I, Juha Kärkkäinen, Dominik Kempa. 386-396 [doi]
- Generalized Wong sequences and their applications to Edmonds' problemsGábor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha. 397-408 [doi]
- Read-Once Branching Programs for Tree Evaluation ProblemsKazuo Iwama, Atsuki Nagao. 409-420 [doi]
- Computability of the entropy of one-tape Turing machinesEmmanuel Jeandel. 421-432 [doi]
- Computing Optimal Tolls with Arc Restrictions and Heterogeneous PlayersTomas Jelinek, Marcus Klaas, Guido Schäfer. 433-444 [doi]
- Approximation of smallest linear tree grammarArtur Jez, Markus Lohrey. 445-457 [doi]
- Coloring 3-colorable graphs with o(n^{1/5}) colorsKen-ichi Kawarabayashi, Mikkel Thorup. 458-469 [doi]
- Randomized Online Algorithms with High Probability GuaranteesDennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke. 470-481 [doi]
- An optimal quantum algorithm for the oracle identification problemRobin Kothari. 482-493 [doi]
- A Solution to Wiehagen's ThesisTimo Kötzing. 494-505 [doi]
- Space-Efficient String Indexing for Wildcard Pattern MatchingMoshe Lewenstein, Yakov Nekrich, Jeffrey Scott Vitter. 506-517 [doi]
- Synchronizing Relations on WordsDiego Figueira, Leonid Libkin. 518-529 [doi]
- On Boolean closed full trios and rational Kripke framesMarkus Lohrey, Georg Zetzsche. 530-541 [doi]
- Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask)Dániel Marx, Michal Pilipczuk. 542-553 [doi]
- Data-Oblivious Data StructuresJohn C. Mitchell, Joe Zimmerman. 554-565 [doi]
- Higher randomness and forcing with closed setsBenoit Monin. 566-577 [doi]
- Near-Optimal Generalisations of a Theorem of MacbeathNabil H. Mustafa, Saurabh Ray. 578-589 [doi]
- Non-autoreducible Sets for NEXPDung T. Nguyen, Alan L. Selman. 590-601 [doi]
- Differentiability of polynomial time computable functionsAndré Nies. 602-613 [doi]
- 2-Stack Sorting is polynomialAdeline Pierrot, Dominique Rossin. 614-626 [doi]
- Communication Lower Bounds for Distributed-Memory ComputationsMichele Scquizzato, Francesco Silvestri. 627-638 [doi]
- Stochastic Scheduling on Unrelated MachinesMartin Skutella, Maxim Sviridenko, Marc Uetz. 639-650 [doi]
- Computational Complexity of the Extended Minimum Cost Homomorphism Problem on Three-Element DomainsHannes Uppman. 651-662 [doi]
- The Complexity of Deciding Statistical Properties of Samplable DistributionsThomas Watson 0001. 663-674 [doi]
- Faster Compact On-Line Lempel-Ziv FactorizationJun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda. 675-686 [doi]