The following pages link to Sergey Pupyrev (Q283870):
Displaying 33 items.
- Edge routing with ordered bundles (Q283873) (← links)
- Threshold-coloring and unit-cube contact representation of planar graphs (Q344821) (← links)
- Improved approximation algorithms for box contact representations (Q521820) (← links)
- Representing Permutations with Few Moves (Q2827490) (← links)
- Weak Unit Disk and Interval Representation of Graphs (Q2827814) (← links)
- Ordering Metro Lines by Block Crossings (Q2849928) (← links)
- Threshold-Coloring and Unit-Cube Contact Representation of Graphs (Q2864287) (← links)
- Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases (Q2867669) (← links)
- Drawing Permutations with Few Corners (Q2867686) (← links)
- 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)
- On Embeddability of Buses in Point Sets (Q2959773) (← links)
- The Bundled Crossing Number (Q2961534) (← links)
- Improving Layered Graph Layouts with Edge Bundling (Q3073683) (← links)
- Edge Routing with Ordered Bundles (Q3223949) (← links)
- Contact Graphs of Circular Arcs (Q3449800) (← links)
- Contact Representations of Graphs in 3D (Q3449802) (← links)
- Colored Non-crossing Euclidean Steiner Forest (Q3459881) (← links)
- Mixed Linear Layouts of Planar Graphs (Q4625112) (← links)
- The Turing Test for Graph Drawing Algorithms (Q5014138) (← links)
- Improved Bounds for Track Numbers of Planar Graphs (Q5119382) (← links)
- Four pages are indeed necessary for planar graphs (Q5120157) (← links)
- Improved Basic Block Reordering (Q5140205) (← links)
- Ordering Metro Lines by Block Crossings (Q5176859) (← links)
- Semantic Word Cloud Representations: Hardness and Approximation Algorithms (Q5405069) (← links)
- MapSets: Visualizing Embedded and Clustered Graphs (Q5892032) (← links)
- MapSets: Visualizing Embedded and Clustered Graphs (Q5899626) (← links)
- (Q6147549) (← links)
- On families of planar DAGs with constant stack number (Q6560144) (← links)
- Approximating the minimum logarithmic arrangement problem (Q6602423) (← links)
- Transforming Stacks into Queues: Mixed and Separated Layouts of Graphs (Q6746156) (← links)
- Forbidden Patterns in Mixed Linear Layouts (Q6758515) (← links)
