The following pages link to Dorothea Wagner (Q306263):
Displaying 50 items.
- Search-space size in contraction hierarchies (Q306264) (← links)
- The density maximization problem in graphs (Q386420) (← links)
- Orthogonal graph drawing with flexibility constraints (Q476441) (← links)
- Computing large matchings in planar graphs with fixed minimum degree (Q553342) (← links)
- Decomposition of k-ary relations (Q751668) (← links)
- A linear time algorithm for the arc disjoint Menger problem in planar directed graphs (extended abstract) (Q826071) (← links)
- The complexity of flow expansion and electrical flow expansion (Q831846) (← links)
- Decomposition of partial orders (Q919013) (← links)
- Augmenting \(k\)-core generation with preferential attachment (Q934209) (← links)
- \(\alpha\)-vertex separator is NP-hard even for 3-regular graphs (Q1179551) (← links)
- A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works (Q1304467) (← links)
- (Q1578387) (redirect page) (← links)
- A linear time algorithm for the arc disjoint Menger problem in planar directed graphs (Q1578388) (← links)
- On the complexity of partial order properties (Q1590180) (← links)
- Local community detection based on small cliques (Q1657050) (← links)
- Time-dependent route planning for truck drivers (Q1691663) (← links)
- On local broadcasting schedules and CONGEST algorithms in the SINR model (Q1796435) (← links)
- A linear-time algorithm for edge-disjoint paths in planar graphs (Q1842575) (← links)
- How to draw the minimum cuts of a planar graph (Q1882854) (← links)
- Wiring edge-disjoint layouts (Q1969598) (← links)
- An axiomatic approach to time-dependent shortest path oracles (Q2118212) (← links)
- Energy-optimal routes for battery electric vehicles (Q2309482) (← links)
- Online dynamic power management with hard real-time guarantees (Q2354765) (← links)
- Completely connected clustered graphs (Q2458931) (← links)
- Experiments on Density-Constrained Graph Clustering (Q2828182) (← links)
- User-Constrained Multimodal Route Planning (Q2828200) (← links)
- On the Complexity of Partitioning Graphs for Arc-Flags (Q2838234) (← links)
- Hierarchies of Predominantly Connected Communities (Q2842174) (← links)
- (Q2847386) (← links)
- (Q2847387) (← links)
- (Q2847388) (← links)
- Intriguingly Simple and Fast Transit Routing (Q2870708) (← links)
- Higher Order City Voronoi Diagrams (Q2904543) (← links)
- Engineering Time-Expanded Graphs for Faster Timetable Information (Q2917364) (← links)
- Station Location - Complexity and Approximation. (Q2917411) (← links)
- (Q2918963) (← links)
- Graph Clustering with Surprise: Complexity and Exact Solutions (Q2938102) (← links)
- Column-Based Graph Layouts (Q2938757) (← links)
- (Q2965486) (← links)
- An Experimental Study on Generating Planar Graphs (Q3004691) (← links)
- (Q3043770) (← links)
- Orthogonal Graph Drawing with Flexibility Constraints (Q3073663) (← links)
- The Density Maximization Problem in Graphs (Q3087936) (← links)
- Algorithm Engineering for Route Planning – An Update – (Q3104592) (← links)
- (Q3140410) (← links)
- The Shortcut Problem - Complexity and Algorithms (Q3143749) (← links)
- Drawing Graphs on Two and Three Lines (Q3378491) (← links)
- Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles (Q3378509) (← links)
- Approximating Clustering Coefficient and Transitivity (Q3378518) (← links)
- Computational Aspects of Lucidity-Driven Graph Clustering (Q3402379) (← links)
