A. Merceron, J.-M. Adam, H. Ripphausen-Lipa, P. Sauer, D. Bardou
Enhancing and integrating employability of students for IT
In: CERJ Contemporary Education Researches Journal, Vol 8, No. 1, 2018, S. 01-07, ISSN 2301-2552 		     
P. Sauer, A. Merceron, H. Ripphausen-Lipa
Herausforderungen und Chancen international vernetzter Lehre
In: Research Day 2017, Stadt der Zukunft, Tagungsband, S. 104-109, ISBN 978-3-8305-3829-5 		     
P. Sauer, A. Merceron, H. Ripphausen-Lipa
Introducing Informatic Topics to Students in ISC
In: Varia Informatica 2017 (Ed. M. Milosz, U. Tukeyev), S. 159-172, ISBN 978-83-936692-3-3 		     
A. Merceron, H. Ripphausen-Lipa, P. Sauer
Links with Industry in Teaching and Resarch
In: Proceedings of the VI International Scientific and Practical Conference Informatization of Society, S. 32 – 35, 2017, ISBN 978-601-301-994-9 		     
D. Bardou, J.-M. Adam, M. Milosz, A. Merceron, H. Ripphausen-Lipa, K. Kapocius, A. Toppinen
Pedagogy sharing in the PROMIS project
In: Proceedings of the IEEE Global Engineering Education Conference, EDUCON 2015, S. 587 - 593 		     
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
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
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