| 2011 | Fast Exact Algorithm for | Konstanty Junosza-Szaniawski, Jan Kratochvl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski |
| 2011 | Switching to Hedgehog-Free Graphs Is NP-Complete. | Eva Jelnkov |
| 2011 | P | Emmanuel Jeandel, Pascal Vanier |
| 2011 | Closed Left-R.E. Sets. | Sanjay Jain, Frank Stephan, Jason Teutsch |
| 2011 | A Compact Encoding of Unordered Binary Trees. | Kozue Iwata, Shiro Ishiwata, Shin-Ichi Nakano |
| 2011 | Improved Approximation Bounds for the Student-Project Allocation Problem with Preferences over Projects. | Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa |
| 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 | Catching a Fast Robber on Interval Graphs. | Tomas Gavenciak |
| 2011 | Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands. | Takuro Fukunaga |
| 2011 | An Algebraic Characterization of Strictly Piecewise Languages. | Jie Fu, Jeffrey Heinz, Herbert G. Tanner |
| 2011 | On the Amount of Nonconstructivity in Learning Recursive Functions. | Rusins Freivalds, Thomas Zeugmann |
| 2011 | Low Distortion Metric Embedding into Constant Dimension. | Andrs Farag |
| 2011 | A Note on Obfuscation for Cryptographic Functionalities of Secret-Operation Then Public-Encryption. | Ning Ding, Dawu Gu |
| 2011 | Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet. | Pooya Davoodi, S. Srinivasa Rao |
| 2011 | Planarity Testing Revisited. | Samir Datta, Gautam Prakriya |
| 2011 | Some Tractable Win-Lose Games. | Samir Datta, Nagarajan Krishnamurthy |
| 2011 | Hide-and-Seek: Algorithms for Polygon Walk Problems. | Atlas F. Cook, Chenglin Fan, Jun Luo |
| 2011 | Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way - (Extended Abstract). | Serafino Cicerone |
| 2011 | Non-adaptive Complex Group Testing with Multiple Positive Sets. | Francis Y. L. Chin, Henry C. M. Leung, Siu-Ming Yiu |
| 2011 | A Better Upper Bound on Weights of Exact Threshold Functions. | Xue Chen, Guangda Hu, Xiaoming Sun |
| 2011 | Lower Bounds for the Smoothed Number of Pareto Optimal Solutions. | Tobias Brunsch, Heiko Rglin |
| 2011 | A Bad Instance for k-Means++. | Tobias Brunsch, Heiko Rglin |
| 2011 | Lower Bounds for Testing Computability by Small Width OBDDs. | Joshua Brody, Kevin Matulef, Chenggang Wu |
| 2011 | Integer Representations towards Efficient Counting in the Bit Probe Model. | Gerth Stlting Brodal, Mark Greve, Vineet Pandey, Srinivasa Rao Satti |