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