The following pages link to Stephen G. Kobourov (Q344819):
Displayed 50 items.
- Improved Approximation Algorithms for Box Contact Representations (Q2921396) (← links)
- Balanced Circle Packings for Planar Graphs (Q2936919) (← links)
- Are Crossings Important for Drawing Large Graphs? (Q2936930) (← links)
- Optimal constrained graph exploration (Q2944522) (← links)
- On Embeddability of Buses in Point Sets (Q2959773) (← links)
- Low Ply Drawings of Trees (Q2961519) (← links)
- Vertex-Coloring with Defects (Q2971395) (← links)
- An Experimental Study on the Ply Number of Straight-Line Drawings (Q2980905) (← links)
- (Q3043714) (← links)
- (Q3043745) (← links)
- On Graphs Supported by Line Sets (Q3073670) (← links)
- Drawing Trees with Perfect Angular Resolution and Polynomial Area (Q3073671) (← links)
- On Touching Triangle Graphs (Q3073677) (← links)
- On Maximum Differential Graph Coloring (Q3073679) (← links)
- Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations (Q3104623) (← links)
- Planar and Poly-arc Lombardi Drawings (Q3223963) (← links)
- Force-Directed Lombardi-Style Graph Drawing (Q3223966) (← links)
- Monotone Drawings of Graphs with Fixed Embedding (Q3223970) (← links)
- Constrained Simultaneous and Near-Simultaneous Embeddings (Q3402370) (← links)
- Contact Graphs of Circular Arcs (Q3449800) (← links)
- Contact Representations of Graphs in 3D (Q3449802) (← links)
- On the Characterization of Level Planar Trees by Minimal Patterns (Q3557872) (← links)
- Characterization of Unlabeled Level Planar Trees (Q3595451) (← links)
- Simultaneous Graph Embedding with Bends and Circular Arcs (Q3595457) (← links)
- Morphing Planar Graphs in Spherical Space (Q3595475) (← links)
- Graph-Drawing Contest Report (Q3595498) (← links)
- Graph Simultaneous Embedding Tool, GraphSET (Q3611850) (← links)
- (Q4252301) (← links)
- GRIP: Graph Drawing with Intelligent Placement (Q4405598) (← links)
- (Q4411377) (← links)
- (Q4427878) (← links)
- (Q4472309) (← links)
- (Q4472310) (← links)
- (Q4474098) (← links)
- (Q4501704) (← links)
- Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs (Q4511264) (← links)
- On the Maximum Crossing Number (Q4600737) (← links)
- An Experimental Study on the Ply Number of Straight-line Drawings (Q4622771) (← links)
- On Vertex- and Empty-Ply Proximity Drawings (Q4625098) (← links)
- Lombardi Drawings of Knots and Links (Q4625105) (← links)
- Revisited Experimental Comparison of Node-Link and Matrix Representations (Q4625118) (← links)
- Drawing Dynamic Graphs Without Timeslices (Q4625131) (← links)
- Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution (Q4679072) (← links)
- Smooth Orthogonal Layouts (Q4912198) (← links)
- On Representing Graphs by Touching Cuboids (Q4912201) (← links)
- Touching Triangle Representations for 3-Connected Planar Graphs (Q4912202) (← links)
- Proportional Contact Representations of 4-Connected Planar Graphs (Q4912203) (← links)
- Planar Preprocessing for Spring Embedders (Q4912220) (← links)
- On the Usability of Lombardi Graph Drawings (Q4912226) (← links)
- Multi-level Steiner Trees (Q4984869) (← links)