| 2023 | ITiCSE | Choosing a Didactic Basis for an Instructional Video: What Are the Implications For Novice Programmers? | Svana Esche, Karsten Weihe |
| 2017 | ALENEX | Distributed Graph-based Topology Adaptation using Motif Signatures. | Michael Stein, Karsten Weihe, Augustin Wilberg, Roland Kluge, Julian M. Klomp, Mathias Schnee, Lin Wang, Max Mhlhuser |
| 2017 | WWW | Is Interaction More Important than Individual Performance?: A Study of Motifs in Wikia. | Thomas Arnold, Johannes Daxenberger, Iryna Gurevych, Karsten Weihe |
| 2012 | ATMOS | Reliability and Delay Distributions of Train Connections. | Mohammad H. Keyhani, Mathias Schnee, Karsten Weihe, Hans-Peter Zorn |
| 2012 | COLING | Quantifying Semantics using Complex Network Analysis. | Chris Biemann, Stefanie Roos, Karsten Weihe |
| 2008 | GI | Weiterbildung an Universitten: Gegenwartt und Zukunft. | Karsten Weihe |
| 2007 | SODA | Maximum | Jan M. Hochstein, Karsten Weihe |
| 2005 | CP | Weak Symmetries in Problem Formulations. | Roland Martin, Karsten Weihe |
| 1999 | FOCS | Edge-Disjoint Routing in Plane Switch Graphs in Linear Time. | Karsten Weihe |
| 1999 | WG | On the Hardness of Recognizing Bundles in Time Table Graphs. | Annegret Liebers, Dorothea Wagner, Karsten Weihe |
| 1997 | ESA | Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element Meshes. | Matthias Mller-Hannemann, Karsten Weihe |
| 1997 | ESA | Reconstructing the Topology of a CAD Model: A Discrete Approach. | Karsten Weihe, Thomas Willhalm |
| 1997 | OOPSLA | Reuse of Algorithms: Still a Challenge to Object-Oriented Programming. | Karsten Weihe |
| 1995 | SODA | Using Network Flows for Surface Modeling. | Rolf H. Mhring, Matthias Mller-Hannemann, Karsten Weihe |
| 1994 | ESA | Edge-Disjoint (s, t)-Paths on Undirected Planar Graphs in Linear Time. | Karsten Weihe |
| 1994 | FOCS | Maximum (s, t)-Flows in Planar Networks in O(|V| log |V|) Time | Karsten Weihe |
| 1993 | ESA | A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs. | Dorothea Wagner, Karsten Weihe |
| 1993 | ISAAC | Linear Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs. | Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe |
| 1993 | ISAAC | Multicommodity Flows in Even, Planar Networks. | Karsten Weihe |
| 1993 | SODA | The Vertex-Disjoint Menger Problem in Planar Graphs. | Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe |
| 1992 | ISAAC | Wiring Knock-Knee Layouts: A Global Appoach. | Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe |