| 2006 | Heterogenous Networks Can Be Unstable at Arbitrarily Low Injection Rates. | Dimitrios Koukopoulos, Stavros D. Nikolopoulos |
| 2006 | Quadratic Programming and Combinatorial Minimum Weight Product Problems. | Walter Kern, Gerhard J. Woeginger |
| 2006 | An Approximation Algorithm for a Bottleneck Traveling Salesman Problem. | Ming-Yang Kao, Manan Sanghi |
| 2006 | Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems. | Erez Kantor, David Peleg |
| 2006 | The Linear Arrangement Problem Parameterized Above Guaranteed Value. | Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo |
| 2006 | On Broadcast Scheduling with Limited Energy. | Christian Gunia |
| 2006 | Covering a Set of Points with a Minimum Number of Lines. | Magdalene Grantson, Christos Levcopoulos |
| 2006 | On the Hardness of Range Assignment Problems. | Bernhard Fuchs |
| 2006 | Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes. | Katalin Friedl, Gbor Ivanyos, Miklos Santha, Yves F. Verhoeven |
| 2006 | Universal Relations and #P-Completeness. | Herv Fournier, Guillaume Malod |
| 2006 | Parameterized Algorithms for Hitting Set: The Weighted Case. | Henning Fernau |
| 2006 | Approximation Algorithms for Capacitated Rectangle Stabbing. | Guy Even, Dror Rawitz, Shimon Shahar |
| 2006 | Network Discovery and Verification with Distance Queries. | Thomas Erlebach, Alexander Hall, Michael Hoffmann, Mats Mihalk |
| 2006 | Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups. | Friedrich Eisenbrand, Edda Happ |
| 2006 | Distance Approximating Trees: Complexity and Algorithms. | Feodor F. Dragan, Chenyu Yan |
| 2006 | Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments. | Michael Dom, Jiong Guo, Falk Hffner, Rolf Niedermeier, Anke Tru |
| 2006 | Black Hole Search in Asynchronous Rings Using Tokens. | Stefan Dobrev, Rastislav Kralovic, Nicola Santoro, Wei Shi |
| 2006 | Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms. | Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert |
| 2006 | Fixed-Parameter Tractable Generalizations of Cluster Editing. | Peter Damaschke |
| 2006 | Distributed Approximation Algorithms for Planar Graphs. | Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska |
| 2006 | Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations. | Miroslav Chlebk, Janka Chlebkov |
| 2006 | On the Minimum Common Integer Partition Problem. | Xin Chen, Lan Liu, Zheng Liu, Tao Jiang |
| 2006 | On-Line Coloring of H-Free Bipartite Graphs. | Hajo Broersma, Agostino Capponi, Danil Paulusma |
| 2006 | In-Place Randomized Slope Selection. | Henrik Blunck, Jan Vahrenhold |
| 2006 | Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines. | Yvonne Bleischwitz, Burkhard Monien |