Wiring Knock-Knee Layouts: A Global Appoach. - Majid Sarrafzadeh; Dorothea Wagner; Frank Wagner 001; Karsten Weihe (ISAAC, 1992)

Efficient algorithms for disjoint paths in planar graphs. - Heike Ripphausen-Lipa; Dorothea Wagner; Karsten Weihe (Combinatorial Optimization, 1993)

Book reviews. - M. Schäffter; Karsten Weihe; Petra Mutzel; Salah E. Elmaghraby (ZOR Methods Model. Oper. Res., 1993)

Wiring Knock-Knee Layouts: A Global Approach. - Majid Sarrafzadeh; Dorothea Wagner; Frank Wagner 001; Karsten Weihe (IEEE Trans. Computers, 1994)

An Animated Library of Combinatorial VLSI-Routing Algorithms. - Dorothea Wagner; Karsten Weihe (SCG, 1995)

Using Network Flows for Surface Modeling. - Rolf H. Möhring; Matthias Müller-Hannemann; Karsten Weihe (SODA, 1995)

A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs. - Dorothea Wagner; Karsten Weihe (Comb., 1995)

Book reviews. - M. Seetharama Gowda; Karsten Weihe (Math. Methods Oper. Res., 1995)

Linear-Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs. - Heike Ripphausen-Lipa; Dorothea Wagner; Karsten Weihe (Int. J. Found. Comput. Sci., 1996)

C++ im Nebenfachstudium: Konzepte und Erfahrungen. - Annegret Liebers; Dorothea Wagner; Karsten Weihe (Inform. Spektrum, 1996)

Minimum Strictly Convex Quadrangulations of Convex Polygons. - Matthias Müller-Hannemann; Karsten Weihe (SCG, 1997)

Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element Meshes. - Matthias Müller-Hannemann; Karsten Weihe (ESA, 1997)

Reuse of Algorithms: Still a Challenge to Object-Oriented Programming. - Karsten Weihe (OOPSLA, 1997)

Efficient, Adaptable Implementations of Graph Algorithms. - Dietmar Kühl; Marco Nissen; Karsten Weihe (WAE, 1997)

Multicommodity Flows in Even, Planar Networks. - Karsten Weihe (Algorithmica, 1997)

Mesh refinement via bidirected flows: modeling, complexity, and computational results. - Rolf H. Möhring; Matthias Müller-Hannemann; Karsten Weihe (J. ACM, 1997)

Edge-Disjoint (s, t)-Paths in Undirected Planar Graphs in Linear Time. - Karsten Weihe (J. Algorithms, 1997)

Maximum (s, t)-Flows in Planar Networks in O(|V|log|V|)-Time. - Karsten Weihe (J. Comput. Syst. Sci., 1997)

The Vertex-Disjoint Menger Problem in Planar Graphs. - Heike Ripphausen-Lipa; Dorothea Wagner; Karsten Weihe (SIAM J. Comput., 1997)

The STL Model in the Geometric Domain. - Ullrich Köthe; Karsten Weihe (Generic Programming, 1998)

Why CAD Data Repair Requires Discrete Algorithmic Techniques. - Karsten Weihe; Thomas Willhalm (WAE, 1998)

Laufzeitdynamische Evaluierung tabellarischer Daten. - Karsten Weihe (Inform. Forsch. Entwickl., 1998)

Iterators Evaluate Table Queries (C++ Toolbox). - Dieter Gluche; Dietmar Kühl; Karsten Weihe (ACM SIGPLAN Notices, 1998)

Empirical Design of Geometric Algorithms. - Karsten Weihe; Ulrik Brandes; Annegret Liebers; Matthias Müller-Hannemann; Dorothea Wagner; Thomas Willhalm (SCG, 1999)

Edge-Disjoint Routing in Plane Switch Graphs in Linear Time. - Karsten Weihe (FOCS, 1999)

A Software Package of Algorithms and Heuristics for Disjoint Paths in Planar Networks. - Ulrik Brandes; Wolfram Schlickenrieder; Gabriele Neyer; Dorothea Wagner; Karsten Weihe (Discret. Appl. Math., 1999)

Recognizing Bundles in Time Table Graphs - A Structural Approach. - Annegret Liebers; Karsten Weihe (WAE, 2000)

On the Differences between "Practical" and "Applied". - Karsten Weihe (WAE, 2000)

Reconstructing the Topology of a CAD Model - a Discrete Approach. - Karsten Weihe; Thomas Willhalm (Algorithmica, 2000)

Quadrangular Refinements of Convex Polygons with an Application to Finite-Element Meshes. - Matthias Müller-Hannemann; Karsten Weihe (Int. J. Comput. Geom. Appl., 2000)

