Vida Dujmovic

According to our database1, Vida Dujmovic authored at least 113 papers between 1999 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Notes on growing a tree in a graph.
Random Struct. Algorithms, 2019

Pole Dancing: 3D Morphs for Tree Drawings.
J. Graph Algorithms Appl., 2019

Face flips in origami tessellations.
CoRR, 2019

The structure of k-planar graphs.
CoRR, 2019

Planar graphs have bounded nonrepetitive chromatic number.
CoRR, 2019

Queue Layouts of Graphs with Bounded Degree and Bounded Genus.
CoRR, 2019

Track Layouts, Layered Path Decompositions, and Leveled Planarity.
Algorithmica, 2019

Every Collinear Set in a Planar Graph Is Free.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Planar Graphs have Bounded Queue-Number.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Dual Circumference and Collinear Sets.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
Corrigendum: Orthogonal Tree Decompositions of Graphs.
SIAM J. Discrete Math., 2018

Orthogonal Tree Decompositions of Graphs.
SIAM J. Discrete Math., 2018

Drawing planar graphs with many collinear vertices.
JoCG, 2018

Thickness and antithickness of graphs.
JoCG, 2018

Stack and Queue Layouts via Layered Separators.
J. Graph Algorithms Appl., 2018

Near-Optimal O(k)-Robust Geometric Spanners.
CoRR, 2018

Minor-closed graph classes with bounded layered pathwidth.
CoRR, 2018

Tight Upper Bounds on the Crossing Number in a Minor-Closed Class.
CoRR, 2018

A note on choosability with defect 1 of graphs on surfaces.
CoRR, 2018

Anagram-Free Chromatic Number Is Not Pathwidth-Bounded.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Geodesic Obstacle Representation of Graphs.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Structure of Graphs with Locally Restricted Crossings.
SIAM J. Discrete Math., 2017

The Utility of Untangling.
J. Graph Algorithms Appl., 2017

Layered separators in minor-closed graph classes with applications.
J. Comb. Theory, Ser. B, 2017

New Bounds for Facial Nonrepetitive Colouring.
Graphs and Combinatorics, 2017

More Turán-Type Theorems for Triangles in Convex Point Sets.
CoRR, 2017

Local Routing in Spanners Based on WSPDs.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

EPG-representations with Small Grid-Size.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016
Nonrepetitive colouring via entropy compression.
Combinatorica, 2016

Layouts of Expander Graphs.
Chicago J. Theor. Comput. Sci., 2016

Track Layout Is Hard.
Proceedings of the Graph Drawing and Network Visualization, 2016

2015
Empty Pentagons in Point Sets with Collinearities.
SIAM J. Discrete Math., 2015

Graph layouts via layered separators.
J. Comb. Theory, Ser. B, 2015

Average Stretch Factor: How Low Does It Go?
Discrete & Computational Geometry, 2015

Compatible Connectivity Augmentation of Planar Disconnected Graphs.
Discrete & Computational Geometry, 2015

3-Monotone Expanders.
CoRR, 2015

On Obstacle Numbers.
Electr. J. Comb., 2015

Visibility-monotonic polygon deflation.
Contributions to Discrete Mathematics, 2015

Genus, Treewidth, and Local Crossing Number.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2014
Triangulating and guarding realistic polygons.
Comput. Geom., 2014

Crossings in Grid Drawings.
Electr. J. Comb., 2014

2013
Three-Dimensional Drawings.
Proceedings of the Handbook on Graph Drawing and Visualization., 2013

A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph.
SIAM J. Discrete Math., 2013

Robust Geometric Spanners.
SIAM J. Comput., 2013

Coverage with k-transmitters in the presence of obstacles.
J. Comb. Optim., 2013

A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing.
Discrete & Computational Geometry, 2013

Layered Separators in Minor-Closed Families with Applications.
CoRR, 2013

On point-sets that support planar graphs.
Comput. Geom., 2013

Fast local searches and updates in bounded universes.
Comput. Geom., 2013

Nonrepetitive Colourings of Planar Graphs with O(log n) Colours.
Electr. J. Comb., 2013

Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive Coloring.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012
Entropy, triangulation, and point location in planar subdivisions.
ACM Trans. Algorithms, 2012

An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains.
SIAM J. Discrete Math., 2012

An affine invariant k-nearest neighbor regression estimate.
J. Multivar. Anal., 2012

Ghost chimneys.
Int. J. Comput. Geometry Appl., 2012

