On the k-Colouring of Circle-Graphs. - Walter Unger (STACS, 1988)

Färbung von Kreissehnengraphen. - Walter Unger (1990)

The Complexity of Colouring Circle Graphs (Extended Abstract). - Walter Unger (STACS, 1992)

The Cube-Connected Cycles Network Is a Subgraph of the Butterfly Network. - Rainer Feldmann; Walter Unger (Parallel Process. Lett., 1992)

Embedding 3-dimensional Grids into Optimal Hypercubes. - Markus Röttger; Ulf-Peter Schroeder; Walter Unger (Canada-France Conference on Parallel and Distributed Computing, 1994)

Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract). - Juraj Hromkovic; Ralf Klasing; Walter Unger; Hubert Wagener (SWAT, 1994)

Automorphisms of Broadcasting Schemes with Respect to Start Rounds. - Yoshihide Igarashi; Shingo Osawa; Walter Unger (Inf. Process. Lett., 1994)

The Complexity of Systolic Dissemination of Information in Interconnection Networks. - Juraj Hromkovic; Ralf Klasing; Walter Unger; Hubert Wagener; Dana Pardubská (RAIRO Theor. Informatics Appl., 1994)

Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract). - Juraj Hromkovic; Ralf Klasing; Dana Pardubská; Walter Unger; Juraj Waczulík; Hubert Wagener (FCT, 1995)

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 (STACS, 1995)

Systolic Gossip in Complete Trees. - Alessandro Roncato; Walter Unger (SIROCCO, 1996)

Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes. - Juraj Hromkovic; Ralf Klasing; Walter Unger; Hubert Wagener (Inf. Comput., 1997)

The Complexity of the Approximation of the Bandwidth Problem. - Walter Unger (FOCS, 1998)

Embedding ladders and caterpillars into the hypercube. - Sergei L. Bezrukov; Burkhard Monien; Walter Unger; Gerd Wechsung (Discret. Appl. Math., 1998)

Optimal Embedding of Complete Binary Trees into Lines and Grids. - Ralf Heckmann; Ralf Klasing; Burkhard Monien; Walter Unger (J. Parallel Distributed Comput., 1998)

An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Ralf Klasing; Sebastian Seibert; Walter Unger (STACS, 2000)

Approximation algorithms for the TSP with sharpened triangle inequality. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Ralf Klasing; Sebastian Seibert; Walter Unger (Inf. Process. Lett., 2000)

One Sided Crossing Minimization Is NP-Hard for Sparse Graphs. - Xavier Muñoz; Walter Unger; Imrich Vrto (GD, 2001)

Foreword. - Rusins Freivalds; Juraj Hromkovic; Gheorghe Paun; Walter Unger (Theor. Comput. Sci., 2001)

Scheduling Time-Constrained Communication in Linear Networks. - Micah Adler; Arnold L. Rosenberg; Ramesh K. Sitaraman; Walter Unger (Theory Comput. Syst., 2002)

Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Ralf Klasing; Sebastian Seibert; Walter Unger (Theor. Comput. Sci., 2002)

The hardness of placing street names in a Manhattan type map. - Sebastian Seibert; Walter Unger (Theor. Comput. Sci., 2002)

On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. - Hans-Joachim Böckenhauer; Dirk Bongartz; Juraj Hromkovic; Ralf Klasing; Guido Proietti; Sebastian Seibert; Walter Unger (CIAC, 2003)

Online Load Balancing Made Simple: Greedy Strikes Back. - Pierluigi Crescenzi; Giorgio Gambosi; Gaia Nicosia; Paolo Penna; Walter Unger (ICALP, 2003)

Elastic image matching is NP-complete. - Daniel Keysers; Walter Unger (Pattern Recognit. Lett., 2003)

On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. - Hans-Joachim Böckenhauer; Dirk Bongartz; Juraj Hromkovic; Ralf Klasing; Guido Proietti; Sebastian Seibert; Walter Unger (Theor. Comput. Sci., 2004)

Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance - Juraj Hromkovic; Ralf Klasing; Andrzej Pelc; Peter Ruzicka; Walter Unger (Springer, 2005)

A 1.5-Approximation of the Minimal Manhattan Network Problem. - Sebastian Seibert; Walter Unger (ISAAC, 2005)

Technologies and reliability of modern embedded flash cells. - Axel Sikora; Frank-Peter Pesl; Walter Unger; Uwe Paschen (Microelectron. Reliab., 2006)

On the Complexity of the Traffic Grooming Problem in Optical Networks. - Mordechai Shalom; Walter Unger; Shmuel Zaks (FUN, 2007)

