LIPIcs, Volume 9, STACS 2011

Thomas Schwentick and Christoph Dürr LIPIcs, Volume 9, STACS'11, Complete Volume 10.4230/LIPIcs.STACS.2011
Thomas Schwentick and Christoph Dürr Frontmatter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.STACS.2011.i
Susanne Albers Algorithms for Dynamic Speed Scaling 10.4230/LIPIcs.STACS.2011.1
Markus Aschinger, Conrad Drescher, Georg Gottlob, Peter Jeavons, and Evgenij Thorstensen Structural Decomposition Methods and What They are Good For 10.4230/LIPIcs.STACS.2011.12
Hubert Comon-Lundh and Véronique Cortier How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones. 10.4230/LIPIcs.STACS.2011.29
Saverio Caminiti, Irene Finocchi, and Emanuele G. Fusco Local dependency dynamic programming in the presence of memory faults 10.4230/LIPIcs.STACS.2011.45
George Giakkoupis Tight bounds for rumor spreading in graphs of a given conductance 10.4230/LIPIcs.STACS.2011.57
Liah Kor, Amos Korman, and David Peleg Tight Bounds For Distributed MST Verification 10.4230/LIPIcs.STACS.2011.69
Luc Segoufin and Szymon Torunczyk Automata based verification over linearly ordered data domains 10.4230/LIPIcs.STACS.2011.81
Diego Figueira and Luc Segoufin Bottom-up automata on data trees and vertical XPath 10.4230/LIPIcs.STACS.2011.93
Mikolaj Bojanczyk Data Monoids 10.4230/LIPIcs.STACS.2011.105
Haim Kaplan and Yahav Nussbaum Minimum s-t cut in undirected planar graphs when the source and the sink are close 10.4230/LIPIcs.STACS.2011.117
Petr Kolman and Christian Scheideler Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing 10.4230/LIPIcs.STACS.2011.129
Jiun-Jie Wang and Xin He Compact Visibility Representation of Plane Graphs 10.4230/LIPIcs.STACS.2011.141
Jeremie Chalopin, Shantanu Das, Yann Disser, Matus Mihalak, and Peter Widmayer Telling convex from reflex allows to map a polygon 10.4230/LIPIcs.STACS.2011.153
Hans L. Bodlaender, Bart M. P. Jansen, and Stefan Kratsch Cross-Composition: A New Technique for Kernelization Lower Bounds 10.4230/LIPIcs.STACS.2011.165
Bart M. P. Jansen and Hans L. Bodlaender Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter 10.4230/LIPIcs.STACS.2011.177
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, and Saket Saurabh Hitting forbidden minors: Approximation and Kernelization 10.4230/LIPIcs.STACS.2011.189
Erik D. Demaine, Matthew J. Patitz, Robert T. Schweller, and Scott M. Summers Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (Extended Abstract) 10.4230/LIPIcs.STACS.2011.201
Dominik D. Freydenberger, Hossein Nevisi, and Daniel Reidenbach Weakly Unambiguous Morphisms 10.4230/LIPIcs.STACS.2011.213
Francine Blanchet-Sadri and John Lensmire On Minimal Sturmian Partial Words 10.4230/LIPIcs.STACS.2011.225
Timon Hertli, Robin A. Moser, and Dominik Scheder Improving PPSZ for 3-SAT using Critical Variables 10.4230/LIPIcs.STACS.2011.237
Heng Guo, Sangxia Huang, Pinyan Lu, and Mingji Xia The Complexity of Weighted Boolean #CSP Modulo k 10.4230/LIPIcs.STACS.2011.249
Martin Dyer and David Richerby The #CSP Dichotomy is Decidable 10.4230/LIPIcs.STACS.2011.261
Alex Borelllo, Gaetan Richard, and Veronique Terrier A speed-up of oblivious multi-head finite automata by cellular automata 10.4230/LIPIcs.STACS.2011.273
Nazim Fates Stochastic Cellular Automata Solve the Density Classification Problem with an Arbitrary Precision 10.4230/LIPIcs.STACS.2011.284
Ana Busic, Jean Mairesse, and Irene Marcovici Probabilistic cellular automata, invariant measures, and perfect sampling 10.4230/LIPIcs.STACS.2011.296
Marcel R. Ackermann, Johannes Bloemer, Daniel Kuntze, and Christian Sohler Analysis of Agglomerative Clustering 10.4230/LIPIcs.STACS.2011.308
John Case and Timo Koetzing Measuring Learning Complexity with Criteria Epitomizers 10.4230/LIPIcs.STACS.2011.320
Howard Karloff, Flip Korn, Konstantin Makarychev, and Yuval Rabani On Parsimonious Explanations For 2-D Tree- and Linearly-Ordered Data 10.4230/LIPIcs.STACS.2011.332
Balder ten Cate and Luc Segoufin Unary negation 10.4230/LIPIcs.STACS.2011.344
Jakub Kallas, Manfred Kufleitner, and Alexander Lauser First-order Fragments with Successor over Infinite Words 10.4230/LIPIcs.STACS.2011.356
Martin Mundhenk and Felix Weiß The model checking problem for propositional intuitionistic logic with one variable is AC^1-complete 10.4230/LIPIcs.STACS.2011.368
Alejandro Lopez-Ortiz and Claude-Guy Quimper A Fast Algorithm for Multi-Machine Scheduling Problems with Jobs of Equal Processing Times 10.4230/LIPIcs.STACS.2011.380
Sze-Hang Chan, Tak-Wah Lam, and Lap-Kei Lee Scheduling for Weighted Flow Time and Energy with Rejection Penalty 10.4230/LIPIcs.STACS.2011.392
Robert Ganian, Petr Hlineny, and Jan Obdrzalek Clique-width: When Hard Does Not Mean Impossible 10.4230/LIPIcs.STACS.2011.404
Dariusz Dereniowski From Pathwidth to Connected Pathwidth 10.4230/LIPIcs.STACS.2011.416
Andrew McGregor, Atri Rudra, and Steve Uurtamo Polynomial Fitting of Data Streams with Applications to Codeword Testing 10.4230/LIPIcs.STACS.2011.428
Jonathan A. Kelner and Alex Levin Spectral Sparsification in the Semi-Streaming Setting 10.4230/LIPIcs.STACS.2011.440
Laurent Bienvenu, Wolfgang Merkle, and Andre Nies Solovay functions and K-triviality 10.4230/LIPIcs.STACS.2011.452
Andrey Yu. Rumyantsev Everywhere complex sequences and the probabilistic method 10.4230/LIPIcs.STACS.2011.464
Magnus M. Halldorsson, Boaz Patt-Shamir, and Dror Rawitz Online Scheduling with Interval Conflicts 10.4230/LIPIcs.STACS.2011.472
Christian E.J. Eggermont, Alexander Schrijver, and Gerhard J. Woeginger Analysis of multi-stage open shop processing systems 10.4230/LIPIcs.STACS.2011.484
Stefan Gulan Graphs Encoded by Regular Expressions 10.4230/LIPIcs.STACS.2011.495
Dominik D. Freydenberger Extended Regular Expressions: Succinctness and Decidability 10.4230/LIPIcs.STACS.2011.507
Maxim Babenko and Alexey Gusakov New Exact and Approximation Algorithms for the Star Packing Problem in Undirected Graphs 10.4230/LIPIcs.STACS.2011.519
Antonios Antoniadis, Falk Hueffner, Pascal Lenzner, Carsten Moldenhauer, and Alexander Souza Balanced Interval Coloring 10.4230/LIPIcs.STACS.2011.531
Bruno Grenet, Erich L. Kaltofen, Pascal Koiran, and Natacha Portier Symmetric Determinantal Representation of Weakly-Skew Circuits 10.4230/LIPIcs.STACS.2011.543
Markus Blaeser and Christian Engels Randomness Efficient Testing of Sparse Black Box Identities of Unbounded Degree over the Reals 10.4230/LIPIcs.STACS.2011.555
Youming Qiao, Jayalal Sarma M.N., and Bangsheng Tang On Isomorphism Testing of Groups with Normal Hall Subgroups 10.4230/LIPIcs.STACS.2011.567
Samir Datta, Raghav Kulkarni, Raghunath Tewari, and N. Variyam Vinodchandran Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs 10.4230/LIPIcs.STACS.2011.579
George B. Mertzios The Recognition of Triangle Graphs 10.4230/LIPIcs.STACS.2011.591
Pawel Parys Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata 10.4230/LIPIcs.STACS.2011.603
Orna Kupferman, Yoad Lustig, Moshe Y. Vardi, and Mihalis Yannakakis Temporal Synthesis for Bounded Systems and Environments 10.4230/LIPIcs.STACS.2011.615
Denis Kuperberg Linear temporal logic for regular cost functions 10.4230/LIPIcs.STACS.2011.627
Adrian Dumitrescu, Andre Schulz, Adam Sheffer, and Csaba D. Toth Bounds on the maximum multiplicity of some common geometric graphs 10.4230/LIPIcs.STACS.2011.637
Christian Knauer, Hans Raj Tiwary, and Daniel Werner On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems 10.4230/LIPIcs.STACS.2011.649
Andrew M. Childs and Robin Kothari Quantum query complexity of minor-closed graph properties 10.4230/LIPIcs.STACS.2011.661
Anna Gal and Andrew Mills Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length 10.4230/LIPIcs.STACS.2011.673
Thomas Schwentick and Christoph Dürr Index of Authors 10.4230/LIPIcs.STACS.2011.685