Matthias Müller-Hannemann
Martin-Luther-Universität Halle-Wittenberg Institut für Informatik
58 papers found
Refreshing results…
Dag Realizations of Directed Degree Sequences.
Download from www.researchgate.netHow to find good night train connections
UploadIn silico fragmentation for computer assisted identification of metabolite mass spectra
Download from link.springer.comPhase Synchronization in Railway Timetables
Download from arxiv.orgUniform Sampling of Digraphs with a Fixed Degree Sequence
UploadNon-approximability of just-in-time scheduling
Download from citeseerx.ist.psu.eduDealing with large hidden constants: Engineering a planar Steiner tree PTAS
Download from epubs.siam.orgMulti-criteria Shortest Paths in Time-Dependent Train Networks
UploadA Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes
UploadEngineering Computational Technology
UploadFinding All Attractive Train Connections by Multi-criteria Pareto Search
UploadA Near Linear Time Approximation Scheme for Steiner Tree among Obstacles in the Plane
Download from www.researchgate.netOn the cardinality of the Pareto set in bicriteria shortest path problems
Download from link.springer.comWorkload Balancing in Multi-stage Production Processes
UploadApproximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles
Download from e-archive.informatik.uni-koeln.deMissing publications? Search for publications with a matching author name.