On-line load balancing made simple: Greedy strikes back. - Pilu Crescenzi; Giorgio Gambosi; Gaia Nicosia; Paolo Penna; Walter Unger (J. Discrete Algorithms, 2007)

An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs. - George B. Mertzios; Walter Unger (IWOCA, 2008)

On k-connectivity problems with sharpened triangle inequality. - Hans-Joachim Böckenhauer; Dirk Bongartz; Juraj Hromkovic; Ralf Klasing; Guido Proietti; Sebastian Seibert; Walter Unger (J. Discrete Algorithms, 2008)

Public-Key-Kryptographie. - Dirk Bongartz; Walter Unger (Taschenbuch der Algorithmen, 2008)

The Minimal Manhattan Network Problem in Three Dimensions. - Xavier Muñoz; Sebastian Seibert; Walter Unger (WALCOM, 2009)

On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks. - Juraj Hromkovic; Przemyslawa Kanarek; Ralf Klasing; Krzysztof Lorys; Walter Unger; Hubert Wagener (SIAM J. Discret. Math., 2009)

Topology Control and Routing in Ad Hoc Networks. - Lenka Carr-Motycková; Alfredo Navarra; Tomas Johansson; Walter Unger (Graphs and Algorithms in Communication Networks, 2010)

Preemptive Scheduling of Equal-Length Jobs in Polynomial Time. - George B. Mertzios; Walter Unger (Math. Comput. Sci., 2010)

An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs. - George B. Mertzios; Walter Unger (Math. Comput. Sci., 2010)

Public-Key Cryptography. - Dirk Bongartz; Walter Unger (Algorithms Unplugged, 2011)

Hardness results for approximating the bandwidth. - Chandan K. Dubey; Uriel Feige; Walter Unger (J. Comput. Syst. Sci., 2011)

Advice Complexity of the Online Coloring Problem. - Sebastian Seibert; Andreas Sprock; Walter Unger (CIAC, 2013)

A heuristic for logical data buffer allocation in multicore platforms. - Benjamin Ries; Walter Unger; Maximilian Odendahl; Rainer Leupers (IPCCC, 2014)

Learning-based control strategies for hybrid electric vehicles. - Sascha Geulen; Martina Josevski; Johanna Nellen; Janosch Fuchs; Lukas Netz; Benedikt Wolters; Dirk Abel; Erika Ábrahám; Walter Unger (CCA, 2015)

The k-Observer Problem on d-regular Graphs. - Benjamin Ries; Bernhard Schamberg; Walter Unger (SSS, 2015)

Online Graph Coloring with Advice and Randomized Adversary - (Extended Abstract). - Elisabet Burjons; Juraj Hromkovic; Xavier Muñoz; Walter Unger (SOFSEM, 2016)

Online Exploration of Rectangular Grids. - Hans-Joachim Böckenhauer; Janosch Fuchs; Ulla Karhumäki; Walter Unger (CoRR, 2016)

The Friendship Problem on Graphs. - George B. Mertzios; Walter Unger (J. Multiple Valued Log. Soft Comput., 2016)

Fully Online Matching with Advice on General Bipartite Graphs and Paths. - Hans-Joachim Böckenhauer; Lucia Di Caro; Walter Unger (Adventures Between Lower Bounds and Higher Altitudes, 2018)

Exploring Sparse Graphs with Advice (Extended Abstract). - Hans-Joachim Böckenhauer; Janosch Fuchs; Walter Unger (WAOA, 2018)

The Graph Exploration Problem with Advice. - Hans-Joachim Böckenhauer; Janosch Fuchs; Walter Unger (CoRR, 2018)

Online Graph Coloring Against a Randomized Adversary. - Elisabet Burjons; Juraj Hromkovic; Rastislav Královic; Richard Královic; Xavier Muñoz; Walter Unger (Int. J. Found. Comput. Sci., 2018)

Online Matching in Regular Bipartite Graphs. - Lali Barrière; Xavier Muñoz; Janosch Fuchs; Walter Unger (Parallel Process. Lett., 2018)

Heuristic Strategies for NFV-Enabled Renewable and Non-Renewable Energy Management in the Future IoT World. - Christian Tipantuña; Xavier Hesselbach; Walter Unger (IEEE Access, 2021)

On the advice complexity of the online dominating set problem. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Sacha Krug; Walter Unger (Theor. Comput. Sci., 2021)

Exploring sparse graphs with advice. - Hans-Joachim Böckenhauer; Janosch Fuchs; Walter Unger (Inf. Comput., 2022)

Zero-Memory Graph Exploration with Unknown Inports. - Hans-Joachim Böckenhauer; Fabian Frei; Walter Unger; David Wehner (SIROCCO, 2023)