| 2016 | 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, Orléans, France, February 17-20, 2016 Nicolas Ollinger, Heribert Vollmer |
| 2016 | A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games. Vittorio Bilò, Marios Mavronicolas |
| 2016 | A Randomized Polynomial Kernel for Subset Feedback Vertex Set. Eva-Maria C. Hols, Stefan Kratsch |
| 2016 | Airports and Railways: Facility Location Meets Network Design. Anna Adamaszek, Antonios Antoniadis, Tobias Mömke |
| 2016 | Algorithmic Statistics, Prediction and Machine Learning. Alexey Milovanov |
| 2016 | Are Short Proofs Narrow? QBF Resolution is not Simple. Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla |
| 2016 | Autoreducibility of NP-Complete Sets. John M. Hitchcock, Hadi Shafei |
| 2016 | Bottleneck Paths and Trees and Deterministic Graphical Games. Shiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir, Uri Zwick |
| 2016 | Canonizing Graphs of Bounded Tree Width in Logspace. Michael Elberfeld, Pascal Schweitzer |
| 2016 | Catalytic Space: Non-determinism and Hierarchy. Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman |
| 2016 | Characterisation of an Algebraic Algorithm for Probabilistic Automata. Nathanaël Fijalkow |
| 2016 | Complexity and Expressive Power of Ontology-Mediated Queries (Invited Talk). Carsten Lutz |
| 2016 | Computing the L1 Geodesic Diameter and Center of a Polygonal Domain. Sang Won Bae, Matias Korman, Joseph S. B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, Haitao Wang |
| 2016 | Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight. Bart M. P. Jansen |
| 2016 | Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties. Filip Mazowiecki, Cristian Riveros |
| 2016 | Cost Functions Definable by Min/Max Automata. Thomas Colcombet, Denis Kuperberg, Amaldev Manuel, Szymon Torunczyk |
| 2016 | Deciding Circular-Arc Graph Isomorphism in Parameterized Logspace. Maurice Chandoo |
| 2016 | Dense Subset Sum May Be the Hardest. Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof |
| 2016 | Derandomizing Isolation Lemma for K3, 3-free and K5-free Bipartite Graphs. Rahul Arora, Ashu Gupta, Rohit Gurjar, Raghunath Tewari |
| 2016 | Editing to Connected f-Degree Graph. Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh |
| 2016 | Efficient Enumeration of Solutions Produced by Closure Operations. Arnaud Mary, Yann Strozecki |
| 2016 | Efficiently Finding All Maximal alpha-gapped Repeats. Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea |
| 2016 | Entropy Games and Matrix Multiplication Games. Eugene Asarin, Julien Cervelle, Aldric Degorre, Catalin Dima, Florian Horn, Victor S. Kozyakin |
| 2016 | External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates. Gerth Stølting Brodal |
| 2016 | FPTAS for Hardcore and Ising Models on Hypergraphs. Pinyan Lu, Kuan Yang, Chihao Zhang |
| 2016 | Faster Algorithms for the Constrained k-Means Problem. Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar |
| 2016 | Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments. Mithilesh Kumar, Daniel Lokshtanov |
| 2016 | Fine-Grained Algorithms and Complexity (Invited Talk). Virginia Vassilevska Williams |
| 2016 | Front Matter, Foreword, Conference Organization, External Reviewers, Table of Contents. |
| 2016 | Good Predictions Are Worth a Few Comparisons. Nicolas Auger, Cyril Nicaud, Carine Pivoteau |
| 2016 | Graph Reconstruction with a Betweenness Oracle. Mikkel Abrahamsen, Greg Bodwin, Eva Rotenberg, Morten Stöckel |
| 2016 | Ideal Decompositions for Vector Addition Systems (Invited Talk). Jérôme Leroux, Sylvain Schmitz |
| 2016 | Improved Approximation Algorithms for Balanced Partitioning Problems. Harald Räcke, Richard Stotz |
| 2016 | Kernelization and Sparseness: the Case of Dominating Set. Pål Grønås Drange, Markus Sortland Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Fernando Sánchez Villaamil, Saket Saurabh, Sebastian Siebertz, Somnath Sikdar |
| 2016 | Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products. Markus Lohrey, Georg Zetzsche |
| 2016 | Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti |
| 2016 | On Regularity of Unary Probabilistic Automata. S. Akshay, Blaise Genest, Bruno Karelovic, Nikhil Vyas |
| 2016 | On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs. Michal Pilipczuk, Marcin Wrochna |
| 2016 | On a Fragment of AMSO and Tiling Systems. Achim Blumensath, Thomas Colcombet, Pawel Parys |
| 2016 | On the Number of Lambda Terms With Prescribed Size of Their De Bruijn Representation. Bernhard Gittenberger, Zbigniew Golebiewski |
| 2016 | Packing Groups of Items into Multiple Knapsacks. Lin Chen, Guochuan Zhang |
| 2016 | Periods and Borders of Random Words. Stepan Holub, Jeffrey O. Shallit |
| 2016 | Polynomial Kernels for Deletion to Classes of Acyclic Digraphs. Matthias Mnich, Erik Jan van Leeuwen |
| 2016 | Preprocessing Under Uncertainty. Stefan Fafianie, Stefan Kratsch, Vuong Anh Quyen |
| 2016 | Quantum Query Complexity of Subgraph Isomorphism and Homomorphism. Raghav Kulkarni, Supartha Podder |
| 2016 | Semantic Versus Syntactic Cutting Planes. Yuval Filmus, Pavel Hrubes, Massimo Lauria |
| 2016 | Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits. Neeraj Kayal, Vineet Nair, Chandan Saha |
| 2016 | Simultaneous Feedback Vertex Set: A Parameterized Perspective. Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh |
| 2016 | Size-Treewidth Tradeoffs for Circuits Computing the Element Distinctness Function. Mateus de Oliveira Oliveira |
| 2016 | Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse. Dimitris Fotakis, Michael Lampis, Vangelis Th. Paschos |
| 2016 | Testing Shape Restrictions of Discrete Distributions. Clément L. Canonne, Ilias Diakonikolas, Themis Gouleakis, Ronitt Rubinfeld |
| 2016 | The Complexity of Phylogeny Constraint Satisfaction. Manuel Bodirsky, Peter Jonsson, Van Trung Pham |
| 2016 | The Complexity of the Hamilton Cycle Problem in Hypergraphs of High Minimum Codegree. Frederik Garbe, Richard Mycroft |
| 2016 | The Expanding Search Ratio of a Graph. Spyros Angelopoulos, Christoph Dürr, Thomas Lidbetter |
| 2016 | The MSO+U Theory of (N, <) Is Undecidable. Mikolaj Bojanczyk, Pawel Parys, Szymon Torunczyk |
| 2016 | Tightening the Complexity of Equivalence Problems for Commutative Grammars. Christoph Haase, Piotr Hofman |
| 2016 | Time-Approximation Trade-offs for Inapproximable Problems. Édouard Bonnet, Michael Lampis, Vangelis Th. Paschos |
| 2016 | Towards an Atlas of Computational Learning Theory. Timo Kötzing, Martin Schirneck |
| 2016 | Tutorial on Cellular Automata and Tilings (Tutorial). Jarkko Kari |
| 2016 | Varieties of Cost Functions. Laure Daviaud, Denis Kuperberg, Jean-Éric Pin |