The following pages link to Martin Nöllenburg (Q334919):
Displayed 50 items.
- Extending convex partial drawings of graphs (Q334920) (← links)
- On \(d\)-regular schematization of embedded paths (Q390156) (← links)
- Geometric planar networks on bichromatic points (Q779176) (← links)
- Balanced independent and dominating sets on colored interval graphs (Q831789) (← links)
- Boundary labeling with octilinear leaders (Q970611) (← links)
- Short plane supports for spatial hypergraphs (Q1725733) (← links)
- Drawing trees with perfect angular resolution and polynomial area (Q1943652) (← links)
- A unified model and algorithms for temporal map labeling (Q2006937) (← links)
- Unit disk representations of embedded trees, outerplanar and multi-legged graphs (Q2151453) (← links)
- Layered area-proportional rectangle contact representations (Q2151456) (← links)
- Placing labels in road maps: algorithms and complexity (Q2182092) (← links)
- Computing stable Demers cartograms (Q2206829) (← links)
- On strict (outer-)confluent graphs (Q2206846) (← links)
- Maximizing ink in partial edge drawings of \(k\)-plane graphs (Q2206865) (← links)
- Parameterized algorithms for book embedding problems (Q2206870) (← links)
- Mixed linear layouts: complexity, heuristics, and experiments (Q2206878) (← links)
- Labeling nonograms: boundary labeling for curve arrangements (Q2230415) (← links)
- Planar drawings of fixed-mobile bigraphs (Q2330125) (← links)
- Euclidean greedy drawings of trees (Q2411820) (← links)
- Drawing (complete) binary tanglegrams (Q2428677) (← links)
- Geometric planar networks on bichromatic collinear points (Q2664940) (← links)
- Edge-weighted contact representations of planar graphs (Q2842200) (← links)
- Euclidean Greedy Drawings of Trees (Q2849364) (← links)
- Drawing Planar Graphs with a Prescribed Inner Face (Q2867668) (← links)
- Strict Confluent Drawing (Q2867672) (← links)
- Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings (Q2867684) (← links)
- Trajectory-Based Dynamic Map Labeling (Q2872105) (← links)
- Simultaneous Embeddability of Two Partitions (Q2936915) (← links)
- On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs (Q2936956) (← links)
- Label Placement in Road Maps (Q2947022) (← links)
- Mixed Map Labeling (Q2947031) (← links)
- Drawing Large Graphs by Multilevel Maxent-Stress Optimization (Q2959740) (← links)
- On Minimizing Crossings in Storyline Visualizations (Q2959756) (← links)
- Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem (Q2959760) (← links)
- Recognizing Weighted Disk Contact Graphs (Q2959776) (← links)
- On the Readability of Boundary Labeling (Q2959785) (← links)
- Cover contact graphs (Q2968088) (← links)
- Strict Confluent Drawing (Q2970442) (← links)
- On self-approaching and increasing-chord drawings of 3-connected planar graphs (Q2970443) (← links)
- Adjacency-preserving spatial treemaps (Q2970446) (← links)
- Consistent labeling of rotating maps (Q2970455) (← links)
- Drawing Trees with Perfect Angular Resolution and Polynomial Area (Q3073671) (← links)
- Optimal 3D Angular Resolution for Low-Degree Graphs (Q3073673) (← links)
- On d-Regular Schematization of Embedded Paths (Q3075524) (← links)
- Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams (Q3188901) (← links)
- Planar and Poly-arc Lombardi Drawings (Q3223963) (← links)
- Algorithms for Multi-Criteria Boundary Labeling (Q3402364) (← links)
- Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions (Q3459901) (← links)
- Boundary Labeling with Octilinear Leaders (Q3512462) (← links)
- An Improved Algorithm for the Metro-line Crossing Minimization Problem (Q3557894) (← links)