| Publication | Date of Publication | Type |
|---|
| Improved approximations for minimum cardinality quadrangulations of finite element meshes | 2021-12-20 | Paper |
Reconstructing the topology of a CAD model -- a discrete approach
Algorithms — ESA '97 | 2021-12-20 | Paper |
ON THE HARDNESS OF RECOGNIZING BUNDLES IN TIME TABLE GRAPHS
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
| Maximum \(s\)-\(t\)-flow with \(k\) crossings in \(O(k^3 n \log n)\) time | 2014-12-18 | Paper |
Local search starting from an LP solution, fast and quite good
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
| Reliability and delay distributions of train connections | 2012-10-02 | Paper |
Edge-disjoint routing in plane switch graphs in linear time.
Journal of the ACM | 2011-02-01 | Paper |
On the cardinality of the Pareto set in bicriteria shortest path problems
Annals of Operations Research | 2010-03-23 | Paper |
Workload Balancing in Multi-stage Production Processes
Experimental Algorithms | 2007-09-14 | Paper |
Moving policies in cyclic assembly line scheduling
Theoretical Computer Science | 2006-04-06 | Paper |
Parameterized and Exact Computation
Lecture Notes in Computer Science | 2005-08-23 | Paper |
Dijkstra's algorithm on-line
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
QUADRANGULAR REFINEMENTS OF CONVEX POLYGONS WITH AN APPLICATION TO FINITE-ELEMENT MESHES
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
| scientific article; zbMATH DE number 1848402 (Why is no real title available?) | 2003-01-05 | Paper |
| On the discrete core of quadrilateral mesh refinement | 2001-12-12 | Paper |
Reconstructing the topology of a CAD model -- a discrete approach
Algorithmica | 2000-12-05 | Paper |
| scientific article; zbMATH DE number 1420919 (Why is no real title available?) | 2000-07-20 | Paper |
A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works
Discrete Applied Mathematics | 1999-11-23 | Paper |
| scientific article; zbMATH DE number 1354125 (Why is no real title available?) | 1999-10-31 | Paper |
Maximum \((s,t)\)-flows in planar networks in \(\mathcal O(|V| \log |V|)\) time
Journal of Computer and System Sciences | 1998-08-04 | Paper |
Mesh refinement via bidirected flows
Journal of the ACM | 1998-02-17 | Paper |
The Vertex-Disjoint Menger Problem in Planar Graphs
SIAM Journal on Computing | 1997-05-26 | Paper |
Edge-Disjoint (s,t)-Paths in Undirected Planar Graphs in Linear Time
Journal of Algorithms | 1997-04-27 | Paper |
LINEAR-TIME ALGORITHMS FOR DISJOINT TWO-FACE PATHS PROBLEMS IN PLANAR GRAPHS
International Journal of Foundations of Computer Science | 1996-11-26 | Paper |
| scientific article; zbMATH DE number 910891 (Why is no real title available?) | 1996-10-21 | Paper |
A linear-time algorithm for edge-disjoint paths in planar graphs
Combinatorica | 1996-07-14 | Paper |
| scientific article; zbMATH DE number 780786 (Why is no real title available?) | 1996-03-11 | Paper |
| scientific article; zbMATH DE number 833804 (Why is no real title available?) | 1996-01-15 | Paper |
| scientific article; zbMATH DE number 437535 (Why is no real title available?) | 1994-01-02 | Paper |
