The following pages link to Vida Dujmović (Q390138):
Displaying 50 items.
- Track Layout Is Hard (Q2961541) (← links)
- Stack and Queue Layouts via Layered Separators (Q2961542) (← links)
- (Q3043700) (← links)
- Coverage with k-Transmitters in the Presence of Obstacles (Q3066439) (← links)
- On Graphs Supported by Line Sets (Q3073670) (← links)
- Common Unfoldings of Polyominoes and Polycubes (Q3098067) (← links)
- Entropy, triangulation, and point location in planar subdivisions (Q3189070) (← links)
- On Point-Sets That Support Planar Graphs (Q3223944) (← links)
- Empty Pentagons in Point Sets with Collinearities (Q3453574) (← links)
- Layouts of Expander Graphs (Q3466402) (← links)
- A Characterization of the degree sequences of 2-trees (Q3522846) (← links)
- Layered Working-Set Trees (Q3557060) (← links)
- An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times (Q3569877) (← links)
- (Q3579416) (← links)
- Improved upper bounds on the crossing number (Q3602937) (← links)
- (Q4422261) (← links)
- (Q4422268) (← links)
- (Q4427858) (← links)
- The Expected Number of 3D Visibility Events Is Linear (Q4441895) (← links)
- Corrigendum: Orthogonal Tree Decompositions of Graphs (Q4562318) (← links)
- EPG-representations with Small Grid-Size (Q4625111) (← links)
- Drawing planar graphs with many collinear vertices (Q4626290) (← links)
- Thickness and Antithickness of Graphs (Q4626298) (← links)
- (Q4633858) (← links)
- Orthogonal Tree Decompositions of Graphs (Q4634649) (← links)
- (Q4657578) (← links)
- (Q4667610) (← links)
- (Q4667621) (← links)
- (Q4796197) (← links)
- An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains (Q4899045) (← links)
- Meshes Preserving Minimum Feature Size (Q4899286) (← links)
- (Q5002693) (← links)
- Adjacency Labelling for Planar Graphs (and Beyond) (Q5056430) (← links)
- Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers (Q5075735) (← links)
- (Q5088959) (← links)
- Planar graphs have bounded nonrepetitive chromatic number (Q5126756) (← links)
- Minor-Closed Graph Classes with Bounded Layered Pathwidth (Q5130575) (← links)
- Face flips in origami tessellations (Q5132647) (← links)
- Planar Graphs Have Bounded Queue-Number (Q5133977) (← links)
- Two Results on Layered Pathwidth and Linear Layouts (Q5144880) (← links)
- Graph Drawing (Q5193181) (← links)
- Pole Dancing: 3D Morphs for Tree Drawings (Q5233136) (← links)
- Notes on growing a tree in a graph (Q5242878) (← links)
- GHOST CHIMNEYS (Q5299998) (← links)
- PROXIMITY GRAPHS: E, δ, Δ, χ AND ω (Q5300005) (← links)
- A Polynomial Bound for Untangling Geometric Planar Graphs (Q5301009) (← links)
- Layout of Graphs with Bounded Tree-Width (Q5317164) (← links)
- Structure of Graphs with Locally Restricted Crossings (Q5346557) (← links)
- The number of lines tangent to arbitrary convex polyhedra in 3D (Q5361653) (← links)
- Compatible Connectivity-Augmentation of Planar Disconnected Graphs (Q5363015) (← links)