Karsten Weihe

Publication Activity (10 Years)

Years Active: 1992-2023
Publications (10 Years): 9

Top Topics

Novice Programmers

Scientific Literature

Sentiment Analysis

Top Venues

TextGraphs@NAACL-HLT

IEEE Trans. Educ.

Publications

Svana Esche, Karsten Weihe
Choosing a Didactic Basis for an Instructional Video: What Are the Implications For Novice Programmers? ITiCSE (1) (2023)
Svana Esche, Karsten Weihe
Case Study on the Terms Novice Programmers Use to Describe Code Snippets in Java. IEEE Trans. Educ. 66 (6) (2023)
Felix Gündling, Florian Hopp, Karsten Weihe
Efficient monitoring of public transport journeys. Public Transp. 12 (3) (2020)
Thomas Arnold, Johannes Daxenberger, Iryna Gurevych, Karsten Weihe
Is Interaction More Important than Individual Performance?: A Study of Motifs in Wikia. WWW (Companion Volume) (2017)
Michael Stein, Karsten Weihe, Augustin Wilberg, Roland Kluge, Julian M. Klomp, Mathias Schnee, Lin Wang, Max Mühlhäuser
Distributed Graph-based Topology Adaptation using Motif Signatures. ALENEX (2017)
Mohammad H. Keyhani, Mathias Schnee, Karsten Weihe
Arrive in Time by Train with High Probability. Transp. Sci. 51 (4) (2017)
Zheng Ma, Jinseok Nam, Karsten Weihe
Improve Sentiment Analysis of Citations with Author Modelling. WASSA@NAACL-HLT (2016)
Thomas Arnold, Karsten Weihe
Network Motifs May Improve Quality Assessment of Text Documents. TextGraphs@NAACL-HLT (2016)
Michael Stein, Dominic Lerbs, Mohamed Hassan, Mathias Schnee, Immanuel Schweizer, Karsten Weihe, Max Mühlhäuser
Evaluation study for clustering in wireless sensor networks. CSNDSP (2016)
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, Karsten Weihe
Knowledge Discovery in Scientific Literature. KONVENS (2014)
Chris Biemann, Stefanie Roos, Karsten Weihe
Quantifying Semantics using Complex Network Analysis. COLING (2012)
Mohammad H. Keyhani, Mathias Schnee, Karsten Weihe, Hans-Peter Zorn
Reliability and Delay Distributions of Train Connections. ATMOS (2012)
Christoph Fretter, Lachezar Krumov, Karsten Weihe, Matthias Müller-Hannemann, Marc-Thorsten Hütt
Phase Synchronization in Railway Timetables CoRR (2010)
Alaubek Avdil, Karsten Weihe
Local search starting from an LP solution: Fast and quite good. ACM J. Exp. Algorithmics 14 (2009)
Karsten Weihe
Weiterbildung an Universitäten: Gegenwartt und Zukunft. Lebenslanges Lernen in der Informatik (2008)
Jan M. Hochstein, Karsten Weihe
) time. SODA (2007)
Matthias Müller-Hannemann, Karsten Weihe
Moving policies in cyclic assembly line scheduling. Theor. Comput. Sci. 351 (3) (2006)
Matthias Müller-Hannemann, Karsten Weihe
On the cardinality of the Pareto set in bicriteria shortest path problems. Ann. Oper. Res. 147 (1) (2006)
Siamak Tazari, Matthias Müller-Hannemann, Karsten Weihe
Workload Balancing in Multi-stage Production Processes. WEA (2006)
Roland Martin, Karsten Weihe
Weak Symmetries in Problem Formulations. CP (2005)
Matthias Müller-Hannemann, Karsten Weihe
Moving Policies in Cyclic Assembly-Line Scheduling. IWPEC (2004)
Jan M. Hochstein, Karsten Weihe
Edge-disjoint routing in plane switch graphs in linear time. J. ACM 51 (4) (2004)
Matthias Müller-Hannemann, Mathias Schnee, Karsten Weihe
Getting Train Timetables into the Main Storage. Electron. Notes Theor. Comput. Sci. 66 (6) (2002)
Matthias Müller-Hannemann, Karsten Weihe
Pareto Shortest Paths is Often Feasible in Practice. WAE (2001)
Karsten Weihe
A software engineering perspective on algorithmics. ACM Comput. Surv. 33 (1) (2001)
Frank Schulz, Dorothea Wagner, Karsten Weihe
Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. ACM J. Exp. Algorithmics 5 (2000)
Annegret Liebers, Dorothea Wagner, Karsten Weihe
On the Hardness of Recognizing Bundles in Time Table Graphs. Int. J. Found. Comput. Sci. 11 (3) (2000)
Karsten Weihe
On the Differences between "Practical" and "Applied". WAE (2000)
Karsten Weihe, Thomas Willhalm
Reconstructing the Topology of a CAD Model - a Discrete Approach. Algorithmica 26 (1) (2000)
Dorothea Wagner, Karsten Weihe
Editorial: Discrete algorithm engineering. Softw. Pract. Exp. 30 (11) (2000)
Matthias Müller-Hannemann, Karsten Weihe
Quadrangular Refinements of Convex Polygons with an Application to Finite-Element Meshes. Int. J. Comput. Geom. Appl. 10 (1) (2000)
Annegret Liebers, Karsten Weihe
Recognizing Bundles in Time Table Graphs - A Structural Approach. WAE (2000)
Frank Schulz, Dorothea Wagner, Karsten Weihe
Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. WAE (1999)
Karsten Weihe, Ulrik Brandes, Annegret Liebers, Matthias Müller-Hannemann, Dorothea Wagner, Thomas Willhalm
Empirical Design of Geometric Algorithms. SCG (1999)
Karsten Weihe
Edge-Disjoint Routing in Plane Switch Graphs in Linear Time. FOCS (1999)
Ulrik Brandes, Wolfram Schlickenrieder, Gabriele Neyer, Dorothea Wagner, Karsten Weihe
A Software Package of Algorithms and Heuristics for Disjoint Paths in Planar Networks. Discret. Appl. Math. 92 (2-3) (1999)
Annegret Liebers, Dorothea Wagner, Karsten Weihe
On the Hardness of Recognizing Bundles in Time Table Graphs. WG (1999)
Karsten Weihe
Laufzeitdynamische Evaluierung tabellarischer Daten. Inform. Forsch. Entwickl. 13 (2) (1998)
Ullrich Köthe, Karsten Weihe
The STL Model in the Geometric Domain. Generic Programming (1998)
Karsten Weihe, Thomas Willhalm
Why CAD Data Repair Requires Discrete Algorithmic Techniques. WAE (1998)
Dieter Gluche, Dietmar Kühl, Karsten Weihe
Iterators Evaluate Table Queries (C++ Toolbox). ACM SIGPLAN Notices 33 (1) (1998)
Karsten Weihe
Multicommodity Flows in Even, Planar Networks. Algorithmica 18 (3) (1997)
Karsten Weihe
Edge-Disjoint (s, t)-Paths in Undirected Planar Graphs in Linear Time. J. Algorithms 23 (1) (1997)
Karsten Weihe
Reuse of Algorithms: Still a Challenge to Object-Oriented Programming. OOPSLA (1997)
Karsten Weihe, Thomas Willhalm
Reconstructing the Topology of a CAD Model: A Discrete Approach. ESA (1997)
Karsten Weihe
Maximum (s, t)-Flows in Planar Networks in O(|V|log|V|)-Time. J. Comput. Syst. Sci. 55 (3) (1997)
Rolf H. Möhring, Matthias Müller-Hannemann, Karsten Weihe
Mesh refinement via bidirected flows: modeling, complexity, and computational results. J. ACM 44 (3) (1997)
Matthias Müller-Hannemann, Karsten Weihe
Minimum Strictly Convex Quadrangulations of Convex Polygons. SCG (1997)
Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
The Vertex-Disjoint Menger Problem in Planar Graphs. SIAM J. Comput. 26 (2) (1997)
Dietmar Kühl, Marco Nissen, Karsten Weihe
Efficient, Adaptable Implementations of Graph Algorithms. WAE (1997)
Matthias Müller-Hannemann, Karsten Weihe
Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element Meshes. ESA (1997)
Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
Linear-Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs. Int. J. Found. Comput. Sci. 7 (2) (1996)
Annegret Liebers, Dorothea Wagner, Karsten Weihe
C++ im Nebenfachstudium: Konzepte und Erfahrungen. Inform. Spektrum 19 (5) (1996)
M. Seetharama Gowda, Karsten Weihe
Book reviews. Math. Methods Oper. Res. 41 (2) (1995)
Dorothea Wagner, Karsten Weihe
A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs. Comb. 15 (1) (1995)
Dorothea Wagner, Karsten Weihe
An Animated Library of Combinatorial VLSI-Routing Algorithms. SCG (1995)
Rolf H. Möhring, Matthias Müller-Hannemann, Karsten Weihe
Using Network Flows for Surface Modeling. SODA (1995)
Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe
Wiring Knock-Knee Layouts: A Global Approach. IEEE Trans. Computers 43 (5) (1994)
Karsten Weihe
Edge-Disjoint (s, t)-Paths on Undirected Planar Graphs in Linear Time. ESA (1994)
Karsten Weihe
Maximum (s, t)-Flows in Planar Networks in O(|V| log |V|) Time FOCS (1994)
Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
Linear Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs. ISAAC (1993)
Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
The Vertex-Disjoint Menger Problem in Planar Graphs. SODA (1993)
Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
Efficient algorithms for disjoint paths in planar graphs. Combinatorial Optimization (1993)
Karsten Weihe
Multicommodity Flows in Even, Planar Networks. ISAAC (1993)
Dorothea Wagner, Karsten Weihe
A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs. ESA (1993)
M. Schäffter, Karsten Weihe, Petra Mutzel, Salah E. Elmaghraby
Book reviews. ZOR Methods Model. Oper. Res. 37 (1) (1993)
Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe
Wiring Knock-Knee Layouts: A Global Appoach. ISAAC (1992)