The following pages link to Martin Nöllenburg (Q334919):
Displaying 50 items.
- Path Schematization for Route Sketches (Q3569898) (← links)
- Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps (Q3595490) (← links)
- Drawing (Complete) Binary Tanglegrams (Q3611867) (← links)
- Lombardi Drawings of Knots and Links (Q4625105) (← links)
- Experimental Evaluation of Book Drawing Algorithms (Q4625114) (← links)
- Planar L-Drawings of Directed Graphs (Q4625136) (← links)
- Progress on Partial Edge Drawings (Q4912191) (← links)
- Edge-Weighted Contact Representations of Planar Graphs (Q4912204) (← links)
- On the Usability of Lombardi Graph Drawings (Q4912226) (← links)
- Drawing Metro Maps Using Bézier Curves (Q4912228) (← links)
- Optimal 3D Angular Resolution for Low-Degree Graphs (Q4913761) (← links)
- Crossing Layout in Non-planar Graph Drawings (Q5001663) (← links)
- Parameterized Algorithms for Queue Layouts (Q5014103) (← links)
- The Turing Test for Graph Drawing Algorithms (Q5014138) (← links)
- Parameterized Algorithms for Queue Layouts (Q5050001) (← links)
- On Strict (Outer-)Confluent Graphs (Q5084690) (← links)
- (Q5089197) (← links)
- (Q5115821) (← links)
- Parameterized Algorithms for Book Embedding Problems (Q5141644) (← links)
- Adjacency-Preserving Spatial Treemaps (Q5199239) (← links)
- Consistent Labeling of Rotating Maps (Q5199264) (← links)
- Minimizing crossings in constrained two-sided circular graph layouts. (Q5207872) (← links)
- (Q5207877) (← links)
- Short Plane Supports for Spatial Hypergraphs (Q5233132) (← links)
- Drawing Binary Tanglegrams: An Experimental Evaluation (Q5233570) (← links)
- Evaluation of Labeling Strategies for Rotating Maps (Q5266612) (← links)
- Progress on Partial Edge Drawings (Q5367022) (← links)
- Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions (Q5370573) (← links)
- Semantic Word Cloud Representations: Hardness and Approximation Algorithms (Q5405069) (← links)
- Cover Contact Graphs (Q5452221) (← links)
- Algorithms for Multi-criteria One-Sided Boundary Labeling (Q5452228) (← links)
- (Q5874486) (← links)
- Many-to-One Boundary Labeling with Backbones (Q5891360) (← links)
- Lombardi Drawings of Graphs (Q5894096) (← links)
- Lombardi Drawings of Graphs (Q5894484) (← links)
- Consistent digital rays (Q5896958) (← links)
- Graph Drawing (Q5897641) (← links)
- Many-to-One Boundary Labeling with Backbones (Q5899631) (← links)
- Optimizing active ranges for consistent dynamic map labeling (Q5901408) (← links)
- Consistent digital rays (Q5901417) (← links)
- Optimizing active ranges for consistent dynamic map labeling (Q5902232) (← links)
- On the upward book thickness problem: combinatorial and complexity results (Q5918733) (← links)
- On the upward book thickness problem: combinatorial and complexity results (Q5925712) (← links)
- On the complexity of the storyplan problem (Q6078287) (← links)
- Untangling circular drawings: algorithms and complexity (Q6101838) (← links)
- (Q6104075) (← links)
- (Q6147516) (← links)
- Planarizing graphs and their drawings by vertex splitting (Q6172199) (← links)
- On the complexity of the storyplan problem (Q6172205) (← links)
- (Q6179343) (← links)
