LIPIcs, Volume 30, STACS 2015

Ernst W. Mayr and Nicolas Ollinger LIPIcs, Volume 30, STACS'15, Complete Volume 10.4230/LIPIcs.STACS.2015
Ernst W. Mayr and Nicolas Ollinger Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.STACS.2015.i
Sanjeev Arora Overcoming Intractability in Unsupervised Learning (Invited Talk) 10.4230/LIPIcs.STACS.2015.1
Manuel Bodirsky The Complexity of Constraint Satisfaction Problems (Invited Talk) 10.4230/LIPIcs.STACS.2015.2
Peter Sanders Parallel Algorithms Reconsidered (Invited Talk) 10.4230/LIPIcs.STACS.2015.10
Felix Brandt Computational Social Choice (Tutorial) 10.4230/LIPIcs.STACS.2015.19
Paul W. Goldberg Algorithmic Game Theory (Tutorial) 10.4230/LIPIcs.STACS.2015.20
Eric Allender, Dhiraj Holden, and Valentine Kabanets The Minimum Oracle Circuit Size Problem 10.4230/LIPIcs.STACS.2015.21
Saeed Akhoondian Amiri, Lukasz Kaiser, Stephan Kreutzer, Roman Rabinovich, and Sebastian Siebertz Graph Searching Games and Width Measures for Directed Graphs 10.4230/LIPIcs.STACS.2015.34
Per Austrin, Petteri Kaski, Mikko Koivisto, and Jesper Nederlof Subset Sum in the Absence of Concentration 10.4230/LIPIcs.STACS.2015.48
Martin Avanzini and Ugo Dal Lago On Sharing, Memoization, and Polynomial Time 10.4230/LIPIcs.STACS.2015.62
Olaf Beyersdorff, Leroy Chew, and Mikolás Janota Proof Complexity of Resolution-based QBF Calculi 10.4230/LIPIcs.STACS.2015.76
Sayan Bhattacharya, Wolfgang Dvorák, Monika Henzinger, and Martin Starnberger Welfare Maximization with Friends-of-Friends Network Externalities 10.4230/LIPIcs.STACS.2015.90
Endre Boros, Khaled Elbassioni, Vladimir Gurvich, and Kazuhisa Makino Markov Decision Processes and Stochastic Games with Total Effective Payoff 10.4230/LIPIcs.STACS.2015.103
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, and Jesper W. Mikkelsen Advice Complexity for a Class of Online Problems 10.4230/LIPIcs.STACS.2015.116
Vasco Brattka, Guido Gherardi, and Rupert Hölzl Las Vegas Computability and Algorithmic Randomness 10.4230/LIPIcs.STACS.2015.130
Johann Brault-Baron, Florent Capelli, and Stefan Mengel Understanding Model Counting for beta-acyclic CNF-formulas 10.4230/LIPIcs.STACS.2015.143
Karl Bringmann, Danny Hermelin, Matthias Mnich, and Erik Jan van Leeuwen Parameterized Complexity Dichotomy for Steiner Multicut 10.4230/LIPIcs.STACS.2015.157
Tobias Brunsch, Anna Großwendt, and Heiko Röglin Solving Totally Unimodular LPs with the Shadow Vertex Algorithm 10.4230/LIPIcs.STACS.2015.171
Norbert Bus, Shashwat Garg, Nabil H. Mustafa, and Saurabh Ray Improved Local Search for Geometric Hitting Set 10.4230/LIPIcs.STACS.2015.184
Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, and Manuel Wettstein Arc Diagrams, Flip Distances, and Hamiltonian Triangulations 10.4230/LIPIcs.STACS.2015.197
Pablo Castro, Cecilia Kilmurray, and Nir Piterman Tractable Probabilistic mu-Calculus That Expresses Probabilistic Temporal Logics 10.4230/LIPIcs.STACS.2015.211
Arkadev Chattopadhyay and Sagnik Mukhopadhyay Tribes Is Hard in the Message Passing Model 10.4230/LIPIcs.STACS.2015.224
Markus Chimani and Joachim Spoerhase Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees 10.4230/LIPIcs.STACS.2015.238
Thomas Colcombet and Amaldev Manuel Combinatorial Expressions and Lower Bounds 10.4230/LIPIcs.STACS.2015.249
Martin Delacourt and Benjamin Hellouin de Ménibus Construction of mu-Limit Sets of Two-dimensional Cellular Automata 10.4230/LIPIcs.STACS.2015.262
Irit Dinur, Prahladh Harsha, Srikanth Srinivasan, and Girish Varma Derandomized Graph Product Results Using the Low Degree Long Code 10.4230/LIPIcs.STACS.2015.275
Amr Elmasry, Torben Hagerup, and Frank Kammer Space-efficient Basic Graph Algorithms 10.4230/LIPIcs.STACS.2015.288
Henning Fernau, Florin Manea, Robert Mercas, and Markus L. Schmid Pattern Matching with Variables: Fast Algorithms and New Hardness Results 10.4230/LIPIcs.STACS.2015.302
Takuro Fukunaga Approximating the Generalized Terminal Backup Problem via Half-integral Multiflow Relaxation 10.4230/LIPIcs.STACS.2015.316
Esther Galby, Joël Ouaknine, and James Worrell On Matrix Powering in Low Dimensions 10.4230/LIPIcs.STACS.2015.329
Bernd Gärtner and Antonis Thomas The Complexity of Recognizing Unique Sink Orientations 10.4230/LIPIcs.STACS.2015.341
Archontia C. Giannopoulou and George B. Mertzios New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs 10.4230/LIPIcs.STACS.2015.354
Anaël Grandjean and Victor Poupet Comparing 1D and 2D Real Time on Cellular Automata 10.4230/LIPIcs.STACS.2015.367
Dima Grigoriev and Vladimir V. Podolskii Tropical Effective Primary and Dual Nullstellens"atze 10.4230/LIPIcs.STACS.2015.379
Jan Hazla and Thomas Holenstein Upper Tail Estimates with Combinatorial Proofs 10.4230/LIPIcs.STACS.2015.392
Andrew V. Goldberg, Haim Kaplan, Sagi Hed, and Robert E. Tarjan Minimum Cost Flows in Graphs with Unit Capacities 10.4230/LIPIcs.STACS.2015.406
Rupert Hölzl, Sanjay Jain, and Frank Stephan Inductive Inference and Reverse Mathematics 10.4230/LIPIcs.STACS.2015.420
Jacob Holm and Eva Rotenberg Dynamic Planar Embeddings of Dynamic Graphs 10.4230/LIPIcs.STACS.2015.434
Mathieu Hoyrup and Cristóbal Rojas On the Information Carried by Programs about the Objects They Compute 10.4230/LIPIcs.STACS.2015.447
Zengfeng Huang, Bozidar Radunovic, Milan Vojnovic, and Qin Zhang Communication Complexity of Approximate Matching in Distributed Graphs 10.4230/LIPIcs.STACS.2015.460
Sungjin Im, Benjamin Moseley, and Kirk Pruhs Stochastic Scheduling of Heavy-tailed Jobs 10.4230/LIPIcs.STACS.2015.474
Jesper Jansson, Zhaoxian Li, and Wing-Kin Sung On Finding the Adams Consensus Tree 10.4230/LIPIcs.STACS.2015.487
Iyad Kanj and Ge Xia Flip Distance Is in FPT Time O(n+ k * c^k) 10.4230/LIPIcs.STACS.2015.500
Telikepalli Kavitha New Pairwise Spanners 10.4230/LIPIcs.STACS.2015.513
Neeraj Kayal and Chandan Saha Multi-k-ic Depth Three Circuit Lower Bound 10.4230/LIPIcs.STACS.2015.527
Pavel Klavík and Peter Zeman Automorphism Groups of Geometrically Represented Graphs 10.4230/LIPIcs.STACS.2015.540
Philip N. Klein, Claire Mathieu, and Hang Zhou Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs 10.4230/LIPIcs.STACS.2015.554
Stavros G. Kolliopoulos and Yannis Moysoglou Extended Formulation Lower Bounds via Hypergraph Coloring? 10.4230/LIPIcs.STACS.2015.568
Dmitry Kosolobov Lempel-Ziv Factorization May Be Harder Than Computing All Runs 10.4230/LIPIcs.STACS.2015.582
Andreas Krebs, Klaus-Jörn Lange, and Michael Ludwig Visibly Counter Languages and Constant Depth Circuits 10.4230/LIPIcs.STACS.2015.594
Jakub Lacki and Piotr Sankowski Optimal Decremental Connectivity in Planar Graphs 10.4230/LIPIcs.STACS.2015.608
Angsheng Li and Pan Peng Testing Small Set Expansion in General Graphs 10.4230/LIPIcs.STACS.2015.622
Alejandro López-Ortiz, Marc P. Renault, and Adi Rosén Paid Exchanges are Worth the Price 10.4230/LIPIcs.STACS.2015.636
Turlough Neary Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words 10.4230/LIPIcs.STACS.2015.649
Thomas Place and Marc Zeitoun Separation and the Successor Relation 10.4230/LIPIcs.STACS.2015.662
Andreas Schmid and Jens M. Schmidt Computing 2-Walks in Polynomial Time 10.4230/LIPIcs.STACS.2015.676
Pascal Schweitzer Towards an Isomorphism Dichotomy for Hereditary Graph Classes 10.4230/LIPIcs.STACS.2015.689
Till Tantau Existential Second-order Logic over Graphs: A Complete Complexity-theoretic Classification 10.4230/LIPIcs.STACS.2015.703
Shai Vardi The Returning Secretary 10.4230/LIPIcs.STACS.2015.716
Marcin Wrochna Homomorphism Reconfiguration via Homotopy 10.4230/LIPIcs.STACS.2015.730
Georg Zetzsche Computing Downward Closures for Stacked Counter Automata 10.4230/LIPIcs.STACS.2015.743