The following pages link to OGDF (Q16289):
Displaying 38 items.
- Multivariate topology simplification (Q340525) (← links)
- Simplifying maximum flow computations: the effect of shrinking and good initial flows (Q411873) (← links)
- Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions (Q975757) (← links)
- Orthogonal layout with optimal face complexity (Q1616241) (← links)
- A Benders decomposition based framework for solving cable trench problems (Q1652230) (← links)
- Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (Q1681305) (← links)
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297) (← links)
- Thinning out Steiner trees: a node-based model for uniform edge costs (Q1699615) (← links)
- Faster force-directed graph drawing with the well-separated pair decomposition (Q1736822) (← links)
- Solving minimum-cost shared arborescence problems (Q1751722) (← links)
- 1-planarity testing and embedding: an experimental study (Q2088879) (← links)
- Star-struck by fixed embeddings: modern crossing number heuristics (Q2151428) (← links)
- Stronger MIP formulations for the Steiner forest problem (Q2227541) (← links)
- A Distributed Multilevel Force-Directed Algorithm (Q2961498) (← links)
- Placing Arrows in Directed Graph Drawings (Q2961503) (← links)
- A Note on the Practicality of Maximal Planar Subgraph Algorithms (Q2961528) (← links)
- Offline Drawing of Dynamic Trees: Algorithmics and Document Integration (Q2961550) (← links)
- An Experimental Study on the Ply Number of Straight-Line Drawings (Q2980905) (← links)
- (Q3102944) (← links)
- An Experimental Study on the Ply Number of Straight-line Drawings (Q4622771) (← links)
- An Interactive Tool to Explore and Improve the Ply Number of Drawings (Q4625099) (← links)
- (Q5009576) (← links)
- Stronger ILPs for the Graph Genus Problem. (Q5075767) (← links)
- (Q5075824) (← links)
- (Q5115821) (← links)
- A survey of graphs with known or bounded crossing numbers (Q5139701) (← links)
- (Q5140734) (← links)
- Node Overlap Removal Algorithms: an Extended Comparative Study (Q5141647) (← links)
- A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width (Q5233133) (← links)
- Aesthetic Discrimination of Graph Layouts (Q5233134) (← links)
- A New Framework for Hierarchical Drawings (Q5233135) (← links)
- How to Draw a Planarization (Q5233140) (← links)
- Algorithms for the Hypergraph and the Minor Crossing Number Problems (Q5246712) (← links)
- (Q5358292) (← links)
- Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics (Q5886037) (← links)
- Upward Planarization Layout (Q5894998) (← links)
