| 2023 | SIROCCO | Zero-Memory Graph Exploration with Unknown Inports. | Hans-Joachim Bckenhauer, Fabian Frei, Walter Unger, David Wehner |
| 2018 | WAOA | Exploring Sparse Graphs with Advice (Extended Abstract). | Hans-Joachim Bckenhauer, Janosch Fuchs, Walter Unger |
| 2016 | SOFSEM | Online Graph Coloring with Advice and Randomized Adversary - (Extended Abstract). | Elisabet Burjons, Juraj Hromkovic, Xavier Muoz, Walter Unger |
| 2015 | SSS | The k-Observer Problem on d-regular Graphs. | Benjamin Ries, Bernhard Schamberg, Walter Unger |
| 2014 | IPCCC | A heuristic for logical data buffer allocation in multicore platforms. | Benjamin Ries, Walter Unger, Maximilian Odendahl, Rainer Leupers |
| 2013 | CIAC | Advice Complexity of the Online Coloring Problem. | Sebastian Seibert, Andreas Sprock, Walter Unger |
| 2009 | WALCOM | The Minimal Manhattan Network Problem in Three Dimensions. | Xavier Muoz, Sebastian Seibert, Walter Unger |
| 2008 | IWOCA | An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs. | George B. Mertzios, Walter Unger |
| 2007 | FUN | On the Complexity of the Traffic Grooming Problem in Optical Networks. | Mordechai Shalom, Walter Unger, Shmuel Zaks |
| 2005 | ISAAC | A 1.5-Approximation of the Minimal Manhattan Network Problem. | Sebastian Seibert, Walter Unger |
| 2003 | CIAC | On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. | Hans-Joachim Bckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger |
| 2003 | ICALP | Online Load Balancing Made Simple: Greedy Strikes Back. | Pierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger |
| 2001 | GD | One Sided Crossing Minimization Is NP-Hard for Sparse Graphs. | Xavier Muoz, Walter Unger, Imrich Vrto |
| 2000 | CIAC | Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem. | Hans-Joachim Bckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger |
| 2000 | CIAC | The Hardness of Placing Street Names in a Manhattan Type Map. | Sebastian Seibert, Walter Unger |
| 2000 | STACS | An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality. | Hans-Joachim Bckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger |
| 1998 | FOCS | The Complexity of the Approximation of the Bandwidth Problem. | Walter Unger |
| 1998 | SPAA | Scheduling Time-Constrained Communication in Linear Networks. | Micah Adler, Ramesh K. Sitaraman, Arnold L. Rosenberg, Walter Unger |
| 1996 | SIROCCO | Systolic Gossip in Complete Trees. | Alessandro Roncato, Walter Unger |
| 1995 | FCT | Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract). | Juraj Hromkovic, Ralf Klasing, Dana Pardubsk, Walter Unger, Juraj Waczulk, Hubert Wagener |
| 1995 | STACS | On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks. | Juraj Hromkovic, Krzysztof Lorys, Przemyslawa Kanarek, Ralf Klasing, Walter Unger, Hubert Wagener |
| 1992 | STACS | The Complexity of Colouring Circle Graphs (Extended Abstract). | Walter Unger |
| 1991 | WG | Optimal Embedding of Complete Binary Trees into Lines and Grids. | Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger |
| 1988 | STACS | On the k-Colouring of Circle-Graphs. | Walter Unger |