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
Hilfe
Suche: Author="Bein, Wolfgang W."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A quadratic time 2-approximation algorithm for block sorting
Wolfgang W. Bein
,
Lawrence L. Larmore
,
Linda Morales
,
I. Hal Sudborough
Theoretical Computer Science
410
(8-10), 2009, pp. 711-717
Optimal embedding of honeycomb networks into hypercubes
Doina Bein
,
Wolfgang W. Bein
,
Natasa Brajkovska
,
Shahram Latifi
Parallel Processing Letters
14
(3-4), 2004, pp. 367-375
Optimally competitive list batching
Wolfgang W. Bein
,
Leah Epstein
,
Lawrence L. Larmore
,
John Noga
Lecture Notes in Computer Science
3111
, 2004, pp. 77-89
Block sorting is hard
Wolfgang W. Bein
,
Lawrence L. Larmore
,
Shahram Latifi
,
I. Hal Sudborough
International Journal of Foundations of Computer Science
14
(3), 2003, pp. 425-437
Fast algorithms with algebraic Monge properties
Wolfgang W. Bein
,
Peter Brucker
,
Lawrence L. Larmore
,
James K. Park
Lecture Notes in Computer Science
2420
, 2002, pp. 104-117
The 3-server problem in the plane
Wolfgang W. Bein
,
Marek Chrobak
,
Lawrence L. Larmore
Theoretical Computer Science
289
(1), 2002, pp. 335-354
Limited bookmark randomized online algorithms for the paging problem
Wolfgang W. Bein
,
Rudolf Fleischer
,
Lawrence L. Larmore
Information Processing Letters
76
(4-6), 2000, pp. 155-162
Trackless online algorithms for the server problem
Wolfgang W. Bein
,
Lawrence L. Larmore
Information Processing Letters
74
(1-2), 2000, pp. 73-79
The 3-server problem in the plane
Wolfgang W. Bein
,
Marek Chrobak
,
Lawrence L. Larmore
Lecture Notes in Computer Science
1643
, 1999, pp. 301-312
A Monge property for the
d
-dimensional transportation problem
Wolfgang W. Bein
,
Peter Brucker
,
James K. Park
,
Pramod K. Pathak
Discrete Applied Mathematics
58
, 1995, pp. 97-109
Optimal reduction of two-terminal directed acyclic graphs
Wolfgang W. Bein
,
Jerzy Kamburowski
,
Matthias F.M. Stallmann
SIAM Journal on Computing
21
(6), 1992, December, pp. 1112-1129
Greedy concepts for network flow problems
Wolfgang W. Bein
,
Peter Brucker
Discrete Applied Mathematics
15
, 1986, pp. 135-144
Minimum cost flow algorithms for series-parallel networks
Wolfgang W. Bein
,
Peter Brucker
,
Arie Tamir
Discrete Applied Mathematics
10
, 1985, pp. 117-124