On the Hardness of Recognizing Bundles in Time Table Graphs. - Annegret Liebers; Dorothea Wagner; Karsten Weihe (Int. J. Found. Comput. Sci., 2000)

Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. - Frank Schulz 001; Dorothea Wagner; Karsten Weihe (ACM J. Exp. Algorithmics, 2000)

Editorial: Discrete algorithm engineering. - Dorothea Wagner; Karsten Weihe (Softw. Pract. Exp., 2000)

Pareto Shortest Paths is Often Feasible in Practice. - Matthias Müller-Hannemann; Karsten Weihe (WAE, 2001)

A software engineering perspective on algorithmics. - Karsten Weihe (ACM Comput. Surv., 2001)

Getting Train Timetables into the Main Storage. - Matthias Müller-Hannemann; Mathias Schnee; Karsten Weihe (ATMOS, 2002)

Edge-disjoint routing in plane switch graphs in linear time. - Jan M. Hochstein; Karsten Weihe (J. ACM, 2004)

Weak Symmetries in Problem Formulations. - Roland Martin; Karsten Weihe (CP, 2005)

Workload Balancing in Multi-stage Production Processes. - Siamak Tazari; Matthias Müller-Hannemann; Karsten Weihe (WEA, 2006)

On the cardinality of the Pareto set in bicriteria shortest path problems. - Matthias Müller-Hannemann; Karsten Weihe (Ann. Oper. Res., 2006)

Moving policies in cyclic assembly line scheduling. - Matthias Müller-Hannemann; Karsten Weihe (Theor. Comput. Sci., 2006)

Maximum s-t-flow with k crossings in O(k3n log n) time. - Jan M. Hochstein; Karsten Weihe (SODA, 2007)

Weiterbildung an Universitäten: Gegenwartt und Zukunft. - Karsten Weihe (Lebenslanges Lernen in der Informatik, 2008)

Local search starting from an LP solution: Fast and quite good. - Alaubek Avdil; Karsten Weihe (ACM J. Exp. Algorithmics, 2009)

Phase Synchronization in Railway Timetables - Christoph Fretter; Lachezar Krumov; Karsten Weihe; Matthias Müller-Hannemann; Marc-Thorsten Hütt (CoRR, 2010)

Reliability and Delay Distributions of Train Connections. - Mohammad H. Keyhani; Mathias Schnee; Karsten Weihe; Hans-Peter Zorn (ATMOS, 2012)

Quantifying Semantics using Complex Network Analysis. - Chris Biemann; Stefanie Roos; Karsten Weihe (COLING, 2012)

Knowledge Discovery in Scientific Literature. - Jinseok Nam; Christian Kirschner; Zheng Ma; Nicolai Erbs; Susanne Neumann; Daniela Oelke; Steffen Remus; Chris Biemann; Judith Eckle-Kohler; Johannes Fürnkranz; Iryna Gurevych; Marc Rittberger; et al. (KONVENS, 2014)

Motifs in Networks. - Karsten Weihe (Gems of Combinatorial Optimization and Graph Algorithms, 2015)

Evaluation study for clustering in wireless sensor networks. - Michael Stein 001; Dominic Lerbs; Mohamed Hassan; Mathias Schnee; Immanuel Schweizer; Karsten Weihe; Max Mühlhäuser (CSNDSP, 2016)

Network Motifs May Improve Quality Assessment of Text Documents. - Thomas Arnold 002; Karsten Weihe (TextGraphs@NAACL-HLT, 2016)

Improve Sentiment Analysis of Citations with Author Modelling. - Zheng Ma; Jinseok Nam; Karsten Weihe (WASSA@NAACL-HLT, 2016)

Distributed Graph-based Topology Adaptation using Motif Signatures. - Michael Stein 001; Karsten Weihe; Augustin Wilberg; Roland Kluge; Julian M. Klomp; Mathias Schnee; Lin Wang 015; Max Mühlhäuser (ALENEX, 2017)

Is Interaction More Important than Individual Performance?: A Study of Motifs in Wikia. - Thomas Arnold 002; Johannes Daxenberger; Iryna Gurevych; Karsten Weihe (WWW (Companion Volume), 2017)

Arrive in Time by Train with High Probability. - Mohammad H. Keyhani; Mathias Schnee; Karsten Weihe (Transp. Sci., 2017)

Efficient monitoring of public transport journeys. - Felix Gündling; Florian Hopp; Karsten Weihe (Public Transp., 2020)

Choosing a Didactic Basis for an Instructional Video: What Are the Implications For Novice Programmers? - Svana Esche; Karsten Weihe (ITiCSE (1), 2023)

Case Study on the Terms Novice Programmers Use to Describe Code Snippets in Java. - Svana Esche; Karsten Weihe (IEEE Trans. Educ., 2023)