Martin Nöllenburg

From MaRDI portal
Person:334919

Available identifiers

zbMath Open nollenburg.martinDBLP41/4420WikidataQ87730647 ScholiaQ87730647MaRDI QIDQ334919

List of research outcomes





PublicationDate of PublicationType
Computing hive plots: a combinatorial framework2024-11-12Paper
Splitting plane graphs to outerplanarity2024-11-12Paper
Extending orthogonal planar graph drawings is fixed-parameter tractable2024-10-16Paper
Computing hive plots: a combinatorial framework2024-10-14Paper
Minimum link fencing2024-09-11Paper
On families of planar DAGs with constant stack number2024-06-21Paper
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling2024-04-14Paper
Block crossings in one-sided tanglegrams2024-01-16Paper
https://portal.mardi4nfdi.de/entity/Q61475162024-01-15Paper
https://portal.mardi4nfdi.de/entity/Q61793432023-12-16Paper
Splitting plane graphs to outerplanarity2023-11-24Paper
On the complexity of the storyplan problem2023-10-24Paper
On the complexity of the storyplan problem2023-08-16Paper
Planarizing graphs and their drawings by vertex splitting2023-08-16Paper
Multidimensional Manhattan preferences2023-07-26Paper
On computing optimal linear diagrams2023-07-26Paper
Untangling circular drawings: algorithms and complexity2023-06-20Paper
https://portal.mardi4nfdi.de/entity/Q61040752023-06-05Paper
On the upward book thickness problem: combinatorial and complexity results2023-04-27Paper
https://portal.mardi4nfdi.de/entity/Q58744862023-02-07Paper
Parameterized Algorithms for Queue Layouts2022-11-14Paper
https://portal.mardi4nfdi.de/entity/Q50891972022-07-18Paper
Unit disk representations of embedded trees, outerplanar and multi-legged graphs2022-07-01Paper
Layered area-proportional rectangle contact representations2022-07-01Paper
On the upward book thickness problem: combinatorial and complexity results2022-07-01Paper
On Strict (Outer-)Confluent Graphs2022-06-28Paper
Balanced independent and dominating sets on colored interval graphs2022-03-24Paper
Parameterized Algorithms for Queue Layouts2021-12-01Paper
The Turing Test for Graph Drawing Algorithms2021-12-01Paper
Geometric planar networks on bichromatic collinear points2021-11-18Paper
Labeling nonograms: boundary labeling for curve arrangements2021-09-17Paper
On Families of Planar DAGs with Constant Stack Number2021-07-28Paper
Crossing Layout in Non-planar Graph Drawings2021-07-22Paper
Parameterized Algorithms for Book Embedding Problems2020-12-18Paper
On strict (outer-)confluent graphs2020-10-26Paper
Parameterized algorithms for book embedding problems2020-10-26Paper
Mixed linear layouts: complexity, heuristics, and experiments2020-10-26Paper
Computing stable Demers cartograms2020-10-26Paper
Maximizing ink in partial edge drawings of \(k\)-plane graphs2020-10-26Paper
A unified model and algorithms for temporal map labeling2020-10-12Paper
https://portal.mardi4nfdi.de/entity/Q51158212020-08-18Paper
Geometric planar networks on bichromatic points2020-07-21Paper
Placing labels in road maps: algorithms and complexity2020-05-21Paper
https://portal.mardi4nfdi.de/entity/Q52078772020-01-13Paper
Minimizing crossings in constrained two-sided circular graph layouts.2020-01-13Paper
Planar drawings of fixed-mobile bigraphs2019-10-18Paper
Short Plane Supports for Spatial Hypergraphs2019-09-16Paper
Drawing Binary Tanglegrams: An Experimental Evaluation2019-09-11Paper
On Strict (Outer-)Confluent Graphs2019-08-14Paper
Planar and Poly-arc Lombardi Drawings2019-02-27Paper
Planar drawings of fixed-mobile bigraphs2019-02-20Paper
Experimental Evaluation of Book Drawing Algorithms2019-02-20Paper
Planar L-Drawings of Directed Graphs2019-02-20Paper
Lombardi Drawings of Knots and Links2019-02-20Paper
Short plane supports for spatial hypergraphs2019-02-15Paper
Euclidean greedy drawings of trees2017-10-25Paper
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions2017-10-20Paper
Progress on Partial Edge Drawings2017-10-12Paper
Evaluation of Labeling Strategies for Rotating Maps2017-06-16Paper
On self-approaching and increasing-chord drawings of 3-connected planar graphs2017-03-30Paper
Consistent labeling of rotating maps2017-03-30Paper
Adjacency-preserving spatial treemaps2017-03-30Paper
Strict Confluent Drawing2017-03-30Paper
Cover contact graphs2017-03-09Paper
Drawing Large Graphs by Multilevel Maxent-Stress Optimization2017-02-10Paper
On the Readability of Boundary Labeling2017-02-10Paper
Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem2017-02-10Paper
Recognizing Weighted Disk Contact Graphs2017-02-10Paper
On Minimizing Crossings in Storyline Visualizations2017-02-10Paper
Extending convex partial drawings of graphs2016-11-01Paper
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions2016-01-11Paper
Many-to-One Boundary Labeling with Backbones2016-01-07Paper
Label Placement in Road Maps2015-09-21Paper
Mixed Map Labeling2015-09-21Paper
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs2015-01-07Paper
Simultaneous Embeddability of Two Partitions2015-01-07Paper
Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams2014-09-02Paper
Semantic Word Cloud Representations: Hardness and Approximation Algorithms2014-03-31Paper
On \(d\)-regular schematization of embedded paths2014-01-22Paper
Trajectory-Based Dynamic Map Labeling2014-01-14Paper
Drawing Planar Graphs with a Prescribed Inner Face2013-12-20Paper
Many-to-One Boundary Labeling with Backbones2013-12-20Paper
Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings2013-12-20Paper
Strict Confluent Drawing2013-12-20Paper
Euclidean Greedy Drawings of Trees2013-09-17Paper
Edge-weighted contact representations of planar graphs2013-08-13Paper
Optimal 3D Angular Resolution for Low-Degree Graphs2013-04-09Paper
On the Usability of Lombardi Graph Drawings2013-04-03Paper
Drawing Metro Maps Using Bézier Curves2013-04-03Paper
Edge-Weighted Contact Representations of Planar Graphs2013-04-03Paper
Progress on Partial Edge Drawings2013-04-03Paper
Drawing trees with perfect angular resolution and polynomial area2013-03-20Paper
Drawing (complete) binary tanglegrams2012-04-26Paper
Planar and Poly-arc Lombardi Drawings2012-03-09Paper
Lombardi Drawings of Graphs2012-01-12Paper
Consistent Labeling of Rotating Maps2011-08-12Paper
Adjacency-Preserving Spatial Treemaps2011-08-12Paper
On d-Regular Schematization of Embedded Paths2011-02-15Paper
Drawing Trees with Perfect Angular Resolution and Polynomial Area2011-02-11Paper
Optimal 3D Angular Resolution for Low-Degree Graphs2011-02-11Paper
Lombardi Drawings of Graphs2011-02-11Paper
Path Schematization for Route Sketches2010-06-22Paper
Boundary labeling with octilinear leaders2010-05-19Paper
An Improved Algorithm for the Metro-line Crossing Minimization Problem2010-04-27Paper
Algorithms for Multi-Criteria Boundary Labeling2010-02-04Paper
Optimizing active ranges for consistent dynamic map labeling2009-11-16Paper
Consistent digital rays2009-08-27Paper
Drawing (Complete) Binary Tanglegrams2009-03-03Paper
Optimizing active ranges for consistent dynamic map labeling2009-02-12Paper
Consistent digital rays2009-02-12Paper
Boundary Labeling with Octilinear Leaders2008-07-15Paper
Algorithms for Multi-criteria One-Sided Boundary Labeling2008-03-25Paper
Cover Contact Graphs2008-03-25Paper
Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps2007-08-28Paper
Graph Drawing2006-11-13Paper

Research outcomes over time

This page was built for person: Martin Nöllenburg