| 2011 | Minimum s-t cut in undirected planar graphs when the source and the sink are close. | Haim Kaplan, Yahav Nussbaum |
| 2011 | First-order Fragments with Successor over Infinite Words. | Jakub Kallas, Manfred Kufleitner, Alexander Lauser |
| 2011 | Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter. | Bart M. P. Jansen, Hans L. Bodlaender |
| 2011 | Improving PPSZ for 3-SAT using Critical Variables. | Timon Hertli, Robin A. Moser, Dominik Scheder |
| 2011 | Online Scheduling with Interval Conflicts. | Magns M. Halldrsson, Boaz Patt-Shamir, Dror Rawitz |
| 2011 | The Complexity of Weighted Boolean #CSP Modulo k. | Heng Guo, Sangxia Huang, Pinyan Lu, Mingji Xia |
| 2011 | Graphs Encoded by Regular Expressions. | Stefan Gulan |
| 2011 | Symmetric Determinantal Representation of Weakly-Skew Circuits. | Bruno Grenet, Erich L. Kaltofen, Pascal Koiran, Natacha Portier |
| 2011 | Tight bounds for rumor spreading in graphs of a given conductance. | George Giakkoupis |
| 2011 | Clique-width: When Hard Does Not Mean Impossible. | Robert Ganian, Petr Hlinen, Jan Obdrzlek |
| 2011 | Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length. | Anna Gl, Andrew Mills |
| 2011 | Weakly Unambiguous Morphisms. | Dominik D. Freydenberger, Hossein Nevisi, Daniel Reidenbach |
| 2011 | Extended Regular Expressions: Succinctness and Decidability. | Dominik D. Freydenberger |
| 2011 | Hitting forbidden minors: Approximation and Kernelization. | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh |
| 2011 | Bottom-up automata on data trees and vertical XPath. | Diego Figueira, Luc Segoufin |
| 2011 | Stochastic Cellular Automata Solve the Density Classification Problem with an Arbitrary Precision. | Nazim Fats |
| 2011 | Analysis of multi-stage open shop processing systems. | Christian Eggermont, Alexander Schrijver, Gerhard J. Woeginger |
| 2011 | The #CSP Dichotomy is Decidable. | Martin E. Dyer, David Richerby |
| 2011 | Bounds on the maximum multiplicity of some common geometric graphs. | Adrian Dumitrescu, Andr Schulz, Adam Sheffer, Csaba D. Tth |
| 2011 | From Pathwidth to Connected Pathwidth. | Dariusz Dereniowski |
| 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 | Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. | Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran |
| 2011 | How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones. | Hubert Comon-Lundh, Vronique Cortier |
| 2011 | Quantum query complexity of minor-closed graph properties. | Andrew M. Childs, Robin Kothari |
| 2011 | Scheduling for Weighted Flow Time and Energy with Rejection Penalty. | Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee |