2009 |
40 | EE | Xavier Muñoz,
Sebastian Seibert,
Walter Unger:
The Minimal Manhattan Network Problem in Three Dimensions.
WALCOM 2009: 369-380 |
2008 |
39 | EE | Dirk Bongartz,
Walter Unger:
Public-Key-Kryptographie.
Taschenbuch der Algorithmen 2008: 157-169 |
38 | EE | 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): 605-617 (2008) |
2007 |
37 | EE | Mordechai Shalom,
Walter Unger,
Shmuel Zaks:
On the Complexity of the Traffic Grooming Problem in Optical Networks.
FUN 2007: 262-271 |
36 | EE | Pilu Crescenzi,
Giorgio Gambosi,
Gaia Nicosia,
Paolo Penna,
Walter Unger:
On-line load balancing made simple: Greedy strikes back.
J. Discrete Algorithms 5(1): 162-175 (2007) |
2006 |
35 | EE | Axel Sikora,
Frank-Peter Pesl,
Walter Unger,
Uwe Paschen:
Technologies and reliability of modern embedded flash cells.
Microelectronics Reliability 46(12): 1980-2005 (2006) |
2005 |
34 | | Juraj Hromkovic,
Ralf Klasing,
Andrzej Pelc,
Peter Ruzicka,
Walter Unger:
Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance
Springer 2005 |
33 | EE | Sebastian Seibert,
Walter Unger:
A 1.5-Approximation of the Minimal Manhattan Network Problem.
ISAAC 2005: 246-255 |
2004 |
32 | EE | 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): 137-153 (2004) |
2003 |
31 | EE | 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: 189-200 |
30 | EE | Pierluigi Crescenzi,
Giorgio Gambosi,
Gaia Nicosia,
Paolo Penna,
Walter Unger:
Online Load Balancing Made Simple: Greedy Strikes Back.
ICALP 2003: 1108-1122 |
29 | EE | Daniel Keysers,
Walter Unger:
Elastic image matching is NP-complete.
Pattern Recognition Letters 24(1-3): 445-453 (2003) |
2002 |
28 | EE | 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: 59-70 |
27 | EE | 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): 3-24 (2002) |
26 | EE | Sebastian Seibert,
Walter Unger:
The hardness of placing street names in a Manhattan type map.
Theor. Comput. Sci. 285(1): 89-99 (2002) |
25 | EE | Micah Adler,
Arnold L. Rosenberg,
Ramesh K. Sitaraman,
Walter Unger:
Scheduling Time-Constrained Communication in Linear Networks.
Theory Comput. Syst. 35(6): 599-623 (2002) |
2001 |
24 | EE | Xavier Muñoz,
Walter Unger,
Imrich Vrto:
One Sided Crossing Minimization Is NP-Hard for Sparse Graphs.
Graph Drawing 2001: 115-123 |
23 | EE | Rusins Freivalds,
Juraj Hromkovic,
Gheorghe Paun,
Walter Unger:
Foreword.
Theor. Comput. Sci. 264(1): 1-2 (2001) |
2000 |
22 | EE | Sebastian Seibert,
Walter Unger:
The Hardness of Placing Street Names in a Manhattan Type Map.
CIAC 2000: 102-112 |
21 | EE | 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: 72-86 |
20 | EE | 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: 382-394 |
19 | EE | 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): 133-138 (2000) |
1999 |
18 | EE | 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
Electronic Colloquium on Computational Complexity (ECCC) 6(31): (1999) |
1998 |
17 | EE | Walter Unger:
The Complexity of the Approximation of the Bandwidth Problem.
FOCS 1998: 82-91 |
16 | EE | Micah Adler,
Ramesh K. Sitaraman,
Arnold L. Rosenberg,
Walter Unger:
Scheduling Time-Constrained Communication in Linear Networks.
SPAA 1998: 269-278 |
15 | EE | Sergei L. Bezrukov,
Burkhard Monien,
Walter Unger,
Gerd Wechsung:
Embedding ladders and caterpillars into the hypercube.
Discrete Applied Mathematics 83(1-3): 21-29 (1998) |
14 | | Ralf Heckmann,
Ralf Klasing,
Burkhard Monien,
Walter Unger:
Optimal Embedding of Complete Binary Trees into Lines and Grids.
J. Parallel Distrib. Comput. 49(1): 40-56 (1998) |
1997 |
13 | | Juraj Hromkovic,
Ralf Klasing,
Walter Unger,
Hubert Wagener:
Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes.
Inf. Comput. 133(1): 1-33 (1997) |
1996 |
12 | | Alessandro Roncato,
Walter Unger:
Systolic Gossip in Complete Trees.
SIROCCO 1996: 279-291 |
1995 |
11 | | 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: 273-282 |
10 | | 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: 255-266 |
1994 |
9 | | 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: 235-249 |
8 | | Markus Röttger,
Ulf-Peter Schroeder,
Walter Unger:
Embedding 3-dimensional Grids into Optimal Hypercubes.
Canada-France Conference on Parallel and Distributed Computing 1994: 81-94 |
7 | | Juraj Hromkovic,
Ralf Klasing,
Walter Unger,
Hubert Wagener:
Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract).
SWAT 1994: 219-230 |
6 | | Juraj Hromkovic,
Ralf Klasing,
Walter Unger,
Hubert Wagener,
Dana Pardubská:
The Complexity of Systolic Dissemination of Information in Interconnection Networks.
ITA 28(3-4): 303-342 (1994) |
5 | | Yoshihide Igarashi,
Shingo Osawa,
Walter Unger:
Automorphisms of Broadcasting Schemes with Respect to Start Rounds.
Inf. Process. Lett. 51(1): 35-41 (1994) |
1992 |
4 | | Walter Unger:
The Complexity of Colouring Circle Graphs (Extended Abstract).
STACS 1992: 389-400 |
3 | | Rainer Feldmann,
Walter Unger:
The Cube-Connected Cycles Network Is a Subgraph of the Butterfly Network.
Parallel Processing Letters 2: 13-19 (1992) |
1991 |
2 | | Ralf Heckmann,
Ralf Klasing,
Burkhard Monien,
Walter Unger:
Optimal Embedding of Complete Binary Trees into Lines and Grids.
WG 1991: 25-35 |
1988 |
1 | | Walter Unger:
On the k-Colouring of Circle-Graphs.
STACS 1988: 61-72 |