The following pages link to Michael Kaufmann (Q344818):
Displaying 50 items.
- Threshold-coloring and unit-cube contact representation of planar graphs (Q344821) (← links)
- Linear-time algorithms for hole-free rectilinear proportional contact graph representations (Q378246) (← 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)
- (Q592898) (redirect page) (← links)
- Straight-line rectangular drawings of clustered graphs (Q629827) (← links)
- Polynomial area bounds for MST embeddings of trees (Q654291) (← links)
- Randomized multipacket routing and sorting on meshes (Q675295) (← links)
- Planar bus graphs (Q724233) (← links)
- Area-efficient static and incremental graph drawings (Q826069) (← links)
- Solving rectilinear Steiner tree problems exactly in theory and practice (Q826086) (← 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)
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figures (Q1201745) (← links)
- Parity conditions in homotopic knock-knee routing (Q1207328) (← links)
- Routing in polygons without rectilinearly visible corners (Q1207958) (← links)
- On local routing of two-terminal nets (Q1210582) (← links)
- Faster approximation algorithms for the rectilinear Steiner tree problem (Q1361816) (← links)
- On triangulating planar graphs under the four-connectivity constraint (Q1386769) (← links)
- Table cartogram (Q1699289) (← links)
- 1-fan-bundle-planar drawings of graphs (Q1708027) (← links)
- Approximate proximity drawings (Q1947972) (← links)
- On upward point set embeddability (Q1947995) (← links)
- On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results (Q1969944) (← links)
- Small universal point sets for \(k\)-outerplanar graphs (Q1991093) (← links)
- Approximating minimum Manhattan networks in higher dimensions (Q2258071) (← links)
- The maximum \(k\)-differential coloring problem (Q2407949) (← links)
- On the recognition of fan-planar and maximal outer-fan-planar graphs (Q2408919) (← links)
- The book thickness of 1-planar graphs is constant (Q2408921) (← links)
- Optimal polygonal representation of planar graphs (Q2429359) (← links)
- Bounded stub resolution for some maximal 1-planar graphs (Q2636565) (← links)
- On Contact Graphs with Cubes and Proportional Boxes (Q2794349) (← links)
- On the Total Number of Bends for Planar Octilinear Drawings (Q2802935) (← links)
- Vertex-Coloring with Star-Defects (Q2803807) (← links)
- Planar Packing of Binary Trees (Q2842173) (← links)
- Table Cartograms (Q2849333) (← links)
- Smooth orthogonal layouts (Q2856479) (← links)
- Threshold-Coloring and Unit-Cube Contact Representation of Graphs (Q2864287) (← links)
- On the Upward Planarity of Mixed Plane Graphs (Q2867638) (← links)
- Slanted Orthogonal Drawings (Q2867679) (← links)
- Geometric RAC Simultaneous Drawings of Graphs (Q2914333) (← links)
- On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs (Q2936926) (← links)
- Slanted Orthogonal Drawings: Model, Algorithms and Evaluations (Q2938746) (← links)
