The following pages link to Matthias Müller-Hannemann (Q820153):
Displayed 47 items.
- (Q218115) (redirect page) (← links)
- Moving policies in cyclic assembly line scheduling (Q820155) (← links)
- Improved approximations for minimum cardinality quadrangulations of finite element meshes (Q826106) (← links)
- Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation (Q1028460) (← links)
- Non-approximability of just-in-time scheduling (Q1041346) (← links)
- Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation (Q1602943) (← links)
- Hexahedral mesh generation by successive dual cycle elimination (Q1809119) (← links)
- Complexity and modeling aspects of mesh refinement into quadrilaterals (Q1969949) (← links)
- A near linear time approximation scheme for Steiner tree among obstacles in the plane (Q2269141) (← links)
- A fast search algorithm for \(\langle m,m,m\rangle\) Triple Product Property triples and an application for \(5\times 5\) matrix multiplication (Q2344224) (← links)
- On the cardinality of the Pareto set in bicriteria shortest path problems (Q2379876) (← links)
- Shelling Hexahedral Complexes for Mesh Generation (Q2755059) (← links)
- (Q2764035) (← links)
- The Price of Robustness in Timetable Information (Q2917261) (← links)
- Stochastic Delay Prediction in Large Train Networks (Q2917265) (← links)
- Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected (Q2917326) (← links)
- Paying Less for Train Connections with MOTIS (Q2917415) (← links)
- Uniform Sampling of Digraphs with a Fixed Degree Sequence (Q3057627) (← links)
- How to find good night train connections (Q3076014) (← links)
- Efficient Computation of Time-Dependent Centralities in Air Transportation Networks (Q3078386) (← links)
- Dag Realizations of Directed Degree Sequences (Q3088289) (← links)
- Passenger Flow-Oriented Train Disposition (Q3092232) (← links)
- Uniform sampling of bipartite graphs with degrees in prescribed intervals (Q3388900) (← links)
- A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane (Q3603523) (← links)
- Efficient Timetable Information in the Presence of Delays (Q3649168) (← links)
- (Q4252425) (← links)
- (Q4370208) (← links)
- Mesh refinement via bidirected flows (Q4376977) (← links)
- HIGH QUALITY QUADRILATERAL SURFACE MESHING WITHOUT TEMPLATE RESTRICTIONS: A NEW APPROACH BASED ON NETWORK FLOW TECHNIQUES (Q4682188) (← links)
- QUADRANGULAR REFINEMENTS OF CONVEX POLYGONS WITH AN APPLICATION TO FINITE-ELEMENT MESHES (Q4682202) (← links)
- (Q4785583) (← links)
- (Q4886066) (← links)
- On the discrete core of quadrilateral mesh refinement (Q4951627) (← links)
- Dealing with Large Hidden Constants: Engineering a Planar Steiner Tree PTAS (Q5233571) (← links)
- HARDNESS AND APPROXIMATION OF OCTILINEAR STEINER TREES (Q5297794) (← links)
- A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes (Q5302069) (← links)
- Workload Balancing in Multi-stage Production Processes (Q5307530) (← links)
- Parameterized and Exact Computation (Q5311508) (← links)
- Improving the surface cycle structure for hexahedral mesh generation (Q5361510) (← links)
- Recoverable Robust Timetable Information (Q5397837) (← links)
- Dealing with large hidden constants (Q5406254) (← links)
- A memetic algorithm to schedule planned maintenance for the national grid (Q5463392) (← links)
- Implementing weighted b-matching algorithms (Q5463403) (← links)
- Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles (Q5757889) (← links)
- Algorithms and Computation (Q5897859) (← links)
- Algorithms and Data Structures (Q5900755) (← links)
- A case study in hexahedral mesh generation: Simulation of the human mandible (Q5950343) (← links)