Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Unger, Walter"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Advice complexity of the online coloring problem
Sebastian Seibert
,
Andreas Sprock
,
Walter Unger
Lecture Notes in Computer Science
7878
, 2013, pp. 345-357
Hardness results for approximating the bandwidth
Chandan Dubey
,
Uriel Feige
,
Walter Unger
Journal of Computer and System Sciences
77
(1), 2011, pp. 62-90
On the size of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks
Juraj Hromkovic̑
,
Przemysƚawa Kanarek
,
Ralf Klasing
,
Krzysztof Loryś
,
Walter Unger
,
Hubert Wagener
SIAM Journal on Discrete Mathematics
23
(3), 2009, pp. 1612-1645
Public-Key-Kryptographie
Dirk Bongartz
,
Walter Unger
eXamen.press
, 2008, pp. 157-169
A 1.5-approximation of the minimal Manhattan network problem
Sebastian Seibert
,
Walter Unger
Lecture Notes in Computer Science
3827
, 2005, pp. 246-255
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
Theoretical Computer Science
326
(1-3), 2004, pp. 137-153
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
Lecture Notes in Computer Science
2653
, 2003, pp. 189-200
Online load balancing made simple: Greedy strikes back
Pilu Crescenzi
,
Giorgio Gambosi
,
Gaia Nicosia
,
Paolo Penna
,
Walter Unger
Lecture Notes in Computer Science
2719
, 2003, pp. 1108-1122
Scheduling time-constrained communication in linear networks
Micah Adler
,
Arnold L. Rosenberg
,
Ramesh K. Sitaraman
,
Walter Unger
Theory of Computing Systems
35
(6), 2002, pp. 599-623
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
Lecture Notes in Computer Science
2556
, 2002, pp. 59-70
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
Theoretical Computer Science
285
(1), 2002, pp. 3-24
The hardness of placing street names in a Manhattan type map
Sebastian Seibert
,
Walter Unger
Theoretical Computer Science
285
(1), 2002, pp. 89-99
Approximation algorithms for the TSP with sharpened triangle inequality
Hans-Joachim Böckenhauer
,
Juraj Hromkovic̑
,
Ralf Klasing
,
Sebastian Seibert
,
Walter Unger
Information Processing Letters
75
(3), 2000, pp. 133-138
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
Lecture Notes in Computer Science
1767
, 2000, pp. 72-86
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
Lecture Notes in Computer Science
1770
, 2000, pp. 382-394
The hardness of placing street names in a Manhattan type map
Sebastian Seibert
,
Walter Unger
Lecture Notes in Computer Science
1767
, 2000, pp. 102-112
Scheduling time-constrained communication in linear networks
Micah Adler
,
Arnold L. Rosenberg
,
Ramesh K. Sitaraman
,
Walter Unger
Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'98 (Puerto Vallarta, Mexico, June 28 - July 2, 1998)
, 1998, pp. 269-278
Embedding ladders and caterpillars into the hypercube
Sergei Bezrukov
,
Burkhard Monien
,
Walter Unger
,
Gerd Wechsung
Discrete Applied Mathematics
83
(1-3), 1998, pp. 21-29
Optimal embedding of complete binary trees into lines and grids
Ralf Heckmann
,
Ralf Klasing
,
Burkhard Monien
,
Walter Unger
Journal Parallel Distributed Computing
49
(1), 1998, pp. 40-56
The complexity of the approximation of the bandwidth problem
Walter Unger
Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, FOCS'98 (Palo Alto, California, November 8-11, 1998)
, 1998, pp. 82-91
Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
Juraj Hromkovic̑
,
Ralf Klasing
,
Walter Unger
,
Hubert Wagener
Information and Computation
133
(1), 1997, pp. 1-33
Effective systolic algorithms for gossiping in cycles and two-dimensional grids
Juraj Hromkovic̑
,
Ralf Klasing
,
Dana Pardubská
,
Walter Unger
,
Juraj Waczulik
,
Hubert Wagener
Lecture Notes in Computer Science
965
, 1995, pp. 273-282
Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
Juraj Hromkovic̑
,
Ralf Klasing
,
Walter Unger
,
Hubert Wagener
Proceedings of the 4th Scandinavian Workshop on Algorithm Theory - SWAT '94 (Aarhus, Denmark, July 6-8, 1994)
LNCS 824
, 1994, pp. 219-230
Automorphisms of broadcasting schemes with respect to start rounds
Yoshihide Igarashi
,
Shingo Osawa
,
Walter Unger
Information Processing Letters
51
, 1994, pp. 35-41
Embedding of ladders into the hypercube
Sergej Bezrukov
,
Burkhard Monien
,
Walter Unger
,
Gerd Wechsung
misc, 1993
Seiten 1
2
>