The following pages link to Stephen G. Kobourov (Q344819):
Displaying 50 items.
- Threshold-coloring and unit-cube contact representation of planar graphs (Q344821) (← links)
- (Q473205) (redirect page) (← links)
- A note on maximum differential coloring of planar graphs (Q473207) (← links)
- (Q521818) (redirect page) (← links)
- Improved approximation algorithms for box contact representations (Q521820) (← links)
- Colored simultaneous geometric embeddings and universal pointsets (Q548667) (← links)
- Packing trees into 1-planar graphs (Q782163) (← links)
- On simultaneous planar graph embeddings (Q857060) (← links)
- Characterization of unlabeled level planar trees (Q924090) (← links)
- Simultaneous graph embedding with bends and circular arcs (Q955231) (← links)
- Upward straight-line embeddings of directed graphs into point sets (Q1037786) (← links)
- Orthogonal layout with optimal face complexity (Q1616241) (← links)
- On the maximum crossing number (Q1642684) (← links)
- Table cartogram (Q1699289) (← links)
- Turning cliques into paths to achieve planarity (Q1725735) (← links)
- Perception of symmetries in drawings of graphs (Q1725778) (← links)
- Same stats, different graphs (graph statistics and why we need graph drawings) (Q1725782) (← links)
- On the planar split thickness of graphs (Q1742373) (← links)
- Approximating the generalized minimum Manhattan network problem (Q1751089) (← links)
- Simultaneous embedding of a planar graph and its dual on the grid (Q1780846) (← links)
- Planarity-preserving clustering and embedding for large planar graphs (Q1869744) (← links)
- Tight bounds on maximal and maximum matchings (Q1877645) (← links)
- A multi-dimensional approach to force-directed layouts of large graphs (Q1883577) (← links)
- Drawing trees with perfect angular resolution and polynomial area (Q1943652) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Weighted additive spanners (Q2110643) (← links)
- Visualizing JIT compiler graphs (Q2151438) (← links)
- Computing stable Demers cartograms (Q2206829) (← links)
- Stress-Plus-X (SPX) graph layout (Q2206862) (← links)
- Symmetry detection and classification in drawings of graphs (Q2206881) (← links)
- Approximating minimum Manhattan networks in higher dimensions (Q2258071) (← links)
- Monotone drawings of graphs with fixed embedding (Q2346955) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- The maximum \(k\)-differential coloring problem (Q2407949) (← links)
- Optimal polygonal representation of planar graphs (Q2429359) (← links)
- Computing homotopic shortest paths efficiently (Q2432731) (← links)
- On additive spanners in weighted graphs with local error (Q2672448) (← links)
- Approximation algorithms for priority Steiner tree problems (Q2695278) (← links)
- Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees (Q2709802) (← links)
- (Q2768385) (← links)
- On Contact Graphs with Cubes and Proportional Boxes (Q2794349) (← links)
- Orthogonal Layout with Optimal Face Complexity (Q2794350) (← links)
- Weak Unit Disk and Interval Representation of Graphs (Q2827814) (← links)
- Table Cartograms (Q2849333) (← links)
- Smooth Orthogonal Layouts (Q2856479) (← links)
- Threshold-Coloring and Unit-Cube Contact Representation of Graphs (Q2864287) (← links)
- Equilateral L-Contact Graphs (Q2864297) (← links)
- Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs (Q2867646) (← links)
- Embedding, Clustering and Coloring for Dynamic Maps (Q2871225) (← links)
- Approximating the Generalized Minimum Manhattan Network Problem (Q2872136) (← links)
