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