OGDF

swMATH4102MaRDI QIDQ16289FDOQ16289

Author name not available (Why is that?)

Cited In (38)

• A branch-and-cut approach to the crossing number problem
• A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions
• A new framework for hierarchical drawings
• Simplifying maximum flow computations: the effect of shrinking and good initial flows
• Orthogonal layout with optimal face complexity
• Faster force-directed graph drawing with the well-separated pair decomposition
• Stronger MIP formulations for the Steiner forest problem
• A note on the practicality of maximal planar subgraph algorithms
• Exact algorithms for the maximum planar subgraph problem: new models and experiments
• A distributed multilevel force-directed algorithm
• Placing arrows in directed graph drawings
• A Benders decomposition based framework for solving cable trench problems
• Solving minimum-cost shared arborescence problems
• Title not available (Why is that?)
• Partitioning planar graphs: a fast combinatorial approach for max-cut
• An experimental study on the ply number of straight-line drawings
• A flow formulation for horizontal coordinate assignment with prescribed width
• Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
• How to draw a planarization
• An Interactive Tool to Explore and Improve the Ply Number of Drawings
• Star-struck by fixed embeddings: modern crossing number heuristics
• An experimental study on the ply number of straight-line drawings
• Handbook of graph drawing and visualization
• Hypergraph and minor crossing number problems
• Node overlap removal algorithms: an extended comparative study
• Multivariate topology simplification
• Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems
• Stronger ILPs for the Graph Genus Problem.
• Upward planarization layout
• Aesthetic Discrimination of Graph Layouts
• Title not available (Why is that?)
• Cycles to the rescue! Novel constraints to compute maximum planar subgraphs fast
• Title not available (Why is that?)
• Offline drawing of dynamic trees: algorithmics and document integration
• A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
• 1-planarity testing and embedding: an experimental study
• Thinning out Steiner trees: a node-based model for uniform edge costs
• A survey of graphs with known or bounded crossing numbers

This page was built for software: OGDF