| 2011 | A Bad Instance for k-Means++. Tobias Brunsch, Heiko Röglin |
| 2011 | A Better Upper Bound on Weights of Exact Threshold Functions. Xue Chen, Guangda Hu, Xiaoming Sun |
| 2011 | A Compact Encoding of Unordered Binary Trees. Kozue Iwata, Shiro Ishiwata, Shin-Ichi Nakano |
| 2011 | A Note on Obfuscation for Cryptographic Functionalities of Secret-Operation Then Public-Encryption. Ning Ding, Dawu Gu |
| 2011 | A Real Elementary Approach to the Master Recurrence and Generalizations. Chee Yap |
| 2011 | An Algebraic Characterization of Strictly Piecewise Languages. Jie Fu, Jeffrey Heinz, Herbert G. Tanner |
| 2011 | An Improved Kernel for Planar Connected Dominating Set. Weizhong Luo, Jianxin Wang, Qilong Feng, Jiong Guo, Jianer Chen |
| 2011 | An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree. Takehiro Ito, Kazuto Kawamura, Xiao Zhou |
| 2011 | Approximability of the Subset Sum Reconfiguration Problem. Takehiro Ito, Erik D. Demaine |
| 2011 | Approximating Edge Dominating Set in Dense Graphs. Richard Schmied, Claus Viehmann |
| 2011 | Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands. Takuro Fukunaga |
| 2011 | Catching a Fast Robber on Interval Graphs. Tomas Gavenciak |
| 2011 | Closed Left-R.E. Sets. Sanjay Jain, Frank Stephan, Jason Teutsch |
| 2011 | Designing Algorithms with Limited Work Space. Tetsuo Asano |
| 2011 | Deterministic Algorithms for Multi-criteria TSP. Bodo Manthey |
| 2011 | Edge Contractions in Subclasses of Chordal Graphs. Rémy Belmonte, Pinar Heggernes, Pim van 't Hof |
| 2011 | Energy and Fan-In of Threshold Circuits Computing Mod Functions. Akira Suzuki, Kei Uchizawa, Xiao Zhou |
| 2011 | Extending Partial Representations of Interval Graphs. Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil |
| 2011 | Fast Exact Algorithm for Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski |
| 2011 | Generalized Satisfiability for the Description Logic Arne Meier, Thomas Schneider |
| 2011 | Grey-Box Steganography. Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel |
| 2011 | Group-Theoretic Lower Bounds for the Complexity of Matrix Multiplication. Alexey Pospelov |
| 2011 | Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno |
| 2011 | Hide-and-Seek: Algorithms for Polygon Walk Problems. Atlas F. Cook, Chenglin Fan, Jun Luo |
| 2011 | How to Cut a Graph into Many Pieces. Ruben van der Zwaan, André Berger, Alexander Grigoriev |
| 2011 | Improved Approximation Bounds for the Student-Project Allocation Problem with Preferences over Projects. Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa |
| 2011 | Integer Representations towards Efficient Counting in the Bit Probe Model. Gerth Stølting Brodal, Mark Greve, Vineet Pandey, Srinivasa Rao Satti |
| 2011 | Intuitive Probability Logic. Chunlai Zhou |
| 2011 | Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory - (Extended Abstract). Alexander Langer, Peter Rossmanith, Somnath Sikdar |
| 2011 | Locally Injective Homomorphism to the Simple Weight Graphs. Ondrej Bílka, Bernard Lidický, Marek Tesar |
| 2011 | Low Distortion Metric Embedding into Constant Dimension. András Faragó |
| 2011 | Lower Bounds for Testing Computability by Small Width OBDDs. Joshua Brody, Kevin Matulef, Chenggang Wu |
| 2011 | Lower Bounds for the Smoothed Number of Pareto Optimal Solutions. Tobias Brunsch, Heiko Röglin |
| 2011 | Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width. Benjamin Hellouin de Menibus, Takeaki Uno |
| 2011 | Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines. Paul C. Bell, Prudence W. H. Wong |
| 2011 | NEXP Does Not Have Non-uniform Quasipolynomial-Size ACC Circuits of Fengming Wang |
| 2011 | Near Approximation of Maximum Weight Matching through Efficient Weight Reduction. Andrzej Lingas, Cui Di |
| 2011 | Non-adaptive Complex Group Testing with Multiple Positive Sets. Francis Y. L. Chin, Henry C. M. Leung, Siu-Ming Yiu |
| 2011 | On the Amount of Nonconstructivity in Learning Recursive Functions. Rusins Freivalds, Thomas Zeugmann |
| 2011 | On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric. Ernst Althaus, Joschka Kupilas, Rouven Naujoks |
| 2011 | On the Polynomial Depth of Various Sets of Random Strings. Philippe Moser |
| 2011 | Optimal Allocation in Combinatorial Auctions with Quadratic Utility Functions. Akiyoshi Shioura, Shunya Suzuki |
| 2011 | P Emmanuel Jeandel, Pascal Vanier |
| 2011 | Planarity Testing Revisited. Samir Datta, Gautam Prakriya |
| 2011 | Quantum Complexity: Some Recent Results, Some Open Problems, Some Thoughts. Richard J. Lipton |
| 2011 | Some Tractable Win-Lose Games. Samir Datta, Nagarajan Krishnamurthy |
| 2011 | Submodular Function Minimization under a Submodular Set Covering Constraint. Naoyuki Kamiyama |
| 2011 | Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet. Pooya Davoodi, S. Srinivasa Rao |
| 2011 | Switching to Hedgehog-Free Graphs Is NP-Complete. Eva Jelínková |
| 2011 | The Complexity and Approximability of Minimum Contamination Problems. Angsheng Li, Linqing Tang |
| 2011 | The Hardness of Median in the Synchronized Bit Communication Model. Karolina Soltys |
| 2011 | Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Tokyo, Japan, May 23-25, 2011. Proceedings Mitsunori Ogihara, Jun Tarui |
| 2011 | Tight Bounds on Communication Complexity of Symmetric XOR Functions in One-Way and SMP Models. Ming Lam Leung, Yang Li, Shengyu Zhang |
| 2011 | Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way - (Extended Abstract). Serafino Cicerone |