| 2010 | Irredundant Set Faster Than | Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk |
| 2010 | A Planar Linear Arboricity Conjecture. | Marek Cygan, Lukasz Kowalik, Borut Luzar |
| 2010 | Communication Requirements for Stable Marriages. | Jen-Hou Chou, Chi-Jen Lu |
| 2010 | Graph Unique-Maximum and Conflict-Free Colorings. | Panagiotis Cheilaris, Gza Tth |
| 2010 | Bounding the Number of Tolerable Faults in Majority-Based Systems. | Ching-Lueh Chang, Yuh-Dauh Lyuu |
| 2010 | Packing Bipartite Graphs with Covers of Complete Bipartite Graphs. | Jrmie Chalopin, Danil Paulusma |
| 2010 | How Simple Robots Benefit from Looking Back. | Jrmie Chalopin, Shantanu Das, Yann Disser, Mats Mihalk, Peter Widmayer |
| 2010 | Parameterized Complexity of Even/Odd Subgraph Problems. | Leizhen Cai, Boting Yang |
| 2010 | Online Cooperative Cost Sharing. | Janina A. Brenner, Guido Schfer |
| 2010 | Improved Approximations for TSP with Simple Precedence Constraints. | Hans-Joachim Bckenhauer, Ralf Klasing, Tobias Mmke, Monika Steinov |
| 2010 | The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality. | Hans-Joachim Bckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mmke, Andreas Sprock, Bjrn Steffen |
| 2010 | Popular Matchings in the Marriage and Roommates Problems. | Pter Bir, Robert W. Irving, David F. Manlove |
| 2010 | A Parameterized Route to Exact Puzzles: Breaking the 2 | Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith |
| 2010 | The Complexity of Computing Minimal Unidirectional Covering Sets. | Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann, Jrg Rothe |
| 2010 | Preprocessing Speed-Up Techniques Is Hard. | Reinhard Bauer, Tobias Columbus, Bastian Katz, Marcus Krug, Dorothea Wagner |
| 2010 | Towards a Distributed Search Engine. | Ricardo Baeza-Yates |
| 2010 | An Exact Algorithm for Connected Red-Blue Dominating Set. | Faisal N. Abu-Khzam, Amer E. Mouawad, Mathieu Liedloff |
| 2006 | Deciding the FIFO Stability of Networks in Polynomial Time. | Maik Weinard |
| 2006 | A Near Optimal Scheduler for On-Demand Data Broadcasts. | Hing-Fung Ting |
| 2006 | On Search Problems in Complexity Theory and in Logic (Abstract). | Pavel Pudlk |
| 2006 | Beware of the Model: Reflections on Algorithmic Research. | Franco P. Preparata |
| 2006 | Counting All Solutions of Minimum Weight Exact Satisfiability. | Stefan Porschen |
| 2006 | Reliable and Efficient Geometric Computing. | Kurt Mehlhorn |
| 2006 | A New NC-Algorithm for Finding a Perfect Matching in | Raghav Kulkarni |
| 2006 | Tighter Approximation Bounds for LPT Scheduling in Two Special Cases. | Annamria Kovcs |