Walter Unger

Publication Activity (10 Years)

Years Active: 1988-2023
Publications (10 Years): 13

Top Venues

CoRR

Adventures Between Lower Bounds and Higher Altitudes

IPCCC

SSS

University of Paderborn, Germany (PHD)

Education History

University of Paderborn, Germany

PHD

Publications

Hans-Joachim Böckenhauer, Fabian Frei, Walter Unger, David Wehner
Zero-Memory Graph Exploration with Unknown Inports. CoRR (2023)
Hans-Joachim Böckenhauer, Fabian Frei, Walter Unger, David Wehner
Zero-Memory Graph Exploration with Unknown Inports. SIROCCO (2023)
Hans-Joachim Böckenhauer, Janosch Fuchs, Walter Unger
Exploring sparse graphs with advice. Inf. Comput. 289 (Part) (2022)
Christian Tipantuña, Xavier Hesselbach, Walter Unger
Heuristic Strategies for NFV-Enabled Renewable and Non-Renewable Energy Management in the Future IoT World. IEEE Access 9 (2021)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Walter Unger
On the advice complexity of the online dominating set problem. Theor. Comput. Sci. 862 (2021)
Elisabet Burjons, Juraj Hromkovic, Rastislav Královic, Richard Královic, Xavier Muñoz, Walter Unger
Online Graph Coloring Against a Randomized Adversary. Int. J. Found. Comput. Sci. 29 (4) (2018)
Hans-Joachim Böckenhauer, Janosch Fuchs, Walter Unger
Exploring Sparse Graphs with Advice (Extended Abstract). WAOA (2018)
Lali Barrière, Xavier Muñoz, Janosch Fuchs, Walter Unger
Online Matching in Regular Bipartite Graphs. Parallel Process. Lett. 28 (2) (2018)
Hans-Joachim Böckenhauer, Lucia Di Caro, Walter Unger
Fully Online Matching with Advice on General Bipartite Graphs and Paths. Adventures Between Lower Bounds and Higher Altitudes (2018)
Hans-Joachim Böckenhauer, Janosch Fuchs, Walter Unger
The Graph Exploration Problem with Advice. CoRR (2018)
George B. Mertzios, Walter Unger
The Friendship Problem on Graphs. J. Multiple Valued Log. Soft Comput. 27 (2-3) (2016)
Hans-Joachim Böckenhauer, Janosch Fuchs, Ulla Karhumäki, Walter Unger
Online Exploration of Rectangular Grids. CoRR (2016)
Elisabet Burjons, Juraj Hromkovic, Xavier Muñoz, Walter Unger
Online Graph Coloring with Advice and Randomized Adversary - (Extended Abstract). SOFSEM (2016)
Benjamin Ries, Bernhard Schamberg, Walter Unger
The k-Observer Problem on d-regular Graphs. SSS (2015)
Sascha Geulen, Martina Josevski, Johanna Nellen, Janosch Fuchs, Lukas Netz, Benedikt Wolters, Dirk Abel, Erika Ábrahám, Walter Unger
Learning-based control strategies for hybrid electric vehicles. CCA (2015)
Benjamin Ries, Walter Unger, Maximilian Odendahl, Rainer Leupers
A heuristic for logical data buffer allocation in multicore platforms. IPCCC (2014)
Sebastian Seibert, Andreas Sprock, Walter Unger
Advice Complexity of the Online Coloring Problem. CIAC (2013)
Chandan K. Dubey, Uriel Feige, Walter Unger
Hardness results for approximating the bandwidth. J. Comput. Syst. Sci. 77 (1) (2011)
George B. Mertzios, Walter Unger
-Fixed-Endpoint Path Cover on Proper Interval Graphs. Math. Comput. Sci. 3 (1) (2010)
George B. Mertzios, Walter Unger
Preemptive Scheduling of Equal-Length Jobs in Polynomial Time. Math. Comput. Sci. 3 (1) (2010)
Xavier Muñoz, Sebastian Seibert, Walter Unger
The Minimal Manhattan Network Problem in Three Dimensions. WALCOM (2009)
Juraj Hromkovic, Przemyslawa Kanarek, Ralf Klasing, Krzysztof Lorys, Walter Unger, Hubert Wagener
On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks. SIAM J. Discret. Math. 23 (3) (2009)
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
On k-connectivity problems with sharpened triangle inequality. J. Discrete Algorithms 6 (4) (2008)
George B. Mertzios, Walter Unger
An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs. IWOCA (2008)
Mordechai Shalom, Walter Unger, Shmuel Zaks
On the Complexity of the Traffic Grooming Problem in Optical Networks. FUN (2007)
Pilu Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger
On-line load balancing made simple: Greedy strikes back. J. Discrete Algorithms 5 (1) (2007)
Axel Sikora, Frank-Peter Pesl, Walter Unger, Uwe Paschen
Technologies and reliability of modern embedded flash cells. Microelectron. Reliab. 46 (12) (2006)
Sebastian Seibert, Walter Unger
A 1.5-Approximation of the Minimal Manhattan Network Problem. ISAAC (2005)
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. Theor. Comput. Sci. 326 (1-3) (2004)
Pierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger
Online Load Balancing Made Simple: Greedy Strikes Back. ICALP (2003)
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. CIAC (2003)
Daniel Keysers, Walter Unger
Elastic image matching is NP-complete. Pattern Recognit. Lett. 24 (1-3) (2003)
Micah Adler, Arnold L. Rosenberg, Ramesh K. Sitaraman, Walter Unger
Scheduling Time-Constrained Communication in Linear Networks. Theory Comput. Syst. 35 (6) (2002)
Sebastian Seibert, Walter Unger
The hardness of placing street names in a Manhattan type map. Theor. Comput. Sci. 285 (1) (2002)
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality. FSTTCS (2002)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. Theor. Comput. Sci. 285 (1) (2002)
Rusins Freivalds, Juraj Hromkovic, Gheorghe Paun, Walter Unger
Foreword. Theor. Comput. Sci. 264 (1) (2001)
Xavier Muñoz, Walter Unger, Imrich Vrto
One Sided Crossing Minimization Is NP-Hard for Sparse Graphs. Graph Drawing (2001)
Sebastian Seibert, Walter Unger
The Hardness of Placing Street Names in a Manhattan Type Map. CIAC (2000)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality. STACS (2000)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem. CIAC (2000)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
Approximation algorithms for the TSP with sharpened triangle inequality. Inf. Process. Lett. 75 (3) (2000)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem Electron. Colloquium Comput. Complex. 6 (31) (1999)
Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger
Optimal Embedding of Complete Binary Trees into Lines and Grids. J. Parallel Distributed Comput. 49 (1) (1998)
Micah Adler, Ramesh K. Sitaraman, Arnold L. Rosenberg, Walter Unger
Scheduling Time-Constrained Communication in Linear Networks. SPAA (1998)
Sergei L. Bezrukov, Burkhard Monien, Walter Unger, Gerd Wechsung
Embedding ladders and caterpillars into the hypercube. Discret. Appl. Math. 83 (1-3) (1998)
Walter Unger
The Complexity of the Approximation of the Bandwidth Problem. FOCS (1998)
Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener
Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes. Inf. Comput. 133 (1) (1997)
Alessandro Roncato, Walter Unger
Systolic Gossip in Complete Trees. SIROCCO (1996)
Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Walter Unger, Juraj Waczulík, Hubert Wagener
Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract). FCT (1995)
Juraj Hromkovic, Krzysztof Lorys, Przemyslawa Kanarek, Ralf Klasing, Walter Unger, Hubert Wagener
On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks. STACS (1995)
Yoshihide Igarashi, Shingo Osawa, Walter Unger
Automorphisms of Broadcasting Schemes with Respect to Start Rounds. Inf. Process. Lett. 51 (1) (1994)
Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská
The Complexity of Systolic Dissemination of Information in Interconnection Networks. Canada-France Conference on Parallel and Distributed Computing (1994)
Markus Röttger, Ulf-Peter Schroeder, Walter Unger
Embedding 3-dimensional Grids into Optimal Hypercubes. Canada-France Conference on Parallel and Distributed Computing (1994)
Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener
Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract). SWAT (1994)
Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská
The Complexity of Systolic Dissemination of Information in Interconnection Networks. RAIRO Theor. Informatics Appl. 28 (3-4) (1994)
Rainer Feldmann, Walter Unger
The Cube-Connected Cycles Network Is a Subgraph of the Butterfly Network. Parallel Process. Lett. 2 (1992)
Walter Unger
The Complexity of Colouring Circle Graphs (Extended Abstract). STACS (1992)
Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger
Optimal Embedding of Complete Binary Trees into Lines and Grids. WG (1991)
Walter Unger
On the k-Colouring of Circle-Graphs. STACS (1988)

Walter Unger.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Walter Unger