| 2006 | On Locating Disjoint Segments with Maximum Sum of Densities. | Hsiao-Fei Liu, Kun-Mao Chao |
| 2006 | Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems. | Mingen Lin, Yang Yang, Jinhui Xu |
| 2006 | Improved Algorithms for the Minmax-Regret 1-Center Problem. | Tzu-Chin Lin, Hung-I Yu, Biing-Feng Wang |
| 2006 | Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem. | Tien-Ching Lin, D. T. Lee |
| 2006 | Deterministic Splitter Finding in a Stream with Constant Storage and Guarantees. | Tobias Lenz |
| 2006 | Poketree: A Dynamically Competitive Data Structure with Good Worst-Case Performance. | Jussi Kujala, Tapio Elomaa |
| 2006 | Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete. | Michael Krger, Harald Hempel |
| 2006 | Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures. | Lukasz Kowalik |
| 2006 | Constructing Labeling Schemes Through Universal Matrices. | Amos Korman, David Peleg, Yoav Rodeh |
| 2006 | Intuitive Algorithms and t-Vertex Cover. | Joachim Kneis, Daniel Mlle, Stefan Richter, Peter Rossmanith |
| 2006 | Gathering Asynchronous Oblivious Mobile Robots in a Ring. | Ralf Klasing, Euripides Markou, Andrzej Pelc |
| 2006 | Offline Sorting Buffers on Line. | Rohit Khandekar, Vinayaka Pandit |
| 2006 | Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems. | Telikepalli Kavitha, Chintan D. Shah |
| 2006 | Flexible Word Design and Graph Labeling. | Ming-Yang Kao, Manan Sanghi, Robert T. Schweller |
| 2006 | Convex Grid Drawings of Plane Graphs with Rectangular Contours. | Akira Kamada, Kazuyuki Miura, Takao Nishizeki |
| 2006 | Negation-Limited Complexity of Parity and Inverters. | Kazuo Iwama, Hiroki Morizumi, Jun Tarui |
| 2006 | Stable Matching Problems. | Kazuo Iwama |
| 2006 | Approximability of Partitioning Graphs with Supply and Demand. | Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki |
| 2006 | Provably Secure Steganography and the Complexity of Sampling. | Christian Hundt, Maciej Liskiewicz, Ulrich Wlfel |
| 2006 | Resources Required for Preparing Graph States. | Peter Hyer, Mehdi Mhalla, Simon Perdrix |
| 2006 | Finite-State Online Algorithms and Their Automated Competitive Analysis. | Takashi Horiyama, Kazuo Iwama, Jun Kawahara |
| 2006 | Non-cooperative Facility Location and Covering Games. | Martin Hoefer |
| 2006 | Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions. | Pinar Heggernes, Federico Mancini, Charis Papadopoulos |
| 2006 | On 2-Query Codeword Testing with Near-Perfect Completeness. | Venkatesan Guruswami |
| 2006 | Parameterized Problems on Coincidence Graphs. | Sylvain Guillemot |