LIPIcs, Volume 25, STACS 2014
-
Ernst W. Mayr and Natacha Portier
LIPIcs, Volume 25, STACS'14, Complete Volume
10.4230/LIPIcs.STACS.2014
-
Ernst W. Mayr and Natacha Portier
Frontmatter, Table of Contents, Preface, Conference Organization
10.4230/LIPIcs.STACS.2014.i
-
Javier Esparza
Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk)
10.4230/LIPIcs.STACS.2014.1
-
Peter Bro Miltersen
Semi-algebraic geometry in computational game theory - a consumer's perspective (Invited Talk)
10.4230/LIPIcs.STACS.2014.11
-
Luc Segoufin
A glimpse on constant delay enumeration (Invited Talk)
10.4230/LIPIcs.STACS.2014.13
-
Neeraj Kayal
Arithmetic Circuit Complexity (Tutorial)
10.4230/LIPIcs.STACS.2014.28
-
Marek Adamczyk, Maxim Sviridenko, and Justin Ward
Submodular Stochastic Probing on Matroids
10.4230/LIPIcs.STACS.2014.29
-
Matthew Anderson and Anuj Dawar
On Symmetric Circuits and Fixed-Point Logics
10.4230/LIPIcs.STACS.2014.41
-
Eric Angel, Evripidis Bampis, and Vincent Chau
Throughput Maximization in the Speed-Scaling Setting
10.4230/LIPIcs.STACS.2014.53
-
Antonios Antoniadis, Neal Barcelo, Mario Consuegra, Peter Kling, Michael Nugent, Kirk Pruhs, and Michele Scquizzato
Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules
10.4230/LIPIcs.STACS.2014.63
-
Julio Araujo, Nicolas Nisse, and Stéphane Pérennes
Weighted Coloring in Trees
10.4230/LIPIcs.STACS.2014.75
-
Yossi Azar, Matthias Englert, Iftah Gamzu, and Eytan Kidron
Generalized Reordering Buffer Management
10.4230/LIPIcs.STACS.2014.87
-
Haris Aziz and Bart de Keijzer
Shapley meets Shapley
10.4230/LIPIcs.STACS.2014.99
-
Nicolas Bacquey
Complexity classes on spatially periodic Cellular Automata
10.4230/LIPIcs.STACS.2014.112
-
Bruno Bauwens
Asymmetry of the Kolmogorov complexity of online predicting odd and even bits
10.4230/LIPIcs.STACS.2014.125
-
Michael A. Bekos, Martin Gronemann, and Chrysanthi N. Raftopoulou
Two-Page Book Embeddings of 4-Planar Graphs
10.4230/LIPIcs.STACS.2014.137
-
Petra Berenbrink, Funda Ergün, Frederik Mallmann-Trenn, and Erfan Sadeqi Azer
Palindrome Recognition In The Streaming Model
10.4230/LIPIcs.STACS.2014.149
-
Francine Blanchet-Sadri, Michelle Bodnar, and Benjamin De Winkle
New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings
10.4230/LIPIcs.STACS.2014.162
-
Joan Boyar, Shahin Kamali, Kim S. Larsen, and Alejandro López-Ortiz
Online Bin Packing with Advice
10.4230/LIPIcs.STACS.2014.174
-
Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, and He Sun
Balls into bins via local search: cover time and maximum load
10.4230/LIPIcs.STACS.2014.187
-
Véronique Bruyère, Emmanuel Filiot, Mickael Randour, and Jean-François Raskin
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games
10.4230/LIPIcs.STACS.2014.199
-
Yixin Cao and Dániel Marx
Chordal Editing is Fixed-Parameter Tractable
10.4230/LIPIcs.STACS.2014.214
-
Jian-Jia Chen, Mong-Jen Kao, D.T. Lee, Ignaz Rutter, and Dorothea Wagner
Online Dynamic Power Management with Hard Real-Time Guarantees
10.4230/LIPIcs.STACS.2014.226
-
Suryajith Chillara and Partha Mukhopadhyay
Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach
10.4230/LIPIcs.STACS.2014.239
-
Marek Cygan and Tomasz Kociumaka
Constant Factor Approximation for Capacitated k-Center with Outliers
10.4230/LIPIcs.STACS.2014.251
-
Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak, and Przemyslaw Uznanski
Bounds on the Cover Time of Parallel Rotor Walks
10.4230/LIPIcs.STACS.2014.263
-
Yann Disser, Max Klimm, Nicole Megow, and Sebastian Stiller
Packing a Knapsack of Unknown Capacity
10.4230/LIPIcs.STACS.2014.276
-
Pal Gronas Drange, Fedor V. Fomin, Michal Pilipczuk, and Yngve Villanger
Exploring Subexponential Parameterized Complexity of Completion Problems
10.4230/LIPIcs.STACS.2014.288
-
Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, and Marc Vinyals
From Small Space to Small Width in Resolution
10.4230/LIPIcs.STACS.2014.300
-
Valentin Garnero, Christophe Paul, Ignasi Sau, and Dimitrios M. Thilikos
Explicit Linear Kernels via Dynamic Programming
10.4230/LIPIcs.STACS.2014.312
-
Dmitry Gavinsky and Pavel Pudlák
Partition Expanders
10.4230/LIPIcs.STACS.2014.325
-
Pawel Gawrychowski, Florin Manea, and Dirk Nowotka
Testing Generalised Freeness of Words
10.4230/LIPIcs.STACS.2014.337
-
Andreas Göbel, Leslie Ann Goldberg, and David Richerby
Counting Homomorphisms to Cactus Graphs Modulo 2
10.4230/LIPIcs.STACS.2014.350
-
Mathieu Hoyrup
Irreversible computable functions
10.4230/LIPIcs.STACS.2014.362
-
Martin Huschenbett and Manfred Kufleitner
Ehrenfeucht-Fraïssé Games on Omega-Terms
10.4230/LIPIcs.STACS.2014.374
-
Tomohiro I, Juha Kärkkäinen, and Dominik Kempa
Faster Sparse Suffix Sorting
10.4230/LIPIcs.STACS.2014.386
-
Gábor Ivanyos, Marek Karpinski, Youming Qiao, and Miklos Santha
Generalized Wong sequences and their applications to Edmonds' problems
10.4230/LIPIcs.STACS.2014.397
-
Kazuo Iwama and Atsuki Nagao
Read-Once Branching Programs for Tree Evaluation Problems
10.4230/LIPIcs.STACS.2014.409
-
Emmanuel Jeandel
Computability of the entropy of one-tape Turing machines
10.4230/LIPIcs.STACS.2014.421
-
Tomas Jelinek, Marcus Klaas, and Guido Schäfer
Computing Optimal Tolls with Arc Restrictions and Heterogeneous Players
10.4230/LIPIcs.STACS.2014.433
-
Artur Jez and Markus Lohrey
Approximation of smallest linear tree grammar
10.4230/LIPIcs.STACS.2014.445
-
Ken-ichi Kawarabayashi and Mikkel Thorup
Coloring 3-colorable graphs with o(n^{1/5}) colors
10.4230/LIPIcs.STACS.2014.458
-
Dennis Komm, Rastislav Královic, Richard Královic, and Tobias Mömke
Randomized Online Algorithms with High Probability Guarantees
10.4230/LIPIcs.STACS.2014.470
-
Robin Kothari
An optimal quantum algorithm for the oracle identification problem
10.4230/LIPIcs.STACS.2014.482
-
Timo Kötzing
A Solution to Wiehagen's Thesis
10.4230/LIPIcs.STACS.2014.494
-
Moshe Lewenstein, Yakov Nekrich, and Jeffrey Scott Vitter
Space-Efficient String Indexing for Wildcard Pattern Matching
10.4230/LIPIcs.STACS.2014.506
-
Diego Figueira and Leonid Libkin
Synchronizing Relations on Words
10.4230/LIPIcs.STACS.2014.518
-
Markus Lohrey and Georg Zetzsche
On Boolean closed full trios and rational Kripke frames
10.4230/LIPIcs.STACS.2014.530
-
Dániel Marx and Michal Pilipczuk
Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask)
10.4230/LIPIcs.STACS.2014.542
-
John C. Mitchell and Joe Zimmerman
Data-Oblivious Data Structures
10.4230/LIPIcs.STACS.2014.554
-
Benoit Monin
Higher randomness and forcing with closed sets
10.4230/LIPIcs.STACS.2014.566
-
Nabil H. Mustafa and Saurabh Ray
Near-Optimal Generalisations of a Theorem of Macbeath
10.4230/LIPIcs.STACS.2014.578
-
Dung T. Nguyen and Alan L. Selman
Non-autoreducible Sets for NEXP
10.4230/LIPIcs.STACS.2014.590
-
André Nies
Differentiability of polynomial time computable functions
10.4230/LIPIcs.STACS.2014.602
-
Adeline Pierrot and Dominique Rossin
2-Stack Sorting is polynomial
10.4230/LIPIcs.STACS.2014.614
-
Michele Scquizzato and Francesco Silvestri
Communication Lower Bounds for Distributed-Memory Computations
10.4230/LIPIcs.STACS.2014.627
-
Martin Skutella, Maxim Sviridenko, and Marc Uetz
Stochastic Scheduling on Unrelated Machines
10.4230/LIPIcs.STACS.2014.639
-
Hannes Uppman
Computational Complexity of the Extended Minimum Cost Homomorphism Problem on Three-Element Domains
10.4230/LIPIcs.STACS.2014.651
-
Thomas Watson
The Complexity of Deciding Statistical Properties of Samplable Distributions
10.4230/LIPIcs.STACS.2014.663
-
Jun'ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda
Faster Compact On-Line Lempel-Ziv Factorization
10.4230/LIPIcs.STACS.2014.675