Vida Dujmović | Academic Influence

Vida Dujmović's AcademicInfluence.com Rankings

Vida Dujmović

Mathematics

#1259

World Rank

#2105

Historical Rank

Graph Theory

#52

World Rank

#59

Historical Rank

Measure Theory

#3737

World Rank

#4407

Historical Rank

mathematics Degrees

Vida Dujmović

Computer Science

#3401

World Rank

#3567

Historical Rank

Algorithms

#441

World Rank

#447

Historical Rank

computer-science Degrees

Download Badge

Mathematics
Computer Science

Vida Dujmović's Degrees

Bachelors Mathematics University of Zagreb

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Vida Dujmović Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Vida Dujmović is a Canadian computer scientist and mathematician known for her research in graph theory and graph algorithms, and particularly for graph drawing, for the structural theory of graph width parameters including treewidth and queue number, and for the use of these parameters in the parameterized complexity of graph drawing. She is a professor of electrical engineering & computer science at the University of Ottawa, where she holds the University Research Chair in Structural and Algorithmic Graph Theory.

(See a Problem?)

Vida Dujmović's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

On Linear Layouts of Graphs (2004) (122)
Layout of Graphs with Bounded Tree-Width (2004) (101)
Planar Graphs have Bounded Queue-Number (2019) (84)
Drawings of planar graphs with few slopes and segments (2006) (83)
Stacks, Queues and Tracks: Layouts of Graph Subdivisions (2005) (80)
On the Parameterized Complexity of Layered Graph Drawing (2001) (74)
Graph Treewidth and Geometric Thickness Parameters (2005) (69)
Nonrepetitive colouring via entropy compression (2011) (62)
Layered separators in minor-closed graph classes with applications (2013) (62)
Track Layouts of Graphs (2004) (59)
Structure of Graphs with Locally Restricted Crossings (2015) (52)
Notes on Large Angle Crossing Graphs (2009) (44)
An affine invariant k-nearest neighbor regression estimate (2012) (42)
Three-Dimensional Grid Drawings with Sub-quadratic Volume (2003) (42)
A Fixed-Parameter Approach to 2-Layer Planarization (2001) (41)
Fixed parameter algorithms for one-sided crossing minimization revisited (2003) (40)
Graph drawings with few slopes (2006) (38)
An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization (2002) (38)
Track Layouts, Layered Path Decompositions, and Leveled Planarity (2015) (37)
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra (2007) (34)
The Expected Number of 3D Visibility Events Is Linear (2003) (34)
Planar graphs have bounded nonrepetitive chromatic number (2019) (33)
Graph layouts via layered separators (2013) (32)
Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs (2002) (32)
Efficient topological exploration (1999) (32)
Tree-Partitions of k-Trees with Applications in Graph Layout (2003) (29)
A Polynomial Bound for Untangling Geometric Planar Graphs (2007) (26)
PROXIMITY GRAPHS: E, δ, Δ, χ AND ω (2012) (26)
Stack and Queue Layouts via Layered Separators (2016) (24)
Really Straight Graph Drawings (2004) (24)
On point-sets that support planar graphs (2011) (24)
Robust geometric spanners (2012) (23)
Nonrepetitive Colourings of Planar Graphs with O(log n) Colours (2012) (22)
Every Large Point Set contains Many Collinear Points or an Empty Pentagon (2009) (20)
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers (2019) (20)
Coverage with k-transmitters in the presence of obstacles (2010) (19)
Convexifying Polygons Without Losing Visibilities (2011) (18)
On the maximum number of cliques in a graph embedded in a surface (2009) (18)
Drawing Planar Graphs with Many Collinear Vertices (2016) (17)
Common Unfoldings of Polyominoes and Polycubes (2010) (17)
On the number of lines tangent to four convex polyhedra (2002) (16)
Flipturning Polygons (2000) (16)
A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing (2010) (15)
Distinct Distances in Graph Drawings (2008) (15)
An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains (2011) (14)
Fast local searches and updates in bounded universes (2013) (14)
The structure of k-planar graphs (2019) (14)
Flat-State Connectivity of Linkages under Dihedral Motions (2002) (13)
The Utility of Untangling (2015) (12)
Orthogonal Tree Decompositions of Graphs (2017) (12)
Layouts of Expander Graphs (2015) (12)
A Characterization of the degree sequences of 2‐trees (2006) (12)
Minor-closed graph classes with bounded layered pathwidth (2018) (11)
Improved upper bounds on the crossing number (2008) (11)
On Obstacle Numbers (2013) (11)
An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times (2010) (10)
Pole Dancing: 3D Morphs for Tree Drawings (2018) (10)
The number of lines tangent to arbitrary convex polyhedra in 3D (2004) (10)
Layered Working-Set Trees (2009) (10)
Upward Three-Dimensional Grid Drawings of Graphs (2005) (10)
Distribution-sensitive point location in convex subdivisions (2008) (10)
Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive Coloring (2013) (9)
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint (2005) (9)
Entropy, triangulation, and point location in planar subdivisions (2009) (9)
Memoryless routing in convex subdivisions: Random walks are optimal (2009) (9)
Genus, Treewidth, and Local Crossing Number (2015) (9)
More Turán-Type Theorems for Triangles in Convex Point Sets (2017) (9)
A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph (2012) (8)
Biased Range Trees (2008) (8)
Triangulating and Guarding Realistic Polygons (2014) (7)
On the Book Thickness of k-Trees (2009) (7)
On validating planar worlds (2001) (7)
Queue Layouts of Graphs with Bounded Degree and Bounded Genus (2019) (7)
Near-Optimal O(k)-Robust Geometric Spanners (2018) (7)
New Bounds for Facial Nonrepetitive Colouring (2016) (6)
Connectivity-preserving transformations of binary images (2009) (6)
On Graphs Supported by Line Sets (2010) (6)
Compatible Connectivity Augmentation of Planar Disconnected Graphs (2014) (5)
Empty Pentagons in Point Sets with Collinearities (2012) (5)
Three-Dimensional Drawings (2013) (5)
Every Collinear Set in a Planar Graph is Free (2018) (5)
Curves in the Sand: Algorithmic Drawing (2006) (5)
Odds-On Trees (2010) (5)
Induced Subgraphs of Bounded Degree and Bounded Treewidth (2005) (5)
Crossings in Grid Drawings (2013) (5)
On the Number of Maximal Free Line Segments Tangent to Arbitrary Three-dimensional Convex Polyhedra (2005) (5)
Guarding Fat Polygons and Triangulating Guarded Polygons (2007) (4)
Layouts of Graph Subdivisions (2004) (4)
A note on the perimeter of fat objects (2011) (4)
EPG-representations with small grid-size (2017) (3)
Track Layout Is Hard (2016) (3)
A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing (2012) (3)
Anagram-Free Chromatic Number Is Not Pathwidth-Bounded (2018) (3)
Really Straight Drawings I : Planar Graphs ∗ (2005) (2)
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers (2021) (2)
Point Location in Disconnected Planar Subdivisions (2010) (2)
Tight Upper Bounds on the Crossing Number in a Minor-Closed Class (2018) (2)
Average Stretch Factor: How Low Does It Go? (2013) (2)
A Polynomial Bound for Untangling Geometric Planar Graphs (2008) (2)
Local Routing in Spanners Based on WSPDs (2017) (2)
Notes on growing a tree in a graph (2017) (2)
Biased Range Trees (2010) (1)
Corrigendum: Orthogonal Tree Decompositions of Graphs (2018) (1)
Thickness and Antithickness of Graphs (2017) (1)
Face flips in origami tessellations (2019) (1)
Nonrepetitive colouring via entropy compression (2015) (1)
A linear bound on the expected number of visibility events (2002) (1)
Local routing in WSPD-based spanners (2021) (1)
Meshes Preserving Minimum Feature Size (2012) (1)
Layered Working-Set Trees (2011) (1)
Really Straight Drawings II: Non-Planar Graphs (2005) (1)
Geodesic Obstacle Representation of Graphs (2018) (1)
2×n Grids have Unbounded Anagram-Free Chromatic Number (2021) (0)
Average Stretch Factor: How Low Does It Go? (2015) (0)
Compatible Connectivity Augmentation of Planar Disconnected Graphs (2015) (0)
Reconfiguring edge-connected pivoting modular robots (2019) (0)
EPG-representations with small grid-size (cid:63) (2018) (0)
Visibility Monotonic Polygon Deflation (2012) (0)
ON GROWING A TREE IN A GRAPH À (2017) (0)
the degree of standard (2022) (0)
Ju n 20 06 Graph Drawings with Few Slopes ∗ (2007) (0)
New Bounds for Facial Nonrepetitive Colouring (2017) (0)
A NOTE ON THE PERIMETER OF ( α , β ) – COVERED OBJECTS (2009) (0)
Workshop Committee (2021) (0)
Dual Circumference and Collinear Sets (2018) (0)
Track Layouts, Layered Path Decompositions, and Leveled Planarity (2018) (0)
Minimum feature size preserving decompositions (2009) (0)
Layered Pathwidth and Graph Layouts (2019) (0)
Ghost chimneys (2010) (0)
3-Monotone Expanders (2015) (0)
Every Collinear Set in a Planar Graph is Free (2020) (0)
Graph Drawing via Layered Partitions (2019) (0)
A Characterization of the Degree Sequences of 2-trees (2007) (0)
A note on choosability with defect 1 of graphs on surfaces (2018) (0)
A pr 2 00 6 Graph Treewidth and Geometric Thickness Parameters ∗ (2008) (0)
On the perimeter of fat objects (2010) (0)
Coverage with k-transmitters in the presence of obstacles (2012) (0)

This paper list is powered by the following services:

Other Resources About Vida Dujmović

en.wikipedia.org

What Schools Are Affiliated With Vida Dujmović?

Vida Dujmović is affiliated with the following schools: