|
Search the dblp DataBase
Karsten Weihe:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Matthias Müller-Hannemann, Karsten Weihe
Minimum Strictly Convex Quadrangulations of Convex Polygons. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1997, pp:193-202 [Conf]
- Dorothea Wagner, Karsten Weihe
An Animated Library of Combinatorial VLSI-Routing Algorithms. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1995, pp:0-0 [Conf]
- Karsten Weihe, Ulrik Brandes, Annegret Liebers, Matthias Müller-Hannemann, Dorothea Wagner, Thomas Willhalm
Empirical Design of Geometric Algorithms. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1999, pp:86-94 [Conf]
- Roland Martin, Karsten Weihe
Weak Symmetries in Problem Formulations. [Citation Graph (0, 0)][DBLP] CP, 2005, pp:858- [Conf]
- Ullrich Köthe, Karsten Weihe
The STL Model in the Geometric Domain. [Citation Graph (0, 0)][DBLP] Generic Programming, 1998, pp:232-248 [Conf]
- Matthias Müller-Hannemann, Karsten Weihe
Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element Meshes. [Citation Graph (0, 0)][DBLP] ESA, 1997, pp:364-377 [Conf]
- Dorothea Wagner, Karsten Weihe
A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs. [Citation Graph (0, 0)][DBLP] ESA, 1993, pp:384-395 [Conf]
- Karsten Weihe
Edge-Disjoint (s, t)-Paths on Undirected Planar Graphs in Linear Time. [Citation Graph (0, 0)][DBLP] ESA, 1994, pp:130-140 [Conf]
- Karsten Weihe, Thomas Willhalm
Reconstructing the Topology of a CAD Model: A Discrete Approach. [Citation Graph (0, 0)][DBLP] ESA, 1997, pp:500-513 [Conf]
- Karsten Weihe
Maximum (s, t)-Flows in Planar Networks in O(|V| log |V|) Time [Citation Graph (0, 0)][DBLP] FOCS, 1994, pp:178-189 [Conf]
- Karsten Weihe
Edge-Disjoint Routing in Plane Switch Graphs in Linear Time. [Citation Graph (0, 0)][DBLP] FOCS, 1999, pp:330-340 [Conf]
- Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
Linear Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs. [Citation Graph (0, 0)][DBLP] ISAAC, 1993, pp:343-352 [Conf]
- Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe
Wiring Knock-Knee Layouts: A Global Appoach. [Citation Graph (0, 0)][DBLP] ISAAC, 1992, pp:388-399 [Conf]
- Karsten Weihe
Multicommodity Flows in Even, Planar Networks. [Citation Graph (0, 0)][DBLP] ISAAC, 1993, pp:333-342 [Conf]
- Matthias Müller-Hannemann, Karsten Weihe
Moving Policies in Cyclic Assembly-Line Scheduling. [Citation Graph (0, 0)][DBLP] IWPEC, 2004, pp:149-161 [Conf]
- Karsten Weihe
Reuse of Algorithms: Still a Challenge to Object-Oriented Programming. [Citation Graph (0, 0)][DBLP] OOPSLA, 1997, pp:34-48 [Conf]
- Rolf H. Möhring, Matthias Müller-Hannemann, Karsten Weihe
Using Network Flows for Surface Modeling. [Citation Graph (0, 0)][DBLP] SODA, 1995, pp:350-359 [Conf]
- Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
The Vertex-Disjoint Menger Problem in Planar Graphs. [Citation Graph (0, 0)][DBLP] SODA, 1993, pp:112-119 [Conf]
- Karsten Weihe
On the Differences between ``Practical'' and ``Applied''. [Citation Graph (0, 0)][DBLP] Algorithm Engineering, 2000, pp:1-10 [Conf]
- Karsten Weihe, Thomas Willhalm
Why CAD Data Repair Requires Discrete Algorithmic Techniques. [Citation Graph (0, 0)][DBLP] Algorithm Engineering, 1998, pp:1-12 [Conf]
- Frank Schulz, Dorothea Wagner, Karsten Weihe
Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. [Citation Graph (0, 0)][DBLP] Algorithm Engineering, 1999, pp:110-123 [Conf]
- Annegret Liebers, Karsten Weihe
Recognizing Bundles in Time Table Graphs - A Structural Approach. [Citation Graph (0, 0)][DBLP] Algorithm Engineering, 2000, pp:87-98 [Conf]
- Matthias Müller-Hannemann, Karsten Weihe
Pareto Shortest Paths is Often Feasible in Practice. [Citation Graph (0, 0)][DBLP] Algorithm Engineering, 2001, pp:185-198 [Conf]
- Siamak Tazari, Matthias Müller-Hannemann, Karsten Weihe
Workload Balancing in Multi-stage Production Processes. [Citation Graph (0, 0)][DBLP] WEA, 2006, pp:49-60 [Conf]
- Annegret Liebers, Dorothea Wagner, Karsten Weihe
On the Hardness of Recognizing Bundles in Time Table Graphs. [Citation Graph (0, 0)][DBLP] WG, 1999, pp:325-337 [Conf]
- Karsten Weihe
Multicommodity Flows in Even, Planar Networks. [Citation Graph (0, 0)][DBLP] Algorithmica, 1997, v:18, n:3, pp:363-383 [Journal]
- Karsten Weihe, Thomas Willhalm
Reconstructing the Topology of a CAD Model - a Discrete Approach. [Citation Graph (0, 0)][DBLP] Algorithmica, 2000, v:26, n:1, pp:126-147 [Journal]
- Dorothea Wagner, Karsten Weihe
A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs. [Citation Graph (0, 0)][DBLP] Combinatorica, 1995, v:15, n:1, pp:135-150 [Journal]
- Karsten Weihe
A software engineering perspective on algorithmics. [Citation Graph (0, 0)][DBLP] ACM Comput. Surv., 2001, v:33, n:1, pp:89-134 [Journal]
- Ulrik Brandes, Wolfram Schlickenrieder, Gabriele Neyer, Dorothea Wagner, Karsten Weihe
A Software Package of Algorithms and Heuristics for Disjoint Paths in Planar Networks. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1999, v:92, n:2-3, pp:91-110 [Journal]
- Matthias Müller-Hannemann, Mathias Schnee, Karsten Weihe
Getting Train Timetables into the Main Storage. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2002, v:66, n:6, pp:- [Journal]
- Karsten Weihe
Laufzeitdynamische Evaluierung tabellarischer Daten. [Citation Graph (0, 0)][DBLP] Inform., Forsch. Entwickl., 1998, v:13, n:2, pp:61-71 [Journal]
- Matthias Müller-Hannemann, Karsten Weihe
Quadrangular Refinements of Convex Polygons with an Application to Finite-Element Meshes. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 2000, v:10, n:1, pp:1-40 [Journal]
- Annegret Liebers, Dorothea Wagner, Karsten Weihe
On the Hardness of Recognizing Bundles in Time Table Graphs. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2000, v:11, n:3, pp:467-484 [Journal]
- Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
Linear-Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 1996, v:7, n:2, pp:95-110 [Journal]
- Annegret Liebers, Dorothea Wagner, Karsten Weihe
C++ im Nebenfachstudium: Konzepte und Erfahrungen. [Citation Graph (0, 0)][DBLP] Informatik Spektrum, 1996, v:19, n:5, pp:262-265 [Journal]
- Jan M. Hochstein, Karsten Weihe
Edge-disjoint routing in plane switch graphs in linear time. [Citation Graph (0, 0)][DBLP] J. ACM, 2004, v:51, n:4, pp:636-670 [Journal]
- Rolf H. Möhring, Matthias Müller-Hannemann, Karsten Weihe
Mesh refinement via bidirected flows: modeling, complexity, and computational results. [Citation Graph (0, 0)][DBLP] J. ACM, 1997, v:44, n:3, pp:395-426 [Journal]
- Karsten Weihe
Edge-Disjoint (s, t)-Paths in Undirected Planar Graphs in Linear Time. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1997, v:23, n:1, pp:121-138 [Journal]
- Karsten Weihe
Maximum (s, t)-Flows in Planar Networks in O(|V|log|V|)-Time. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1997, v:55, n:3, pp:454-476 [Journal]
- Frank Schulz, Dorothea Wagner, Karsten Weihe
Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. [Citation Graph (0, 0)][DBLP] ACM Journal of Experimental Algorithms, 2000, v:5, n:, pp:12- [Journal]
- Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
The Vertex-Disjoint Menger Problem in Planar Graphs. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1997, v:26, n:2, pp:331-349 [Journal]
- Dieter Gluche, Dietmar Kühl, Karsten Weihe
Iterators Evaluate Table Queries (C++ Toolbox). [Citation Graph (0, 0)][DBLP] SIGPLAN Notices, 1998, v:33, n:1, pp:22-29 [Journal]
- Dorothea Wagner, Karsten Weihe
Editorial: Discrete algorithm engineering. [Citation Graph (0, 0)][DBLP] Softw., Pract. Exper., 2000, v:30, n:11, pp:1165- [Journal]
- Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe
Wiring Knock-Knee Layouts: A Global Approach. [Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1994, v:43, n:5, pp:581-589 [Journal]
- Matthias Müller-Hannemann, Karsten Weihe
Moving policies in cyclic assembly line scheduling. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:351, n:3, pp:425-436 [Journal]
- Jan M. Hochstein, Karsten Weihe
Maximum s-t-flow with k crossings in O(k3n log n) time. [Citation Graph (0, 0)][DBLP] SODA, 2007, pp:843-847 [Conf]
Phase Synchronization in Railway Timetables [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.306secs
|