Michael Kaufmann

From MaRDI portal
Person:344818

Available identifiers

zbMath Open kaufmann.michaelWikidataQ102254711 ScholiaQ102254711MaRDI QIDQ344818

List of research outcomes

PublicationDate of PublicationType
Rectilinear Planarity of Partial 2-Trees2023-12-20Paper
k-Planar Placement and Packing of Δ-Regular Caterpillars2023-11-16Paper
Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time2023-09-27Paper
Rectilinear planarity of partial 2-trees2023-08-16Paper
Beyond the worst-case bisection bound: Fast sorting and ranking on meshes2023-05-08Paper
https://portal.mardi4nfdi.de/entity/Q58745232023-02-07Paper
Optimal multi-packet routing on the torus2022-12-09Paper
On triangulating planar graphs under the four-connectivity constraint2022-12-09Paper
Shorter queues for permutation routing on meshes2022-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 Time2021-12-01Paper
The QuaSEFE Problem2019-08-23Paper
On Vertex- and Empty-Ply Proximity Drawings2019-02-20Paper
An Interactive Tool to Explore and Improve the Ply Number of Drawings2019-02-20Paper
1-fan-bundle-planar drawings of graphs2019-02-20Paper
Small universal point sets for \(k\)-outerplanar graphs2018-10-30Paper
The number of crossings in multigraphs with no empty lens2018-08-30Paper
https://portal.mardi4nfdi.de/entity/Q45800882018-08-13Paper
Planar bus graphs2018-07-25Paper
Bounded stub resolution for some maximal 1-planar graphs2018-06-05Paper
1-fan-bundle-planar drawings of graphs2018-04-04Paper
Table cartogram2018-02-19Paper
Progress on Partial Edge Drawings2017-10-12Paper
On the recognition of fan-planar and maximal outer-fan-planar graphs2017-10-10Paper
The book thickness of 1-planar graphs is constant2017-10-10Paper
The maximum \(k\)-differential coloring problem2017-10-06Paper
https://portal.mardi4nfdi.de/entity/Q52828042017-07-17Paper
On the Total Number of Bends for Planar Octilinear Drawings2017-07-13Paper
Vertex-Coloring with Defects2017-04-05Paper
Low Ply Drawings of Trees2017-02-21Paper
On the Density of Non-simple 3-Planar Graphs2017-02-21Paper
The Book Embedding Problem from a SAT-Solving Perspective2017-02-10Paper
On Embeddability of Buses in Point Sets2017-02-10Paper
A Universal Point Set for 2-Outerplanar Graphs2017-02-10Paper
Threshold-coloring and unit-cube contact representation of planar graphs2016-11-24Paper
On the Total Number of Bends for Planar Octilinear Drawings2016-05-03Paper
Vertex-Coloring with Star-Defects2016-05-03Paper
On Contact Graphs with Cubes and Proportional Boxes2016-03-10Paper
Planar Octilinear Drawings with One Bend Per Edge2016-01-07Paper
Many-to-One Boundary Labeling with Backbones2016-01-07Paper
A New Approach to Partial MUS Enumeration2015-11-20Paper
The book thickness of 1-planar graphs is constant2015-11-19Paper
Contact Graphs of Circular Arcs2015-10-30Paper
Fitting Planar Graphs on Planar Maps2015-10-29Paper
Approximating minimum Manhattan networks in higher dimensions2015-03-02Paper
On Bar (1,j)-Visibility Graphs2015-02-27Paper
The Maximum k-Differential Coloring Problem2015-02-20Paper
Slanted Orthogonal Drawings: Model, Algorithms and Evaluations2015-01-15Paper
Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs2015-01-15Paper
Fitting Planar Graphs on Planar Maps2015-01-13Paper
Planar Octilinear Drawings with One Bend Per Edge2015-01-07Paper
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs2015-01-07Paper
A note on maximum differential coloring of planar graphs2014-11-24Paper
Computing cartograms with optimal complexity2014-08-07Paper
Universal Point Sets for Drawing Planar Graphs with Circular Arcs2014-06-10Paper
On the Upward Planarity of Mixed Plane Graphs2014-05-22Paper
Smooth Orthogonal Drawings of Planar Graphs2014-03-31Paper
1-Bend Orthogonal Partial Edge Drawing2014-03-24Paper
On the area requirements of Euclidean minimum spanning trees2014-01-22Paper
Bend-optimal orthogonal graph drawing in the general position model2014-01-22Paper
Many-to-One Boundary Labeling with Backbones2013-12-20Paper
On the Upward Planarity of Mixed Plane Graphs2013-12-20Paper
Slanted Orthogonal Drawings2013-12-20Paper
Threshold-Coloring and Unit-Cube Contact Representation of Graphs2013-12-06Paper
Computing cartograms with optimal complexity2013-11-06Paper
Smooth Orthogonal Layouts2013-10-29Paper
Table Cartograms2013-09-17Paper
On the Characterization of Plane Bus Graphs2013-06-07Paper
Approximate proximity drawings2013-04-29Paper
On upward point set embeddability2013-04-29Paper
Progress on Partial Edge Drawings2013-04-03Paper
Smooth Orthogonal Layouts2013-04-03Paper
Geometric RAC Simultaneous Drawings of Graphs2013-01-07Paper
Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area2013-01-07Paper
Proportional Contact Representations of Planar Graphs2012-12-07Paper
Vertex angle and crossing angle resolution of leveled tree drawings2012-10-23Paper
Geometric RAC Simultaneous Drawings of Graphs2012-09-25Paper
Optimal polygonal representation of planar graphs2012-04-26Paper
Proportional Contact Representations of Planar Graphs2012-03-09Paper
Small Point Sets for Simply-Nested Planar Graphs2012-03-09Paper
Approximate Proximity Drawings2012-03-09Paper
Upward Point Set Embeddability for Convex Point Sets Is in P2012-03-09Paper
Combining Problems on RAC Drawings and Simultaneous Graph Drawings2012-03-09Paper
On a Tree and a Path with no Geometric Simultaneous Embedding2012-01-12Paper
Polynomial area bounds for MST embeddings of trees2011-12-28Paper
Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations2011-12-16Paper
Approximating minimum Manhattan networks in higher dimensions2011-09-16Paper
On the Area Requirements of Euclidean Minimum Spanning Trees2011-08-12Paper
Colored simultaneous geometric embeddings and universal pointsets2011-06-30Paper
On the Perspectives Opened by Right Angle Crossing Drawings2011-04-19Paper
Straight-line rectangular drawings of clustered graphs2011-03-10Paper
Combining Traditional Map Labeling with Boundary Labeling2011-02-15Paper
Upward Point-Set Embeddability2011-02-15Paper
Upward Geometric Graph Embeddings into Point Sets2011-02-11Paper
On a Tree and a Path with No Geometric Simultaneous Embedding2011-02-11Paper
Improving Layered Graph Layouts with Edge Bundling2011-02-11Paper
Comparing trees via crossing minimization2010-08-18Paper
Max-tolerance graphs as intersection graphs2010-08-16Paper
Solving cheap graph problems on Meshes2010-06-17Paper
Planar packing of trees and spider trees2010-06-16Paper
Boundary labeling with octilinear leaders2010-05-19Paper
On the Perspectives Opened by Right Angle Crossing Drawings2010-04-27Paper
Optimal polygonal representation of planar graphs2010-04-27Paper
Constrained Simultaneous and Near-Simultaneous Embeddings2010-02-04Paper
On Metro-Line Crossing Minimization2010-02-04Paper
On Map Labeling with Leaders2009-11-12Paper
Straight-Line Rectangular Drawings of Clustered Graphs2009-10-20Paper
Graph Drawing2009-08-11Paper
Modeling and Designing Real–World Networks2009-07-09Paper
Two trees which are self-intersecting when drawn simultaneously2009-04-09Paper
Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem2009-03-03Paper
Subdivision Drawings of Hypergraphs2009-03-03Paper
An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing2009-01-19Paper
Efficient Labeling of Collinear Sites2009-01-19Paper
Packing and Squeezing Subgraphs into Planar Graphs2008-09-17Paper
Fixed parameter algorithms for one-sided crossing minimization revisited2008-08-08Paper
Boundary Labeling with Octilinear Leaders2008-07-15Paper
Computation of Renameable Horn Backdoors2008-05-27Paper
A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors2008-05-27Paper
Multi-stack Boundary Labeling Problems2008-04-17Paper
Polynomial Area Bounds for MST Embeddings of Trees2008-03-25Paper
Line Crossing Minimization on Metro Maps2008-03-25Paper
Constrained Simultaneous and Near-Simultaneous Embeddings2008-03-25Paper
Boundary labeling: Models and efficient algorithms for rectangular maps2007-02-19Paper
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science2006-11-14Paper
Graph Drawing2006-11-13Paper
Graph Drawing2006-11-13Paper
Graph Drawing2005-12-07Paper
Graph Drawing2005-12-07Paper
DESIGNING PARALLEL ALGORITHMS FOR HIERARCHICAL SMP CLUSTERS2005-10-19Paper
https://portal.mardi4nfdi.de/entity/Q47373412004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q30437112004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q30437612004-08-06Paper
An Approach for Mixed Upward Planarization2003-11-30Paper
https://portal.mardi4nfdi.de/entity/Q44222572003-09-03Paper
https://portal.mardi4nfdi.de/entity/Q44222582003-09-03Paper
https://portal.mardi4nfdi.de/entity/Q44101242003-07-02Paper
https://portal.mardi4nfdi.de/entity/Q47785692002-11-18Paper
Embedding Vertices at Points: Few Bends Suffice for Planar Graphs2002-07-25Paper
https://portal.mardi4nfdi.de/entity/Q45017022001-01-29Paper
https://portal.mardi4nfdi.de/entity/Q45257202001-01-24Paper
https://portal.mardi4nfdi.de/entity/Q45257222001-01-24Paper
On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results2000-12-12Paper
https://portal.mardi4nfdi.de/entity/Q49525922000-05-10Paper
https://portal.mardi4nfdi.de/entity/Q49426492000-03-16Paper
https://portal.mardi4nfdi.de/entity/Q42327831999-03-15Paper
On triangulating planar graphs under the four-connectivity constraint1998-10-11Paper
https://portal.mardi4nfdi.de/entity/Q43429081997-10-16Paper
Deterministic Permutation Routing on Meshes1997-10-13Paper
https://portal.mardi4nfdi.de/entity/Q31289301997-10-05Paper
Faster approximation algorithms for the rectilinear Steiner tree problem1997-07-28Paper
Randomized multipacket routing and sorting on meshes1997-06-30Paper
On local routing of two-terminal nets1995-02-07Paper
Channel routing of multiterminal nets1994-11-20Paper
Drawing Graphs in the Plane with High Resolution1994-10-10Paper
A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs1994-05-10Paper
Routing in polygons without rectilinearly visible corners1993-05-16Paper
Parity conditions in homotopic knock-knee routing1993-04-01Paper
https://portal.mardi4nfdi.de/entity/Q40281191993-03-28Paper
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures1993-01-17Paper
https://portal.mardi4nfdi.de/entity/Q32101991990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38133391988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37774751987-01-01Paper
Routing through a generalized switchbox1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37079231985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36883231984-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Michael Kaufmann