LIPIcs, Volume 20, STACS 2013

Natacha Portier and Thomas Wilke LIPIcs, Volume 20, STACS'13, Complete Volume 10.4230/LIPIcs.STACS.2013
Natacha Portier and Thomas Wilke Frontmatter, Table of Contents, Preface, Workshop Organization 10.4230/LIPIcs.STACS.2013.i
Kousha Etessami The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games (Invited Talk) 10.4230/LIPIcs.STACS.2013.1
Nicolas Bousquet, Aurélie Lagoutte, and Thomassé Stéphan Graph coloring, communication complexity and the stubborn problem (Invited Talk) 10.4230/LIPIcs.STACS.2013.3
Kurt Mehlhorn Physarum Computations (Invited Talk) 10.4230/LIPIcs.STACS.2013.5
Dániel Marx Algorithmic Graph Structure Theory (Tutorial) 10.4230/LIPIcs.STACS.2013.7
Fedor V. Fomin and Yngve Villanger Searching for better fill-in 10.4230/LIPIcs.STACS.2013.8
Andreas Björklund, Petteri Kaski, and Lukasz Kowalik Probably Optimal Graph Motifs 10.4230/LIPIcs.STACS.2013.20
Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, and Yngve Villanger Tight bounds for Parameterized Complexity of Cluster Editing 10.4230/LIPIcs.STACS.2013.32
Albert Atserias and Sergi Oliva Bounded-width QBF is PSPACE-complete 10.4230/LIPIcs.STACS.2013.44
Daniel Paulusma, Friedrich Slivovsky, and Stefan Szeider Model Counting for CNF Formulas of Bounded Modular Treewidth 10.4230/LIPIcs.STACS.2013.55
Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, and Stefan Szeider Backdoors to q-Horn 10.4230/LIPIcs.STACS.2013.67
Stefan Kratsch On Polynomial Kernels for Sparse Integer Linear Programs 10.4230/LIPIcs.STACS.2013.80
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Dimitrios M. Thilikos Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs 10.4230/LIPIcs.STACS.2013.92
Martijn Baartse and Klaus Meer The PCP theorem for NP over the reals 10.4230/LIPIcs.STACS.2013.104
Adam Case and Jack H. Lutz Mutual Dimension 10.4230/LIPIcs.STACS.2013.116
Yoichi Iwata and Yuichi Yoshida Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point Algebra 10.4230/LIPIcs.STACS.2013.127
Konstantin Makarychev Local Search is Better than Random Assignment for Bounded Occurrence Ordering k-CSPs 10.4230/LIPIcs.STACS.2013.139
Xi Chen, Martin Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, and David Richerby The complexity of approximating conservative counting CSPs 10.4230/LIPIcs.STACS.2013.148
Yuval Ishai, Eyal Kushilevitz, and Omer Strulovich Lossy Chains and Fractional Secret Sharing 10.4230/LIPIcs.STACS.2013.160
Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Matthew J. Patitz, Robert T. Schweller, Scott M Summers, and Andrew Winslow Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM 10.4230/LIPIcs.STACS.2013.172
Malte Darnstädt, Hans Ulrich Simon, and Balázs Szörényi Unlabeled Data Does Provably Help 10.4230/LIPIcs.STACS.2013.185
Michal Pilipczuk Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings 10.4230/LIPIcs.STACS.2013.197
Marek Cygan, Fabrizio Grandoni, and Telikepalli Kavitha On Pairwise Spanners 10.4230/LIPIcs.STACS.2013.209
Jisu Jeong, O-joung Kwon, and Sang-il Oum Excluded vertex-minors for graphs of linear rank-width at most k. 10.4230/LIPIcs.STACS.2013.221
Artur Jez Recompression: a simple and powerful technique for word equations 10.4230/LIPIcs.STACS.2013.233
Tomasz Kociumaka, Jakub Radoszewski, and Wojciech Rytter Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries 10.4230/LIPIcs.STACS.2013.245
Pawel Gawrychowski, Florin Manea, Robert Mercas, Dirk Nowotka, and Catalin Tiseanu Finding Pseudo-repetitions 10.4230/LIPIcs.STACS.2013.257
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, André Schulz, Diane L. Souvaine, Giovanni Viglietta, and Andrew Winslow Algorithms for Designing Pop-Up Cards 10.4230/LIPIcs.STACS.2013.269
Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira, and Kunihiko Sadakane Space-Time Trade-offs for Stack-Based Algorithms 10.4230/LIPIcs.STACS.2013.281
Danny Z. Chen and Haitao Wang L_1 Shortest Path Queries among Polygonal Obstacles in the Plane 10.4230/LIPIcs.STACS.2013.293
Manfred Kufleitner and Alexander Lauser Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable 10.4230/LIPIcs.STACS.2013.305
Wieslaw Szwast and Lidia Tendera FO^2 with one transitive relation is decidable 10.4230/LIPIcs.STACS.2013.317
Luc Dartois and Charles Paperman Two-variable first order logic with modular predicates over words 10.4230/LIPIcs.STACS.2013.329
Magnus Wahlström Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem 10.4230/LIPIcs.STACS.2013.341
Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, and Erik Jan van Leeuwen Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs 10.4230/LIPIcs.STACS.2013.353
Florent Capelli, Arnaud Durand, and Stefan Mengel The arithmetic complexity of tensor contractions 10.4230/LIPIcs.STACS.2013.365
Edith Hemaspaandra, Lane A. Hemaspaandra, and Curtis Menton Search versus Decision for Election Manipulation Problems 10.4230/LIPIcs.STACS.2013.377
Leah Epstein, Asaf Levin, Danny Segev, and Oren Weimann Improved Bounds for Online Preemptive Matching 10.4230/LIPIcs.STACS.2013.389
Markus Jalsenius, Benny Porat, and Benjamin Sach Parameterized Matching in the Streaming Model 10.4230/LIPIcs.STACS.2013.400
Meghana Nasre Popular Matchings: Structure and Cheating Strategies 10.4230/LIPIcs.STACS.2013.412
Hartmut Klauck and Ronald de Wolf Fooling One-Sided Quantum Protocols 10.4230/LIPIcs.STACS.2013.424
Loïck Magnin and Jérémie Roland Explicit relation between all lower bound techniques for quantum query complexity 10.4230/LIPIcs.STACS.2013.434
Andris Ambainis, Arturs Backurs, Juris Smotrovs, and Ronald de Wolf Optimal quantum query bounds for almost all Boolean functions 10.4230/LIPIcs.STACS.2013.446
Nathanael Francois and Frédéric Magniez Streaming Complexity of Checking Priority Queues 10.4230/LIPIcs.STACS.2013.454
Konstantin Kutzkov Deterministic algorithms for skewed matrix products 10.4230/LIPIcs.STACS.2013.466
Tengyu Ma, Bo Tang, and Yajun Wang The Simulated Greedy Algorithm for Several Submodular Matroid Secretary Problems 10.4230/LIPIcs.STACS.2013.478
Emmanuel Jeandel and Pascal Vanier Hardness of Conjugacy, Embedding and Factorization of multidimensional Subshifts of Finite Type 10.4230/LIPIcs.STACS.2013.490
Ines Klimann The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable 10.4230/LIPIcs.STACS.2013.502
Amir M. Ben-Amram Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (Extended Abstract) 10.4230/LIPIcs.STACS.2013.514
Yonatan Bilu, Amit Daniely, Nati Linial, and Michael Saks On the practically interesting instances of MAXCUT 10.4230/LIPIcs.STACS.2013.526
György Dósa and Jiri Sgall First Fit bin packing: A tight analysis 10.4230/LIPIcs.STACS.2013.538
Amin Karbasi and Morteza Zadimoghaddam Constrained Binary Identification Problem 10.4230/LIPIcs.STACS.2013.550
Mikolaj Bojanczyk, Tomasz Idziaszek, and Michal Skrzypczak Regular languages of thin trees 10.4230/LIPIcs.STACS.2013.562
Thomas Colcombet and Laure Daviaud Approximate comparison of distance automata 10.4230/LIPIcs.STACS.2013.574
Martin Huschenbett The Rank of Tree-Automatic Linear Orderings 10.4230/LIPIcs.STACS.2013.586
Julien Clément, Thu Hien Nguyen Thi, and Brigitte Vallée A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms 10.4230/LIPIcs.STACS.2013.598
Mark Braverman and Gal Oshri Search using queries on indistinguishable items 10.4230/LIPIcs.STACS.2013.610
Balagopal Komarath and Jayalal M. N. Sarma Pebbling, Entropy and Branching Program Size Lower Bounds 10.4230/LIPIcs.STACS.2013.622
Thomas Watson Advice Lower Bounds for the Dense Model Theorem 10.4230/LIPIcs.STACS.2013.634
Natacha Portier and Thomas Wilke Author Index 10.4230/LIPIcs.STACS.2013.646