default search action
33rd STACS 2016: Orléans, France
- Nicolas Ollinger, Heribert Vollmer:
33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France. LIPIcs 47, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-001-9 - Front Matter, Foreword, Conference Organization, External Reviewers, Table of Contents. 0:i-0:xvi
- Jérôme Leroux, Sylvain Schmitz
:
Ideal Decompositions for Vector Addition Systems (Invited Talk). 1:1-1:13 - Carsten Lutz
Complexity and Expressive Power of Ontology-Mediated Queries (Invited Talk). 2:1-2:11 - Virginia Vassilevska Williams:
Fine-Grained Algorithms and Complexity (Invited Talk). 3:1-3:1 - Jarkko Kari:
Tutorial on Cellular Automata and Tilings (Tutorial). 4:1-4:1 - Mikkel Abrahamsen
Graph Reconstruction with a Betweenness Oracle. 5:1-5:14 - Anna Adamaszek
Airports and Railways: Facility Location Meets Network Design. 6:1-6:14 - Akanksha Agrawal
Simultaneous Feedback Vertex Set: A Parameterized Perspective. 7:1-7:15 - S. Akshay, Blaise Genest, Bruno Karelovic, Nikhil Vyas
On Regularity of Unary Probabilistic Automata. 8:1-8:14 - Spyros Angelopoulos, Christoph Dürr, Thomas Lidbetter:
The Expanding Search Ratio of a Graph. 9:1-9:14 - Rahul Arora
Derandomizing Isolation Lemma for K3, 3-free and K5-free Bipartite Graphs. 10:1-10:15 - Eugene Asarin
Entropy Games and Matrix Multiplication Games. 11:1-11:14 - Nicolas Auger, Cyril Nicaud, Carine Pivoteau:
Good Predictions Are Worth a Few Comparisons. 12:1-12:14 - Per Austrin, Petteri Kaski, Mikko Koivisto
Dense Subset Sum May Be the Hardest. 13:1-13:14 - Sang Won Bae
Computing the L1 Geodesic Diameter and Center of a Polygonal Domain. 14:1-14:14 - Olaf Beyersdorff
Are Short Proofs Narrow? QBF Resolution is not Simple. 15:1-15:14 - Anup Bhattacharya, Ragesh Jaiswal
Faster Algorithms for the Constrained k-Means Problem. 16:1-16:13 - Vittorio Bilò
A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games. 17:1-17:13 - Davide Bilò
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. 18:1-18:14 - Achim Blumensath
On a Fragment of AMSO and Tiling Systems. 19:1-19:14 - Manuel Bodirsky
The Complexity of Phylogeny Constraint Satisfaction. 20:1-20:13 - Mikolaj Bojanczyk, Pawel Parys
The MSO+U Theory of (N, <) Is Undecidable. 21:1-21:8 - Édouard Bonnet, Michael Lampis, Vangelis Th. Paschos:
Time-Approximation Trade-offs for Inapproximable Problems. 22:1-22:14 - Gerth Stølting Brodal
External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates. 23:1-23:14 - Harry Buhrman, Michal Koucký
Catalytic Space: Non-determinism and Hierarchy. 24:1-24:13 - Clément L. Canonne, Ilias Diakonikolas, Themis Gouleakis
Testing Shape Restrictions of Discrete Distributions. 25:1-25:14 - Maurice Chandoo:
Deciding Circular-Arc Graph Isomorphism in Parameterized Logspace. 26:1-26:13 - Shiri Chechik, Haim Kaplan, Mikkel Thorup
Bottleneck Paths and Trees and Deterministic Graphical Games. 27:1-27:13 - Lin Chen
Packing Groups of Items into Multiple Knapsacks. 28:1-28:13 - Thomas Colcombet
Cost Functions Definable by Min/Max Automata. 29:1-29:13 - Laure Daviaud
Varieties of Cost Functions. 30:1-30:14 - Pål Grønås Drange, Markus Sortland Dregi, Fedor V. Fomin
Kernelization and Sparseness: the Case of Dominating Set. 31:1-31:14 - Michael Elberfeld, Pascal Schweitzer
Canonizing Graphs of Bounded Tree Width in Logspace. 32:1-32:14 - Stefan Fafianie, Stefan Kratsch, Vuong Anh Quyen:
Preprocessing Under Uncertainty. 33:1-33:13 - Nathanaël Fijalkow
Characterisation of an Algebraic Algorithm for Probabilistic Automata. 34:1-34:13 - Yuval Filmus, Pavel Hrubes, Massimo Lauria
Semantic Versus Syntactic Cutting Planes. 35:1-35:13 - Fedor V. Fomin
Editing to Connected f-Degree Graph. 36:1-36:14 - Dimitris Fotakis, Michael Lampis, Vangelis Th. Paschos:
Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse. 37:1-37:14 - Frederik Garbe
The Complexity of the Hamilton Cycle Problem in Hypergraphs of High Minimum Codegree. 38:1-38:13 - Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl
Efficiently Finding All Maximal alpha-gapped Repeats. 39:1-39:14 - Bernhard Gittenberger
On the Number of Lambda Terms With Prescribed Size of Their De Bruijn Representation. 40:1-40:13 - Christoph Haase
Tightening the Complexity of Equivalence Problems for Commutative Grammars. 41:1-41:14 - John M. Hitchcock
Autoreducibility of NP-Complete Sets. 42:1-42:12 - Eva-Maria C. Hols, Stefan Kratsch:
A Randomized Polynomial Kernel for Subset Feedback Vertex Set. 43:1-43:14 - Stepan Holub, Jeffrey O. Shallit:
Periods and Borders of Random Words. 44:1-44:10 - Bart M. P. Jansen:
Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight. 45:1-45:13 - Neeraj Kayal, Vineet Nair, Chandan Saha:
Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits. 46:1-46:15 - Timo Kötzing, Martin Schirneck
Towards an Atlas of Computational Learning Theory. 47:1-47:13 - Raghav Kulkarni, Supartha Podder:
Quantum Query Complexity of Subgraph Isomorphism and Homomorphism. 48:1-48:13 - Mithilesh Kumar
Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments. 49:1-49:13 - Markus Lohrey
Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products. 50:1-50:14 - Pinyan Lu
FPTAS for Hardcore and Ising Models on Hypergraphs. 51:1-51:14 - Arnaud Mary
Efficient Enumeration of Solutions Produced by Closure Operations. 52:1-52:13 - Filip Mazowiecki, Cristian Riveros
Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties. 53:1-53:13 - Alexey Milovanov:
Algorithmic Statistics, Prediction and Machine Learning. 54:1-54:13 - Matthias Mnich
Polynomial Kernels for Deletion to Classes of Acyclic Digraphs. 55:1-55:13 - Mateus de Oliveira Oliveira:
Size-Treewidth Tradeoffs for Circuits Computing the Element Distinctness Function. 56:1-56:14 - Michal Pilipczuk
On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs. 57:1-57:15 - Harald Räcke, Richard Stotz
Improved Approximation Algorithms for Balanced Partitioning Problems. 58:1-58:14
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-16 00:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: