Walter Unger

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