Vida Dujmović
About
In The Last Decade
Vida Dujmović
67 papers receiving 537 citations
Peers
Comparison fields: 5 of 59
- Computational Theory and Mathematics 370
- Computer Graphics and Computer-Aided Design 291
- Computer Vision and Pattern Recognition 147
- Computer Networks and Communications 105
- Electrical and Electronic Engineering 86
Countries citing papers authored by Vida Dujmović
This map shows the geographic impact of Vida Dujmović's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Vida Dujmović with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Vida Dujmović more than expected).
Fields of papers citing papers by Vida Dujmović
This network shows the impact of papers produced by Vida Dujmović. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Vida Dujmović. The network helps show where Vida Dujmović may publish in the future.
Co-authorship network of co-authors of Vida Dujmović
This figure shows the co-authorship network connecting the top 25 collaborators of Vida Dujmović. A scholar is included among the top collaborators of Vida Dujmović based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Vida Dujmović. Vida Dujmović is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Title | Journal | Authors | Indexed citations |
|---|---|---|---|---|
| 1 | Product Structure Extension of the Alon–Seymour–Thomas Theorem | SIAM Journal on Discrete Mathematics | Vida Dujmović, David Eppstein et al. | 1 |
| 2 | Graph product structure for non-minor-closed classes | Journal of Combinatorial Theory Series B | Vida Dujmović, Pat Morin et al. | 12 |
| 3 | Adjacency Labelling for Planar Graphs (and Beyond) | DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) | Vida Dujmović, Louis Esperet et al. | 16 |
| 4 | Universal Reconfiguration of Facet-Connected Modular Robots by Pivots:\n The $O(1)$ Musketeers | arXiv (Cornell University) | Esther M. Arkin, Mirela Damian et al. | 1 |
| 5 | Thickness and antithickness of graphs | Monash University Research Portal (Monash University) | Vida Dujmović, David R. Wood | 0 |
| 6 | Dual Circumference and Collinear Sets | arXiv (Cornell University) | Vida Dujmović, Pat Morin | 1 |
| 7 | Layered separators in minor-closed graph classes with applications | Journal of Combinatorial Theory Series B | Vida Dujmović, Pat Morin et al. | 22 |
| 8 | AN IMPROVED BOUND FOR FIRST-FIT ON POSETS WITHOUT TWO LONG INCOMPARABLE CHAINS | Vida Dujmović et al. | 2 | |
| 9 | 1Graph Layouts via Layered Separators | Vida Dujmović | 8 | |
| 10 | Compatible connectivity-augmentation of planar disconnected graphs | Symposium on Discrete Algorithms | Greg Aloupis, Luis Barba et al. | 1 |
| 11 | Fast local searches and updates in bounded universes | Computational Geometry | Prosenjit Bose, Vida Dujmović et al. | 1 |
| 12 | An affine invariant | Journal of Multivariate Analysis | Gérard Biau, Luc Devroye et al. | 23 |
| 13 | On the maximum number of cliques in a graph embedded in a surface | European Journal of Combinatorics | Vida Dujmović, Gwenaël Joret et al. | 5 |
| 14 | Memoryless routing in convex subdivisions: Random walks are optimal | Computational Geometry | Dan Chen, Luc Devroye et al. | 5 |
| 15 | A note on the perimeter of fat objects | Computational Geometry | Prosenjit Bose, Otfried Cheong et al. | 3 |
| 16 | Biased range trees | Symposium on Discrete Algorithms | Vida Dujmović, Pat Morin et al. | 3 |
| 17 | Triangulating and Guarding Realistic Polygons. | TU/e Research Portal | Greg Aloupis, Prosenjit Bose et al. | 3 |
| 18 | Distribution-sensitive point location in convex subdivisions | Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) | Sébastien Collette, Vida Dujmović et al. | 7 |
| 19 | Fixed parameter algorithms for one-sided crossing minimization revisited | Journal of Discrete Algorithms | Vida Dujmović, Henning Fernau et al. | 13 |
| 20 | Graph drawings with few slopes | Computational Geometry | Vida Dujmović, Matthew Suderman et al. | 15 |
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.