PROXIMITY GRAPHS: E, δ, Δ, χ AND ω.
Int. J. Comput. Geometry Appl., 2012

Memoryless routing in convex subdivisions: Random walks are optimal.
Comput. Geom., 2012

Biased Range Trees.
Algorithmica, 2012

Layered Working-Set Trees.
Algorithmica, 2012

2011
Every Large Point Set contains Many Collinear Points or an Empty Pentagon.
Graphs and Combinatorics, 2011

On the maximum number of cliques in a graph embedded in a surface.
Eur. J. Comb., 2011

On the Book Thickness of k-Trees.
Discrete Mathematics & Theoretical Computer Science, 2011

Nonrepetitive Colouring via Entropy Compression
CoRR, 2011

A note on the perimeter of fat objects.
Comput. Geom., 2011

Notes on Large Angle Crossing Graphs.
Chicago J. Theor. Comput. Sci., 2011

Meshes Preserving Minimum Feature Size.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Convexifying Polygons Without Losing Visibilities.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times
CoRR, 2010

Odds-On Trees
CoRR, 2010

Point Location in Disconnected Planar Subdivisions
CoRR, 2010

An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times.
Proceedings of the Algorithm Theory, 2010

On Graphs Supported by Line Sets.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

Coverage with k-Transmitters in the Presence of Obstacles.
Proceedings of the Combinatorial Optimization and Applications, 2010

Common Unfoldings of Polyominoes and Polycubes.
Proceedings of the Computational Geometry, Graphs and Applications, 2010

On the perimeter of fat objects.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009
Connectivity-preserving transformations of binary images.
Comput. Vis. Image Underst., 2009

Minimum feature size preserving decompositions
CoRR, 2009

2008
A Characterization of the degree sequences of 2-trees.
Journal of Graph Theory, 2008

Fixed parameter algorithms for one-sided crossing minimization revisited.
J. Discrete Algorithms, 2008

A Polynomial Bound for Untangling Geometric Planar Graphs.
Electron. Notes Discret. Math., 2008

Distinct Distances in Graph Drawings.
Electr. J. Comb., 2008

On the Parameterized Complexity of Layered Graph Drawing.
Algorithmica, 2008

Distribution-sensitive point location in convex subdivisions.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Improved upper bounds on the crossing number.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra.
SIAM J. Comput., 2007

Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint.
Int. J. Comput. Geometry Appl., 2007

Graph Treewidth and Geometric Thickness Parameters.
Discrete & Computational Geometry, 2007

Graph drawings with few slopes.
Comput. Geom., 2007

Drawings of planar graphs with few slopes and segments.
Comput. Geom., 2007

2006
Upward Three-Dimensional Grid Drawings of Graphs.
Order, 2006

Induced Subgraphs of Bounded Degree and Bounded Treewidth.
Contributions to Discrete Mathematics, 2006

A Fixed-Parameter Approach to 2-Layer Planarization.
Algorithmica, 2006

Curves in the Sand: Algorithmic Drawing.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005
Layout of Graphs with Bounded Tree-Width.
SIAM J. Comput., 2005

Stacks, Queues and Tracks: Layouts of Graph Subdivisions.
Discrete Mathematics & Theoretical Computer Science, 2005

2004
On Linear Layouts of Graphs.
Discrete Mathematics & Theoretical Computer Science, 2004

Track Layouts of Graphs.
Discrete Mathematics & Theoretical Computer Science, 2004

An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization.
Algorithmica, 2004

Layouts of Graph Subdivisions.
Proceedings of the Graph Drawing, 12th International Symposium, 2004

Really Straight Graph Drawings.
Proceedings of the Graph Drawing, 12th International Symposium, 2004

The number of lines tangent to arbitrary convex polyhedra in 3D.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2003
The Expected Number of 3D Visibility Events Is Linear.
SIAM J. Comput., 2003

Tree-Partitions of k-Trees with Applications in Graph Layout.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

Three-Dimensional Grid Drawings with Sub-quadratic Volume.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002
Flat-State Connectivity of Linkages under Dihedral Motions.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs.
Proceedings of the Graph Drawing, 10th International Symposium, 2002

On the number of lines tangent to four convex polyhedra.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
On validating planar worlds.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

A Fixed-Parameter Approach to Two-Layer Planarization.
Proceedings of the Graph Drawing, 9th International Symposium, 2001


2000
Flipturning polygons
CoRR, 2000

1999
Efficient Topological Exploration.
Proceedings of the 1999 IEEE International Conference on Robotics and Automation, 1999


  Loading...