LIPIcs, Volume 47, STACS 2016

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