default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKarsten Weihe
Person information
- affiliation: Darmstadt University of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j27]Svana Esche
, Karsten Weihe:
Case Study on the Terms Novice Programmers Use to Describe Code Snippets in Java. IEEE Trans. Educ. 66(6): 642-653 (2023)- [c39]Svana Esche, Karsten Weihe:
Choosing a Didactic Basis for an Instructional Video: What Are the Implications For Novice Programmers? ITiCSE (1) 2023: 450-456 - 2020
- [j26]Felix Gündling, Florian Hopp, Karsten Weihe:
Efficient monitoring of public transport journeys. Public Transp. 12(3): 631-645 (2020)
2010 – 2019
- 2017
- [j25]Mohammad H. Keyhani, Mathias Schnee, Karsten Weihe:
Arrive in Time by Train with High Probability. Transp. Sci. 51(4): 1122-1137 (2017) - [c38]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: 1-12 - [c37]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: 1609-1617 - 2016
- [c36]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: 1-6 - [c35]Thomas Arnold, Karsten Weihe:
Network Motifs May Improve Quality Assessment of Text Documents. TextGraphs@NAACL-HLT 2016: 20-28 - [c34]Zheng Ma, Jinseok Nam, Karsten Weihe:
Improve Sentiment Analysis of Citations with Author Modelling. WASSA@NAACL-HLT 2016: 122-127 - 2015
- [p1]Karsten Weihe:
Motifs in Networks. Gems of Combinatorial Optimization and Graph Algorithms 2015: 59-68 - 2014
- [c33]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: 66-76 - 2012
- [c32]Mohammad H. Keyhani, Mathias Schnee, Karsten Weihe, Hans-Peter Zorn:
Reliability and Delay Distributions of Train Connections. ATMOS 2012: 35-46 - [c31]Chris Biemann, Stefanie Roos, Karsten Weihe:
Quantifying Semantics using Complex Network Analysis. COLING 2012: 263-278 - 2010
- [i1]Christoph Fretter, Lachezar Krumov, Karsten Weihe, Matthias Müller-Hannemann, Marc-Thorsten Hütt:
Phase Synchronization in Railway Timetables. CoRR abs/1003.4012 (2010)
2000 – 2009
- 2009
- [j24]Alaubek Avdil, Karsten Weihe:
Local search starting from an LP solution: Fast and quite good. ACM J. Exp. Algorithmics 14 (2009) - 2008
- [c30]Karsten Weihe:
Weiterbildung an Universitäten: Gegenwartt und Zukunft. Lebenslanges Lernen in der Informatik 2008: 23-32 - 2007
- [c29]Jan M. Hochstein, Karsten Weihe:
Maximum s-t-flow with k crossings in O(k3n log n) time. SODA 2007: 843-847 - 2006
- [j23]Matthias Müller-Hannemann, Karsten Weihe:
On the cardinality of the Pareto set in bicriteria shortest path problems. Ann. Oper. Res. 147(1): 269-286 (2006) - [j22]Matthias Müller-Hannemann, Karsten Weihe:
Moving policies in cyclic assembly line scheduling. Theor. Comput. Sci. 351(3): 425-436 (2006) - [c28]Siamak Tazari, Matthias Müller-Hannemann, Karsten Weihe:
Workload Balancing in Multi-stage Production Processes. WEA 2006: 49-60 - 2005
- [c27]Roland Martin, Karsten Weihe:
Weak Symmetries in Problem Formulations. CP 2005: 858 - 2004
- [j21]Jan M. Hochstein, Karsten Weihe:
Edge-disjoint routing in plane switch graphs in linear time. J. ACM 51(4): 636-670 (2004) - [c26]Matthias Müller-Hannemann, Karsten Weihe:
Moving Policies in Cyclic Assembly-Line Scheduling. IWPEC 2004: 149-161 - 2002
- [c25]Matthias Müller-Hannemann, Mathias Schnee, Karsten Weihe:
Getting Train Timetables into the Main Storage. ATMOS 2002: 8-17 - 2001
- [j20]Karsten Weihe:
A software engineering perspective on algorithmics. ACM Comput. Surv. 33(1): 89-134 (2001) - [c24]Matthias Müller-Hannemann, Karsten Weihe:
Pareto Shortest Paths is Often Feasible in Practice. WAE 2001: 185-198 - 2000
- [j19]Karsten Weihe, Thomas Willhalm:
Reconstructing the Topology of a CAD Model - a Discrete Approach. Algorithmica 26(1): 126-147 (2000) - [j18]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): 1-40 (2000) - [j17]Annegret Liebers, Dorothea Wagner, Karsten Weihe:
On the Hardness of Recognizing Bundles in Time Table Graphs. Int. J. Found. Comput. Sci. 11(3): 467-484 (2000) - [j16]Frank Schulz, Dorothea Wagner, Karsten Weihe:
Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. ACM J. Exp. Algorithmics 5: 12 (2000) - [j15]Dorothea Wagner, Karsten Weihe:
Editorial: Discrete algorithm engineering. Softw. Pract. Exp. 30(11): 1165 (2000) - [c23]Karsten Weihe:
On the Differences between "Practical" and "Applied". WAE 2000: 1-10 - [c22]Annegret Liebers, Karsten Weihe:
Recognizing Bundles in Time Table Graphs - A Structural Approach. WAE 2000: 87-98
1990 – 1999
- 1999
- [j14]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): 91-110 (1999) - [c21]Karsten Weihe, Ulrik Brandes, Annegret Liebers, Matthias Müller-Hannemann, Dorothea Wagner, Thomas Willhalm:
Empirical Design of Geometric Algorithms. SCG 1999: 86-94 - [c20]Karsten Weihe:
Edge-Disjoint Routing in Plane Switch Graphs in Linear Time. FOCS 1999: 330-340 - [c19]Frank Schulz, Dorothea Wagner, Karsten Weihe:
Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. WAE 1999: 110-123 - [c18]Annegret Liebers, Dorothea Wagner, Karsten Weihe:
On the Hardness of Recognizing Bundles in Time Table Graphs. WG 1999: 325-337 - 1998
- [j13]Karsten Weihe:
Laufzeitdynamische Evaluierung tabellarischer Daten. Inform. Forsch. Entwickl. 13(2): 61-71 (1998) - [j12]Dieter Gluche, Dietmar Kühl, Karsten Weihe:
Iterators Evaluate Table Queries (C++ Toolbox). ACM SIGPLAN Notices 33(1): 22-29 (1998) - [c17]Ullrich Köthe, Karsten Weihe:
The STL Model in the Geometric Domain. Generic Programming 1998: 232-248 - [c16]Karsten Weihe, Thomas Willhalm:
Why CAD Data Repair Requires Discrete Algorithmic Techniques. WAE 1998: 1-12 - 1997
- [j11]Karsten Weihe:
Multicommodity Flows in Even, Planar Networks. Algorithmica 18(3): 363-383 (1997) - [j10]Rolf H. Möhring, Matthias Müller-Hannemann, Karsten Weihe:
Mesh refinement via bidirected flows: modeling, complexity, and computational results. J. ACM 44(3): 395-426 (1997) - [j9]Karsten Weihe:
Edge-Disjoint (s, t)-Paths in Undirected Planar Graphs in Linear Time. J. Algorithms 23(1): 121-138 (1997) - [j8]Karsten Weihe:
Maximum (s, t)-Flows in Planar Networks in O(|V|log|V|)-Time. J. Comput. Syst. Sci. 55(3): 454-476 (1997) - [j7]Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe:
The Vertex-Disjoint Menger Problem in Planar Graphs. SIAM J. Comput. 26(2): 331-349 (1997) - [c15]Matthias Müller-Hannemann, Karsten Weihe:
Minimum Strictly Convex Quadrangulations of Convex Polygons. SCG 1997: 193-202 - [c14]Matthias Müller-Hannemann, Karsten Weihe:
Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element Meshes. ESA 1997: 364-377 - [c13]Karsten Weihe, Thomas Willhalm:
Reconstructing the Topology of a CAD Model: A Discrete Approach. ESA 1997: 500-513 - [c12]Karsten Weihe:
Reuse of Algorithms: Still a Challenge to Object-Oriented Programming. OOPSLA 1997: 34-48 - [c11]Dietmar Kühl, Marco Nissen, Karsten Weihe:
Efficient, Adaptable Implementations of Graph Algorithms. WAE 1997: 32-41 - 1996
- [j6]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): 95-110 (1996) - [j5]Annegret Liebers, Dorothea Wagner, Karsten Weihe:
C++ im Nebenfachstudium: Konzepte und Erfahrungen. Inform. Spektrum 19(5): 262-265 (1996) - 1995
- [j4]Dorothea Wagner, Karsten Weihe:
A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs. Comb. 15(1): 135-150 (1995) - [j3]M. Seetharama Gowda, Karsten Weihe:
Book reviews. Math. Methods Oper. Res. 41(2): 250-254 (1995) - [c10]Dorothea Wagner, Karsten Weihe:
An Animated Library of Combinatorial VLSI-Routing Algorithms. SCG 1995: C28-C29 - [c9]Rolf H. Möhring, Matthias Müller-Hannemann, Karsten Weihe:
Using Network Flows for Surface Modeling. SODA 1995: 350-359 - 1994
- [j2]Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe:
Wiring Knock-Knee Layouts: A Global Approach. IEEE Trans. Computers 43(5): 581-589 (1994) - [c8]Karsten Weihe:
Edge-Disjoint (s, t)-Paths on Undirected Planar Graphs in Linear Time. ESA 1994: 130-140 - [c7]Karsten Weihe:
Maximum (s, t)-Flows in Planar Networks in O(|V| log |V|) Time. FOCS 1994: 178-189 - 1993
- [j1]M. Schäffter, Karsten Weihe, Petra Mutzel, Salah E. Elmaghraby:
Book reviews. ZOR Methods Model. Oper. Res. 37(1): 112-117 (1993) - [c6]Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe:
Efficient algorithms for disjoint paths in planar graphs. Combinatorial Optimization 1993: 295-354 - [c5]Dorothea Wagner, Karsten Weihe:
A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs. ESA 1993: 384-395 - [c4]Karsten Weihe:
Multicommodity Flows in Even, Planar Networks. ISAAC 1993: 333-342 - [c3]Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe:
Linear Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs. ISAAC 1993: 343-352 - [c2]Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe:
The Vertex-Disjoint Menger Problem in Planar Graphs. SODA 1993: 112-119 - 1992
- [c1]Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe:
Wiring Knock-Knee Layouts: A Global Appoach. ISAAC 1992: 388-399
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
