The following pages link to Vida Dujmović (Q390138):
Displaying 50 items.
- Triangulating and guarding realistic polygons (Q390140) (← links)
- Crossings in grid drawings (Q405129) (← links)
- Memoryless routing in convex subdivisions: random walks are optimal (Q419369) (← links)
- An affine invariant \(k\)-nearest neighbor regression estimate (Q450849) (← links)
- Graph layouts via layered separators (Q473100) (← links)
- (Q524187) (redirect page) (← links)
- Nonrepetitive colouring via entropy compression (Q524188) (← links)
- On the maximum number of cliques in a graph embedded in a surface (Q648982) (← links)
- Every large point set contains many collinear points or an empty pentagon (Q659671) (← links)
- More Turán-type theorems for triangles in convex point sets (Q668054) (← links)
- Fast local searches and updates in bounded universes (Q691776) (← links)
- A note on the perimeter of fat objects (Q709064) (← links)
- On point-sets that support planar graphs (Q714901) (← links)
- Compatible connectivity augmentation of planar disconnected graphs (Q894688) (← links)
- Fixed parameter algorithms for one-sided crossing minimization revisited (Q935846) (← links)
- On the parameterized complexity of layered graph drawing (Q958215) (← links)
- (Q1010835) (redirect page) (← links)
- Distinct distances in graph drawings (Q1010836) (← links)
- A polynomial bound for untangling geometric planar graphs (Q1042452) (← links)
- Anagram-free chromatic number is not pathwidth-bounded (Q1627156) (← links)
- Pole dancing: 3D morphs for tree drawings (Q1725773) (← links)
- Track layouts, layered path decompositions, and leveled planarity (Q1739109) (← links)
- Flipturning Polygons (Q1864190) (← links)
- A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation (Q1882474) (← links)
- A center transversal theorem for hyperplanes and applications to graph drawing (Q1942307) (← links)
- Coverage with \(k\)-transmitters in the presence of obstacles (Q1944388) (← links)
- Nonrepetitive colourings of planar graphs with \(O(\log n)\) colours (Q1953438) (← links)
- Every collinear set in a planar graph is free (Q2022612) (← links)
- Geodesic obstacle representation of graphs (Q2096390) (← links)
- Stack-number is not bounded by queue-number (Q2151179) (← links)
- \(2\times n\) grids have unbounded anagram-free chromatic number (Q2170797) (← links)
- Average stretch factor: how low does it go? (Q2340408) (← links)
- Graph treewidth and geometric thickness parameters (Q2369933) (← links)
- Graph drawings with few slopes (Q2385698) (← links)
- Drawings of planar graphs with few slopes and segments (Q2385699) (← links)
- Local routing in spanners based on WSPDs (Q2405287) (← links)
- Layered separators in minor-closed graph classes with applications (Q2407382) (← links)
- New bounds for facial nonrepetitive colouring (Q2409520) (← links)
- Biased range trees (Q2428657) (← links)
- Layered working-set trees (Q2429341) (← links)
- A fixed-parameter approach to 2-layer planarization (Q2498928) (← links)
- Upward three-dimensional grid drawings of graphs (Q2503149) (← links)
- On obstacle numbers (Q2517647) (← links)
- Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers (Q2663707) (← links)
- Dual circumference and collinear sets (Q2679595) (← links)
- (Q2768382) (← links)
- Robust Geometric Spanners (Q2862209) (← links)
- (Q2941395) (← links)
- Genus, Treewidth, and Local Crossing Number (Q2959745) (← links)
- Drawing Planar Graphs with Many Collinear Vertices (Q2961512) (← links)