Karsten Weihe
Karsten Weihe
Verified email at tu-darmstadt.de
Title
Cited by
Cited by
Year
Dijkstra's algorithm on-line: An empirical case study from public railroad transport
F Schulz, D Wagner, K Weihe
Journal of Experimental Algorithmics (JEA) 5, 12-es, 2000
2112000
Pareto shortest paths is often feasible in practice
M Müller-Hannemann, K Weihe
International Workshop on Algorithm Engineering, 185-197, 2001
1082001
Dijkstra’s algorithm on-line: An empirical case study from public railroad transport
F Schulz, D Wagner, K Weihe
International Workshop on Algorithm Engineering, 110-123, 1999
961999
Covering trains by stations or the power of data reduction
K Weihe
Proceedings of Algorithms and Experiments, ALEX, 1-8, 1998
891998
On the cardinality of the Pareto set in bicriteria shortest path problems
M Müller-Hannemann, K Weihe
Annals of Operations Research 147 (1), 269-286, 2006
722006
Maximum (s, t)-flows in planar networks in O (| V| log| V|) time
K Weihe
Journal of Computer and System Sciences 55 (3), 454-475, 1997
621997
A linear-time algorithm for edge-disjoint paths in planar graphs
D Wagner, K Weihe
Combinatorica 15 (1), 135-150, 1995
601995
The vertex-disjoint Menger problem in planar graphs
H Ripphausen-Lipa, D Wagner, K Weihe
SIAM Journal on Computing 26 (2), 331-349, 1997
551997
Efficient algorithms for disjoint paths in planar graphs
HRLD WAGNER, K WEIHE
Combinatorial Optimization: Papers from the DIMACS Special Year 20, 295, 1995
481995
Motifs in co-authorship networks and their relation to the impact of scientific publications
L Krumov, C Fretter, M Müller-Hannemann, K Weihe, MT Hütt
The European Physical Journal B 84 (4), 535-540, 2011
472011
Quantifying semantics using complex network analysis
C Biemann, S Roos, K Weihe
Proceedings of COLING 2012, 263-278, 2012
412012
Reuse of algorithms: Still a challenge to object-oriented programming
K Weihe
Proceedings of the 12th ACM SIGPLAN conference on Object-oriented …, 1997
331997
On the differences between “practical” and “applied”
K Weihe
International Workshop on Algorithm Engineering, 1-10, 2000
242000
Edge-disjoint (s, t)-paths in undirected planar graphs in linear time
K Weihe
Journal of Algorithms 23 (1), 121-138, 1997
241997
Reliability and delay distributions of train connections
MH Keyhani, M Schnee, K Weihe, HP Zorn
12th Workshop on Algorithmic Approaches for Transportation Modelling …, 2012
222012
Maximum s-t-flow with k crossings in O(k3n log n) time
JM Hochstein, K Weihe
Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete …, 2007
222007
Minimum strictly convex quadrangulations of convex polygons
M Müller-Hannemann, K Weihe
Proceedings of the thirteenth annual symposium on Computational geometry …, 1997
221997
A software engineering perspective on algorithmics
K Weihe
ACM Computing Surveys (CSUR) 33 (1), 89-134, 2001
212001
A linear-time algorithm for edge-disjoint paths in planar graphs
D Wagner, K Weihe
European Symposium on Algorithms, 384-395, 1993
211993
Data access templates
D Kühl, K Weihe
201996
The system can't perform the operation now. Try again later.
Articles 1–20