Michael Kaufmann

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
The Density Formula: One Lemma to Bound Them All
(available as arXiv preprint)
N/APaper
Transforming stacks into queues: mixed and separated layouts of graphs2026-06-24Paper
Rectilinear-upward planarity testing of digraphs
Journal of Computer and System Sciences
2026-03-12Paper
Eliminating crossings in ordered graphs2025-12-02Paper
Drawing graphs with k vertices per face: complexity and algorithms
Theoretical Computer Science
2025-12-02Paper
On the complexity of recognizing k^+-real face graphs2025-10-07Paper
Improving the crossing lemma by characterizing dense 2-planar and 3-planar graphs2025-10-07Paper
On k-planar graphs without short cycles2025-10-07Paper
Monotone arc diagrams with few biarcs2025-10-07Paper
The density formula: one lemma to bound them all2025-10-07Paper
Rectilinear-upward planarity testing of digraphs2025-07-24Paper
Min-k-planar drawings of graphs
Journal of Graph Algorithms and Applications
2024-10-08Paper
Min-\(k\)-planar drawings of graphs2024-06-21Paper
Nonplanar Graph Drawings with k Vertices per Face2024-05-03Paper
Rectilinear Planarity of Partial 2-Trees
Journal of Graph Algorithms and Applications
2023-12-20Paper
k-Planar Placement and Packing of Δ-Regular Caterpillars
International Journal of Foundations of Computer Science
2023-11-16Paper
Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time
Algorithmica
2023-09-27Paper
Rectilinear planarity of partial 2-trees
Lecture Notes in Computer Science
2023-08-16Paper
Beyond the worst-case bisection bound: Fast sorting and ranking on meshes
Lecture Notes in Computer Science
2023-05-08Paper
scientific article; zbMATH DE number 7651192 (Why is no real title available?)2023-02-07Paper
Optimal multi-packet routing on the torus
Algorithm Theory — SWAT '92
2022-12-09Paper
On triangulating planar graphs under the four-connectivity constraint
Algorithm Theory — SWAT '94
2022-12-09Paper
Shorter queues for permutation routing on meshes
Mathematical Foundations of Computer Science 1994
2022-08-18Paper
Area-efficient static and incremental graph drawings2021-12-20Paper
Solving rectilinear Steiner tree problems exactly in theory and practice2021-12-20Paper
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time
Lecture Notes in Computer Science
2021-12-01Paper
On dispersable book embeddings
Theoretical Computer Science
2021-03-09Paper
The QuaSEFE Problem
(available as arXiv preprint)
2019-08-23Paper
On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings
Algorithmica
2019-05-07Paper
On vertex- and empty-ply proximity drawings
Lecture Notes in Computer Science
2019-02-20Paper
An Interactive Tool to Explore and Improve the Ply Number of Drawings
Lecture Notes in Computer Science
2019-02-20Paper
1-fan-bundle-planar drawings of graphs
Lecture Notes in Computer Science
2019-02-20Paper
On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings
Lecture Notes in Computer Science
2019-02-20Paper
On dispersable book embeddings
Lecture Notes in Computer Science
2018-11-22Paper
Small universal point sets for \(k\)-outerplanar graphs
Discrete & Computational Geometry
2018-10-30Paper
The number of crossings in multigraphs with no empty lens
(available as arXiv preprint)
2018-08-30Paper
On Optimal 2- and 3-Planar Graphs
(available as arXiv preprint)
2018-08-13Paper
Planar bus graphs
Algorithmica
2018-07-25Paper
Bounded stub resolution for some maximal 1-planar graphs2018-06-05Paper
1-fan-bundle-planar drawings of graphs
Theoretical Computer Science
2018-04-04Paper
Table cartogram
Computational Geometry
2018-02-19Paper
Progress on partial edge drawings
Journal of Graph Algorithms and Applications
2017-10-12Paper
On the recognition of fan-planar and maximal outer-fan-planar graphs
Algorithmica
2017-10-10Paper
The book thickness of 1-planar graphs is constant
Algorithmica
2017-10-10Paper
The maximum \(k\)-differential coloring problem
Journal of Discrete Algorithms
2017-10-06Paper
Algorithms and Insights for RaceTrack2017-07-17Paper
On the total number of bends for planar octilinear drawings
Journal of Graph Algorithms and Applications
2017-07-13Paper
Vertex-coloring with defects
Journal of Graph Algorithms and Applications
2017-04-05Paper
Low Ply Drawings of Trees
Lecture Notes in Computer Science
2017-02-21Paper
On the density of non-simple 3-planar graphs
Lecture Notes in Computer Science
2017-02-21Paper
The book embedding problem from a SAT-solving perspective
Lecture Notes in Computer Science
2017-02-10Paper
On embeddability of buses in point sets
Lecture Notes in Computer Science
2017-02-10Paper
A universal point set for 2-outerplanar graphs
Lecture Notes in Computer Science
2017-02-10Paper
Threshold-coloring and unit-cube contact representation of planar graphs
Discrete Applied Mathematics
2016-11-24Paper
On the Total Number of Bends for Planar Octilinear Drawings
LATIN 2016: Theoretical Informatics
2016-05-03Paper
Vertex-coloring with star-defects
WALCOM: Algorithms and Computation
2016-05-03Paper
On Contact Graphs with Cubes and Proportional Boxes
Lecture Notes in Computer Science
2016-03-10Paper
Planar octilinear drawings with one bend per edge
Journal of Graph Algorithms and Applications
2016-01-07Paper
Many-to-one boundary labeling with backbones
Journal of Graph Algorithms and Applications
2016-01-07Paper
A new approach to partial MUS enumeration
Lecture Notes in Computer Science
2015-11-20Paper
1-planar graphs have constant book thickness
Lecture Notes in Computer Science
2015-11-19Paper
Contact Graphs of Circular Arcs
Lecture Notes in Computer Science
2015-10-30Paper
Fitting planar graphs on planar maps
Journal of Graph Algorithms and Applications
2015-10-29Paper
Approximating minimum Manhattan networks in higher dimensions
Algorithmica
2015-03-02Paper
On bar \((1, j)\)-visibility graphs (extended abstract)
WALCOM: Algorithms and Computation
2015-02-27Paper
The maximum k-differential coloring problem
Lecture Notes in Computer Science
2015-02-20Paper
Slanted orthogonal drawings: model, algorithms and evaluations
Journal of Graph Algorithms and Applications
2015-01-15Paper
Bar 1-visibility graphs and their relation to other nearly planar graphs
Journal of Graph Algorithms and Applications
2015-01-15Paper
Fitting Planar Graphs on Planar Maps
SOFSEM 2014: Theory and Practice of Computer Science
2015-01-13Paper
On the recognition of fan-planar and maximal outer-fan-planar graphs
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
2015-01-07Paper
Planar octilinear drawings with one bend per edge
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
2015-01-07Paper
A note on maximum differential coloring of planar graphs
Journal of Discrete Algorithms
2014-11-24Paper
Computing cartograms with optimal complexity
Proceedings of the twenty-eighth annual symposium on Computational geometry
2014-08-07Paper
Universal Point Sets for Drawing Planar Graphs with Circular Arcs
Journal of Graph Algorithms and Applications
2014-06-10Paper
On the upward planarity of mixed plane graphs
Journal of Graph Algorithms and Applications
2014-05-22Paper
Smooth Orthogonal Drawings of Planar Graphs
LATIN 2014: Theoretical Informatics
2014-03-31Paper
1-bend orthogonal partial edge drawing
Journal of Graph Algorithms and Applications
2014-03-24Paper
On the area requirements of Euclidean minimum spanning trees
Computational Geometry
2014-01-22Paper
Bend-optimal orthogonal graph drawing in the general position model
Computational Geometry
2014-01-22Paper
On the upward planarity of mixed plane graphs
Graph Drawing
2013-12-20Paper
Slanted orthogonal drawings
Graph Drawing
2013-12-20Paper
Many-to-one boundary labeling with backbones
Graph Drawing
2013-12-20Paper
Threshold-coloring and unit-cube contact representation of graphs
Graph-Theoretic Concepts in Computer Science
2013-12-06Paper
Linear-time algorithms for hole-free rectilinear proportional contact graph representations
Algorithmica
2013-11-11Paper
Computing cartograms with optimal complexity
Discrete & Computational Geometry
2013-11-06Paper
Smooth orthogonal layouts
Journal of Graph Algorithms and Applications
2013-10-29Paper
Table cartograms
Lecture Notes in Computer Science
2013-09-17Paper
Planar packing of binary trees
Lecture Notes in Computer Science
2013-08-12Paper
On the Characterization of Plane Bus Graphs
Lecture Notes in Computer Science
2013-06-07Paper
Approximate proximity drawings
Computational Geometry
2013-04-29Paper
On upward point set embeddability
Computational Geometry
2013-04-29Paper
Progress on partial edge drawings
Graph Drawing
2013-04-03Paper
Smooth orthogonal layouts
Graph Drawing
2013-04-03Paper
Geometric RAC simultaneous drawings of graphs
Journal of Graph Algorithms and Applications
2013-01-07Paper
Large angle crossing drawings of planar graphs in subquadratic area
Lecture Notes in Computer Science
2013-01-07Paper
Proportional Contact Representations of Planar Graphs
Journal of Graph Algorithms and Applications
2012-12-07Paper
Vertex angle and crossing angle resolution of leveled tree drawings
Information Processing Letters
2012-10-23Paper
Geometric RAC Simultaneous Drawings of Graphs
Lecture Notes in Computer Science
2012-09-25Paper
Optimal polygonal representation of planar graphs
Algorithmica
2012-04-26Paper
Small point sets for simply-nested planar graphs
Graph Drawing
2012-03-09Paper
← Previous 100   1   2   Next 100 →


Research outcomes over time


This page was built for person: Michael Kaufmann