The following pages link to Dorothea Wagner (Q306263):
Displaying 50 items.
- Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies (Q4984867) (← links)
- (Q5075748) (← links)
- Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm (Q5075796) (← links)
- Engineering Negative Cycle Canceling for Wind Farm Cabling (Q5075800) (← links)
- Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles (Q5111696) (← links)
- Engineering Top-Down Weight-Balanced Trees (Q5147507) (← links)
- Fast, Exact and Scalable Dynamic Ridesharing (Q5147530) (← links)
- Dynamic graph clustering combining modularity and smoothness (Q5178738) (← links)
- Enumerating and Generating Labeled <i>k</i>-degenerate Graphs (Q5194683) (← links)
- Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees (Q5199255) (← links)
- Density-Constrained Graph Clustering (Q5199283) (← links)
- Connection Scan Accelerated (Q5232497) (← links)
- Analysis and Experimental Evaluation of Time-Dependent Distance Oracles (Q5232533) (← links)
- Engineering Oracles for Time-Dependent Road Networks (Q5232540) (← links)
- I/O-efficient Generation of Massive Graphs Following the LFR Benchmark (Q5232564) (← links)
- A Geometric Heuristic for Rectilinear Crossing Minimization (Q5232732) (← links)
- Engineering Multi-Level Overlay Graphs for Shortest-Path Queries (Q5233472) (← links)
- User-Constrained Multi-Modal Route Planning (Q5233724) (← links)
- ON THE HARDNESS OF RECOGNIZING BUNDLES IN TIME TABLE GRAPHS (Q5249051) (← links)
- Customizable Contraction Hierarchies (Q5266613) (← links)
- (Q5298940) (← links)
- Search-Space Size in Contraction Hierarchies (Q5326553) (← links)
- Optimal Orthogonal Graph Drawing with Convex Bend Costs (Q5326560) (← links)
- Engineering multilevel overlay graphs for shortest-path queries (Q5406192) (← links)
- Engineering planar separator algorithms (Q5406197) (← links)
- Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm (Q5406231) (← links)
- Significance-Driven Graph Clustering (Q5434419) (← links)
- Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks (Q5448783) (← links)
- Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks (Q5448791) (← links)
- Minimizing the Area for Planar Straight-Line Grid Drawings (Q5452224) (← links)
- LunarVis – Analytic Visualizations of Large Graphs (Q5452238) (← links)
- Dijkstra's algorithm on-line (Q5463409) (← links)
- Generating node coordinates for shortest-path computations in transportation networks (Q5463448) (← links)
- Algorithms – ESA 2004 (Q5464633) (← links)
- Algorithms – ESA 2005 (Q5475871) (← links)
- Local Broadcasting with Arbitrary Transmission Power in the SINR Model (Q5496158) (← links)
- Experimental and Efficient Algorithms (Q5710017) (← links)
- Experimental and Efficient Algorithms (Q5710065) (← links)
- Graph Drawing (Q5711636) (← links)
- Geometric containers for efficient shortest-path computation (Q5718630) (← links)
- Space-efficient, fast and exact routing in time-dependent road networks (Q5874554) (← links)
- Generalizing Geometric Graphs (Q5891389) (← links)
- Dynamic Graph Clustering Using Minimum-Cut Trees (Q5894773) (← links)
- Dynamic Graph Clustering Using Minimum-Cut Trees (Q5895108) (← links)
- Generalizing Geometric Graphs (Q5895515) (← links)
- Graph Drawing (Q5896905) (← links)
- Algorithms - ESA 2003 (Q5897292) (← links)
- Graph Drawing (Q5897630) (← links)
- Graph Drawing (Q5897659) (← links)
- Algorithms and Data Structures (Q5900754) (← links)
