| Publication | Date of Publication | Type |
|---|
Robustness as a third-dimension for evaluating public transport plans
| 2024-08-27 | Paper |
Vehicle capacity-aware rerouting of passengers in delay management
| 2024-08-22 | Paper |
Towards improved robustness of public transport by a machine-learned oracle
| 2024-08-13 | Paper |
Robustness tests for public transport planning
| 2024-07-11 | Paper |
Passenger-aware real-time planning of short turns to reduce delays in public transport
| 2024-07-10 | Paper |
Improved approximations for minimum cardinality quadrangulations of finite element meshes
| 2021-12-20 | Paper |
Uniform sampling of bipartite graphs with degrees in prescribed intervals
Journal of Complex Networks | 2021-05-07 | Paper |
Dealing with large hidden constants: engineering a planar Steiner tree PTAS
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Improving the surface cycle structure for hexahedral mesh generation
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
A fast search algorithm for \(\langle m,m,m\rangle\) Triple Product Property triples and an application for \(5\times 5\) matrix multiplication
Groups - Complexity - Cryptology | 2015-05-12 | Paper |
Dealing with large hidden constants, engineering a planar Steiner tree PTAS
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Recoverable robust timetable information
| 2014-02-24 | Paper |
The price of robustness in timetable information
| 2012-09-28 | Paper |
Paying less for train connections with MOTIS
| 2012-09-28 | Paper |
Accelerating time-dependent multi-criteria timetable information is harder than expected
| 2012-09-28 | Paper |
Stochastic delay prediction in large train networks
| 2012-09-28 | Paper |
Passenger flow-oriented train disposition
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Dag realizations of directed degree sequences
Fundamentals of Computation Theory | 2011-08-19 | Paper |
Efficient computation of time-dependent centralities in air transportation networks
WALCOM: Algorithms and Computation | 2011-02-20 | Paper |
How to find good night train connections
Networks | 2011-02-17 | Paper |
Uniform sampling of digraphs with a fixed degree sequence
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Approximation of rectilinear Steiner trees with length restrictions on obstacles.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
On the cardinality of the Pareto set in bicriteria shortest path problems
Annals of Operations Research | 2010-03-23 | Paper |
A near linear time approximation scheme for Steiner tree among obstacles in the plane
Computational Geometry | 2010-03-16 | Paper |
Efficient Timetable Information in the Presence of Delays
Robust and Online Large-Scale Optimization | 2009-12-03 | Paper |
Non-approximability of just-in-time scheduling
Journal of Scheduling | 2009-12-02 | Paper |
Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation
Discrete Applied Mathematics | 2009-06-30 | Paper |
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane
Lecture Notes in Computer Science | 2009-02-17 | Paper |
A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
Workload Balancing in Multi-stage Production Processes
Experimental Algorithms | 2007-09-14 | Paper |
Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
HARDNESS AND APPROXIMATION OF OCTILINEAR STEINER TREES
International Journal of Computational Geometry & Applications | 2007-07-13 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-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 |
A memetic algorithm to schedule planned maintenance for the national grid
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
Implementing weighted b-matching algorithms
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 |
HIGH QUALITY QUADRILATERAL SURFACE MESHING WITHOUT TEMPLATE RESTRICTIONS: A NEW APPROACH BASED ON NETWORK FLOW TECHNIQUES
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 |
Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation
Computational Geometry | 2002-06-24 | Paper |
scientific article; zbMATH DE number 1693469 (Why is no real title available?)
| 2002-01-22 | Paper |
Shelling hexahedral complexes for mesh generation
Journal of Graph Algorithms and Applications | 2002-01-07 | Paper |
On the discrete core of quadrilateral mesh refinement
| 2001-12-12 | Paper |
A case study in hexahedral mesh generation: Simulation of the human mandible
Engineering with Computers | 2001-12-10 | Paper |
Hexahedral mesh generation by successive dual cycle elimination
Engineering with Computers | 2001-04-10 | Paper |
Complexity and modeling aspects of mesh refinement into quadrilaterals
Algorithmica | 2000-12-05 | Paper |
scientific article; zbMATH DE number 1305533 (Why is no real title available?)
| 1999-01-01 | Paper |
scientific article; zbMATH DE number 1104335 (Why is no real title available?)
| 1998-06-04 | Paper |
Mesh refinement via bidirected flows
Journal of the ACM | 1998-02-17 | Paper |
scientific article; zbMATH DE number 910891 (Why is no real title available?)
| 1996-10-21 | Paper |
