Professorin Dr. Heike Ripphausen-Lipa

Veröffentlichungen

H. Ripphausen-Lipa, D. Wagner und K. Weihe
The Vertex-Disjoint Menger Problem in Planar Graphs
In: SIAM Journal on Computing, Vol. 26, No. 2, S. 331 - 349, 1997

H. Ripphausen-Lipa, D. Wagner und K. Weihe
Linear-Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs
In: International Journal of Foundations of Computer Science 7, S. 95 – 110, 1996

H. Ripphausen-Lipa, D. Wagner und K. Weihe
Survey on Efficient Algorithms for Disjoint Paths in Planar Graphs
In: William Cook, Laslo Lovasz und P. Seymour (Ed.) DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 20, S. 295 – 354, American Mathematical Society, 1995

H. Ripphausen-Lipa
Efficient Algorithms for Disjoint Steiner Trees Packing Problems in Planar Graphs
Dissertation am Fachbereich Mathematik der TU Berlin, 1994

H. Ripphausen-Lipa, D. Wagner und K. Weihe
Linear Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs
In: K.W. Ng, P. Raghavan, N.V. Balasubramanian und F.Y.L. Chin (Ed.) Algorithms and Computation, 4th International Symposium ISACC `93 S. 943 – 352, Springer Verlag, Lecture Notes in Computer Science, 1993

H. Ripphausen-Lipa, D. Wagner und K. Weihe
The Vertex-Disjoint Menger Problem in Planar Graphs (Extended Abstract)
In: Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1993 S. 112 – 119

M. Bienemann, H. Ripphausen und F. Wagner
A Simulated Annealing Approach to the General Graph Layout Problem (Extended Abstract)
In: U. Rieder, P. Gessner, A. Peyerimhoff, F.J. Radermacher (Ed.) Methods of Operations Research, 62 XIV Symposium on Operations Research, 1989 S. 255 – 260

nach oben
BHT Berlin · Fachbereich VI Informatik und Medien · Impressum/Haftungsausschluss