The following pages link to Dorothea Wagner (Q306263):
Displaying 50 items.
- Fast Quasi-Threshold Editing (Q3452790) (← links)
- Visualisierung von Verkehrsdaten (Q3465528) (← links)
- Combining speed-up techniques for shortest-path computations (Q3507749) (← links)
- Partitioning graphs to speedup Dijkstra's algorithm (Q3507777) (← links)
- (Q3507780) (← links)
- Efficient models for timetable information in public transportation systems (Q3507787) (← links)
- On Finding Graph Clusterings with Maximum Modularity (Q3508560) (← links)
- Engineering Label-Constrained Shortest-Path Algorithms (Q3511412) (← links)
- Engineering Comparators for Graph Clusterings (Q3511422) (← links)
- Preprocessing Speed-Up Techniques Is Hard (Q3563016) (← links)
- (Q3574263) (← links)
- (Q3574265) (← links)
- (Q3574272) (← links)
- Speed-Up Techniques for Shortest-Path Computations (Q3590919) (← links)
- The Shortcut Problem – Complexity and Approximation (Q3599067) (← links)
- THE CONTINUOUS STOP LOCATION PROBLEM IN PUBLIC TRANSPORTATION NETWORKS (Q3632030) (← links)
- Engineering Route Planning Algorithms (Q3637315) (← links)
- Group-Level Analysis and Visualization of Social Networks (Q3637326) (← links)
- Engineering Time-Expanded Graphs for Faster Timetable Information (Q3649165) (← links)
- Time-Dependent Route Planning (Q3649166) (← links)
- Computing Large Matchings in Planar Graphs with Fixed Minimum Degree (Q3652274) (← links)
- (Q4268438) (← links)
- (Q4280135) (← links)
- (Q4281648) (← links)
- OPTIMAL ROUTING THROUGH DENSE CHANNELS (Q4294715) (← links)
- The Vertex-Disjoint Menger Problem in Planar Graphs (Q4337639) (← links)
- (Q4398381) (← links)
- (Q4422257) (← links)
- (Q4422260) (← links)
- (Q4426362) (← links)
- Additive Tree Spanners (Q4443141) (← links)
- (Q4448750) (← links)
- (Q4472296) (← links)
- (Q4472300) (← links)
- Using Graph Layout to Visualize Train Interconnection Data (Q4511260) (← links)
- Dynamic WWW Structures in 3D (Q4511263) (← links)
- Consumption profiles in route planning for electric vehicles : Theory and applications (Q4580168) (← links)
- (Q4580173) (← links)
- Connection Scan Algorithm (Q4629533) (← links)
- Hierarchical Time-Dependent Oracles (Q4636530) (← links)
- (Q4707785) (← links)
- (Q4801186) (← links)
- (Q4840776) (← links)
- LINEAR-TIME ALGORITHMS FOR DISJOINT TWO-FACE PATHS PROBLEMS IN PLANAR GRAPHS (Q4886310) (← links)
- Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem (Q4909524) (← links)
- Fast and Simple Fully-Dynamic Cut Tree Construction (Q4909526) (← links)
- Column-Based Graph Layouts (Q4912206) (← links)
- An Efficient Generator for Clustered Dynamic Random Networks (Q4916045) (← links)
- (Q4944991) (← links)
- Optimal Orthogonal Graph Drawing with Convex Bend Costs (Q4962610) (← links)
