| 2012 | An Application of 1-Genericity in the $\Pi^0_2$ Enumeration Degrees. | Liliana Badillo, Charles M. Harris |
| 2012 | Bisection (Band)Width of Product Networks with Application to Data Centers. | Jordi Arjona Aroca, Antonio Fernndez Anta |
| 2011 | How to Cut a Graph into Many Pieces. | Ruben van der Zwaan, Andr Berger, Alexander Grigoriev |
| 2011 | Intuitive Probability Logic. | Chunlai Zhou |
| 2011 | A Real Elementary Approach to the Master Recurrence and Generalizations. | Chee Yap |
| 2011 | NEXP Does Not Have Non-uniform Quasipolynomial-Size ACC Circuits of | Fengming Wang |
| 2011 | Energy and Fan-In of Threshold Circuits Computing Mod Functions. | Akira Suzuki, Kei Uchizawa, Xiao Zhou |
| 2011 | The Hardness of Median in the Synchronized Bit Communication Model. | Karolina Soltys |
| 2011 | Optimal Allocation in Combinatorial Auctions with Quadratic Utility Functions. | Akiyoshi Shioura, Shunya Suzuki |
| 2011 | Approximating Edge Dominating Set in Dense Graphs. | Richard Schmied, Claus Viehmann |
| 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 | On the Polynomial Depth of Various Sets of Random Strings. | Philippe Moser |
| 2011 | Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width. | Benjamin Hellouin de Menibus, Takeaki Uno |
| 2011 | Generalized Satisfiability for the Description Logic | Arne Meier, Thomas Schneider |
| 2011 | Deterministic Algorithms for Multi-criteria TSP. | Bodo Manthey |
| 2011 | An Improved Kernel for Planar Connected Dominating Set. | Weizhong Luo, Jianxin Wang, Qilong Feng, Jiong Guo, Jianer Chen |
| 2011 | The Complexity and Approximability of Minimum Contamination Problems. | Angsheng Li, Linqing Tang |
| 2011 | Grey-Box Steganography. | Maciej Liskiewicz, Rdiger Reischuk, Ulrich Wlfel |
| 2011 | Quantum Complexity: Some Recent Results, Some Open Problems, Some Thoughts. | Richard J. Lipton |
| 2011 | Near Approximation of Maximum Weight Matching through Efficient Weight Reduction. | Andrzej Lingas, Cui Di |
| 2011 | Tight Bounds on Communication Complexity of Symmetric XOR Functions in One-Way and SMP Models. | Ming Lam Leung, Yang Li, Shengyu Zhang |
| 2011 | Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory - (Extended Abstract). | Alexander Langer, Peter Rossmanith, Somnath Sikdar |
| 2011 | Extending Partial Representations of Interval Graphs. | Pavel Klavk, Jan Kratochvl, Toms Vyskocil |
| 2011 | Submodular Function Minimization under a Submodular Set Covering Constraint. | Naoyuki Kamiyama |