The following pages link to Michael Kaufmann (Q344818):
Displaying 24 items.
- Threshold-coloring and unit-cube contact representation of planar graphs (Q344821) (← links)
- On the area requirements of Euclidean minimum spanning trees (Q390122) (← links)
- Bend-optimal orthogonal graph drawing in the general position model (Q390165) (← links)
- Vertex angle and crossing angle resolution of leveled tree drawings (Q456065) (← links)
- A note on maximum differential coloring of planar graphs (Q473207) (← links)
- Colored simultaneous geometric embeddings and universal pointsets (Q548667) (← links)
- Straight-line rectangular drawings of clustered graphs (Q629827) (← links)
- Polynomial area bounds for MST embeddings of trees (Q654291) (← links)
- Planar bus graphs (Q724233) (← links)
- Boundary labeling: Models and efficient algorithms for rectangular maps (Q868108) (← links)
- Fixed parameter algorithms for one-sided crossing minimization revisited (Q935846) (← links)
- Boundary labeling with octilinear leaders (Q970611) (← links)
- Planar packing of trees and spider trees (Q976102) (← links)
- Comparing trees via crossing minimization (Q988574) (← links)
- Two trees which are self-intersecting when drawn simultaneously (Q1011769) (← links)
- Routing in polygons without rectilinearly visible corners (Q1207958) (← links)
- Table cartogram (Q1699289) (← links)
- The book thickness of 1-planar graphs is constant (Q2408921) (← links)
- Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations (Q3104623) (← links)
- Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area (Q4899278) (← links)
- Graph Drawing (Q5711637) (← links)
- Computing cartograms with optimal complexity (Q5891266) (← links)
- Nonplanar Graph Drawings with k Vertices per Face (Q6496544) (← links)
- The Density Formula: One Lemma to Bound Them All (Q6514253) (← links)
