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="Weihe, Karsten"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Moving policies in cyclic assembly line scheduling
Matthias Müller-Hannemann
,
Karsten Weihe
Theoretical Computer Science
351
(3), 2006, pp. 425-436
Edge-disjoint routing in plane switch graphs in linear time
Jan M. Hochstein
,
Karsten Weihe
Journal of the ACM
51
(4), 2004, pp. 636-670
Pareto shortest paths is often feasible in practice
Matthias Müller-Hannemann
,
Karsten Weihe
Lecture Notes in Computer Science
2141
, 2001, pp. 185-197
On the hardness of recognizing bundles in time table graphs
Annegret Liebers
,
Dorothea Wagner
,
Karsten Weihe
International Journal of Foundations of Computer Science
11
(3), 2000, pp. 467-484
PlaNet - A software package of algorithms and heuristics for disjoint paths in
Pla
nar
Net
works
Ulrik Brandes
,
Wolfram Schlickenrieder
,
Gabriele Neyer
,
Dorothea Wagner
,
Karsten Weihe
Discrete Applied Mathematics
92
(2-3), 1999, pp. 91-110
On the hardness of recognizing bundles in time table graphs
Annegret Liebers
,
Dorothea Wagner
,
Karsten Weihe
Lecture Notes in Computer Science
1665
, 1999, pp. 325-337
Dijkstra's algorithm on-line: An empirical case study from public railroad transport
Frank Schulz
,
Dorothea Wagner
,
Karsten Weihe
Lecture Notes in Computer Science
1668
, 1999, pp. 110-123
Why CAD data repair requires discrete algorithmic techniques
Karsten Weihe
,
Thomas Willhalm
Proceedings of the 2nd Workshop on Algorithm Engineering, WAE'98 (Saarbrücken, Germany, August 20-22, 1998)
(MPI-I-98-1-019), 1998, pp. 1-12
Mesh refinement via bidirected flows: Modeling, complexity, and computational results
Rolf H. Möhring
,
Matthias Müller-Hannemann
,
Karsten Weihe
Journal of the ACM
44
(3), 1997, pp. 395-426
Improved approximations for minimum cardinality quadrangulations of finite element meshes
Matthias Müller-Hannemann
,
Karsten Weihe
Lecture Notes in Computer Science
1284
, 1997, pp. 364-377
The vertex-disjoint Menger problem in planar graphs
Heike Ripphausen-Lipa
,
Dorothea Wagner
,
Karsten Weihe
SIAM Journal on Computing
26
(2), 1997, pp. 331-349
Reconstructing the topology of a CAD model - A discrete approach
Karsten Weihe
,
Thomas Willhalm
Lecture Notes in Computer Science
1284
, 1997, pp. 500-513
Edge-disjoint
(s,t)
-paths in undirected planar graphs in linear time
Karsten Weihe
Journal of Algorithms
23
(1), 1997, pp. 121-138
Maximum
(s,t)
-flows in planar networks in
O(|V|\log|V|)
time
Karsten Weihe
Journal of Computer and System Sciences
55
(3), 1997, pp. 454-475
Linear-time algorithms for disjoint two-face paths problems in planar graphs
Heike Ripphausen-Lipa
,
Dorothea Wagner
,
Karsten Weihe
International Journal of Foundations of Computer Science
7
(2), 1996, pp. 95-110
Using network flows for surface modeling
Rolf H. Möhring
,
Matthias Müller-Hannemann
,
Karsten Weihe
Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'95 (San Francisdo, California, January 22-24, 1995)
, 1995, pp. 350-359
A linear-time algorithm for edge-disjoint paths in planar graphs
Dorothea Wagner
,
Karsten Weihe
Combinatorica
15
(1), 1995, pp. 135-150
Efficient algorithms for disjoint paths in planar graphs
Heike Ripphausen-Lipa
,
Dorothea Wagner
,
Karsten Weihe
Technical Report (371/1994), 1994
Wiring knock-knee layouts: A global approach
Majid Sarrafzadeh
,
Dorothea Wagner
,
Frank Wagner
,
Karsten Weihe
IEEE Transactions on Computers
43
(5), 1994, May, pp. 581-589
Edge-disjoint
(s,t)
-paths in undirected planar graphs in linear time
Karsten Weihe
Technical Report (374/1994), 1994
Edge-disjoint
(s,t)
-paths in undirected planar graphs in linear time
Karsten Weihe
Lecture Notes in Computer Science
855
, 1994, pp. 130-140
Kurzeinführung in C++
Karsten Weihe
Technical Report (383/1994), 1994
Maximum
(s,t)
-flows in planar networks in
O(|V|\log|V|)
time
Karsten Weihe
Technical Report (390/1994), 1994
Maximum (s,t)-flows in planar networks in
O(|V|\log|V|)
time
Karsten Weihe
Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994)
, 1994, pp. 178-189
Edge-disjoint
(s,t)
-paths in undirected planar graphs in linear time
Karsten Weihe
Proceedings of the 2nd Annual European Symposium on Algorithms. ESA '94 (Utrecht, The Netherlands, September 26-28, 1994)
LNCS 855
, 1994, pp. 130-140
Seiten 1
2
>