Vida Dujmovic

Vida Dujmovic, William S. Evans, Sylvain Lazard, William Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath: On point-sets that support planar graphs. Comput. Geom. 46(1): 29-50 (2013)

Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat, Pat Morin: Fast local searches and updates in bounded universes. Comput. Geom. 46(2): 181-189 (2013)

Vida Dujmovic, Stefan Langerman: A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing. Discrete & Computational Geometry 49(1): 74-88 (2013)

Brad Ballinger, Nadia Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán Adinolfi, Diane L. Souvaine, Ryuhei Uehara: Coverage with k-transmitters in the presence of obstacles. J. Comb. Optim. 25(2): 208-233 (2013)

Vida Dujmovic, Pat Morin, Adam Sheffer: Crossings in Grid Drawings. CoRR abs/1301.0303 (2013)

Vida Dujmovic: Graph Layouts via Layered Separators. CoRR abs/1302.0304 (2013)

Vida Dujmovic, John Howat, Pat Morin: Biased Range Trees. Algorithmica 62(1-2): 21-37 (2012)

Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat: Layered Working-Set Trees. Algorithmica 63(1-2): 476-489 (2012)

Dan Chen, Luc Devroye, Vida Dujmovic, Pat Morin: Memoryless routing in convex subdivisions: Random walks are optimal. Comput. Geom. 45(4): 178-185 (2012)

David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Pat Morin, Ryuhei Uehara: Ghost chimneys. Int. J. Comput. Geometry Appl. 22(3): 207-214 (2012)

Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Vera Sacristán Adinolfi, Maria Saumell, David R. Wood: PROXIMITY GRAPHS: E, δ, Δ, χ AND ω. Int. J. Comput. Geometry Appl. 22(5): 439-470 (2012)

Gérard Biau, Luc Devroye, Vida Dujmovic, Adam Krzyzak: An affine invariant k-nearest neighbor regression estimate. J. Multivariate Analysis 112: 24-34 (2012)

Vida Dujmovic, Gwenaël Joret, David R. Wood: An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains. SIAM J. Discrete Math. 26(3): 1068-1075 (2012)

Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin: Entropy, triangulation, and point location in planar subdivisions. ACM Transactions on Algorithms 8(3): 29 (2012)

Prosenjit Bose, Vida Dujmovic, Nima Hoda, Pat Morin: Visibility Monotonic Polygon Deflation. CCCG 2012: 11-16

Gérard Biau, Adam Krzyzak, Luc Devroye, Vida Dujmovic: An affine invariant k-nearest neighbor regression estimate. ISIT 2012: 1445-1447

Vida Dujmovic, Fabrizio Frati, Gwenaël Joret, David R. Wood: Nonrepetitive Colourings of Planar Graphs with $O(\log n)$ Colours. CoRR abs/1202.1569 (2012)

Vida Dujmovic, Daniel J. Harvey, Gwenaël Joret, Bruce A. Reed, David R. Wood: A linear-time algorithm for finding a complete graph minor in a dense graph. CoRR abs/1202.2624 (2012)

Prosenjit Bose, Vida Dujmovic, Pat Morin, Michiel H. M. Smid: Robust Geometric Spanners. CoRR abs/1204.4679 (2012)

Prosenjit Bose, Vida Dujmovic, Nima Hoda, Pat Morin: Visibility-Monotonic Polygon Deflation. CoRR abs/1206.1982 (2012)

János Barát, Vida Dujmovic, Gwenaël Joret, Michael S. Payne, Ludmila Scharf, Daria Schymura, Pavel Valtr, David R. Wood: Empty pentagons in point sets with collinearities. CoRR abs/1207.3633 (2012)

Vida Dujmovic, Joachim Gudmundsson, Pat Morin, Thomas Wolle: Notes on Large Angle Crossing Graphs. Chicago J. Theor. Comput. Sci. 2011 (2011)

Prosenjit Bose, Otfried Cheong, Vida Dujmovic: A note on the perimeter of fat objects. Comput. Geom. 44(1): 1-8 (2011)

David R. Wood, Vida Dujmovic: On the Book Thickness of k-Trees. Discrete Mathematics & Theoretical Computer Science 13(3): 39-44 (2011)

Vida Dujmovic, Gasper Fijavz, Gwenaël Joret, Thom Sulanke, David R. Wood: On the maximum number of cliques in a graph embedded in a surface. Eur. J. Comb. 32(8): 1244-1252 (2011)

Zachary Abel, Brad Ballinger, Prosenjit Bose, Sébastien Collette, Vida Dujmovic, Ferran Hurtado, Scott Duke Kominers, Stefan Langerman, Attila Pór, David R. Wood: Every Large Point Set contains Many Collinear Points or an Empty Pentagon. Graphs and Combinatorics 27(1): 47-60 (2011)

Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Ferran Hurtado, Anna Lubiw, Günter Rote, André Schulz, Diane L. Souvaine, Andrew Winslow: Convexifying Polygons Without Losing Visibilities. CCCG 2011

Vida Dujmovic, Stefan Langerman: A center transversal theorem for hyperplanes and applications to graph drawing. Symposium on Computational Geometry 2011: 117-124

Vida Dujmovic, William S. Evans, Sylvain Lazard, William Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath: On Point-Sets That Support Planar Graphs. Graph Drawing 2011: 64-74

Vida Dujmovic, Gwenaël Joret, David R. Wood: Nonrepetitive Colouring via Entropy Compression. CoRR abs/1112.5524 (2011)

Vida Dujmovic, Joachim Gudmundsson, Pat Morin, Thomas Wolle: Notes on Large Angle Crossing Graphs. CATS 2010: 19-24

David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Pat Morin, Ryuhei Uehara: Ghost chimneys. CCCG 2010: 63-66

Prosenjit Bose, Otfried Cheong, Vida Dujmovic: On the perimeter of fat objects. CCCG 2010: 163-166

Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat, Pat Morin: Fast local searches and updates in bounded universes. CCCG 2010: 261-264

Greg Aloupis, Prosenjit Bose, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Karim Douïeb, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin: Common Unfoldings of Polyominoes and Polycubes. CGGA 2010: 44-54

Brad Ballinger, Nadia Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán Adinolfi, Diane L. Souvaine, Ryuhei Uehara: Coverage with k-Transmitters in the Presence of Obstacles. COCOA (2) 2010: 1-15

Vida Dujmovic, William S. Evans, Stephen G. Kobourov, Giuseppe Liotta, Christophe Weibel, Stephen K. Wismath: On Graphs Supported by Line Sets. Graph Drawing 2010: 177-182

Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat: Layered Working-Set Trees. LATIN 2010: 686-696

Prosenjit Bose, Karim Douïeb, Vida Dujmovic, Rolf Fagerberg: An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times. SWAT 2010: 38-49

Prosenjit Bose, Luc Devroye, Karim Douïeb, Vida Dujmovic, James King, Pat Morin: Point Location in Disconnected Planar Subdivisions. CoRR abs/1001.2763 (2010)

Prosenjit Bose, Luc Devroye, Karim Douïeb, Vida Dujmovic, James King, Pat Morin: Odds-On Trees. CoRR abs/1002.1092 (2010)

Prosenjit Bose, Karim Douïeb, Vida Dujmovic, Rolf Fagerberg: An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times. CoRR abs/1003.0139 (2010)

Vida Dujmovic, Stefan Langerman: A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing. CoRR abs/1012.0548 (2010)

Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Pat Morin: Connectivity-preserving transformations of binary images. Computer Vision and Image Understanding 113(10): 1027-1038 (2009)

Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Stefan Langerman, Pat Morin, David R. Wood: A Polynomial Bound for Untangling Geometric Planar Graphs. Discrete & Computational Geometry 42(4): 570-585 (2009)

Zachary Abel, Brad Ballinger, Prosenjit Bose, Sébastien Collette, Vida Dujmovic, Ferran Hurtado, Scott D. Kominers, Stefan Langerman, Attila Pór, David R. Wood: Every Large Point Set contains Many Collinear Points or an Empty Pentagon. CCCG 2009: 99-102

Vida Dujmovic, John Howat, Pat Morin: Biased range trees. SODA 2009: 486-495

Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin: Entropy, Triangulation, and Point Location in Planar Subdivisions. CoRR abs/0901.1908 (2009)

Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat: Layered Working-Set Trees. CoRR abs/0907.2071 (2009)

Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, John Iacono: Minimum feature size preserving decompositions. CoRR abs/0908.2493 (2009)

Vida Dujmovic, Joachim Gudmundsson, Pat Morin, Thomas Wolle: Notes on large angle crossing graphs. CoRR abs/0908.3545 (2009)

Dan Chen, Luc Devroye, Vida Dujmovic, Pat Morin: Memoryless Routing in Convex Subdivisions: Random Walks are Optimal. CoRR abs/0911.2484 (2009)

Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood: On the Parameterized Complexity of Layered Graph Drawing. Algorithmica 52(2): 267-292 (2008)

Paz Carmi, Vida Dujmovic, Pat Morin, David R. Wood: Distinct Distances in Graph Drawings. Electr. J. Comb. 15(1) (2008)

Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Pat Morin, Stefan Langerman, David R. Wood: A Polynomial Bound for Untangling Geometric Planar Graphs. Electronic Notes in Discrete Mathematics 31: 213-218 (2008)

Vida Dujmovic, Henning Fernau, Michael Kaufmann: Fixed parameter algorithms for one-sided crossing minimization revisited. J. Discrete Algorithms 6(2): 313-323 (2008)

Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer: A Characterization of the degree sequences of 2-trees. Journal of Graph Theory 58(3): 191-209 (2008)

Greg Aloupis, Prosenjit Bose, Vida Dujmovic, Chris Gray, Stefan Langerman, Bettina Speckmann: Triangulating and Guarding Realistic Polygons. CCCG 2008

Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood: Improved upper bounds on the crossing number. Symposium on Computational Geometry 2008: 375-384

Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin: Distribution-sensitive point location in convex subdivisions. SODA 2008: 912-921

Vida Dujmovic, John Howat, Pat Morin: Biased Range Trees. CoRR abs/0806.2707 (2008)

Vida Dujmovic, Matthew Suderman, David R. Wood: Graph drawings with few slopes. Comput. Geom. 38(3): 181-193 (2007)

Vida Dujmovic, David Eppstein, Matthew Suderman, David R. Wood: Drawings of planar graphs with few slopes and segments. Comput. Geom. 38(3): 194-212 (2007)

Vida Dujmovic, David R. Wood: Graph Treewidth and Geometric Thickness Parameters. Discrete & Computational Geometry 37(4): 641-670 (2007)

Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, Stephen K. Wismath: Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. Int. J. Comput. Geometry Appl. 17(4): 297-304 (2007)

Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides: Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra. SIAM J. Comput. 37(2): 522-551 (2007)

Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer: A Characterization of the Degree Sequences of 2-trees. ANALCO 2007: 232-241

Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Stefan Langerman, Pat Morin, David R. Wood: A polynomial bound for untangling geometric planar graphs. CoRR abs/0710.1641 (2007)

Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood: A Fixed-Parameter Approach to 2-Layer Planarization. Algorithmica 45(2): 159-182 (2006)

Prosenjit Bose, Vida Dujmovic, David R. Wood: Induced Subgraphs of Bounded Degree and Bounded Treewidth. Contributions to Discrete Mathematics 1(1) (2006)

Vida Dujmovic, David R. Wood: Upward Three-Dimensional Grid Drawings of Graphs. Order 23(1): 1-20 (2006)

Mirela Damian, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Dania El-Khechen, Robin Y. Flatland, John Iacono, Stefan Langerman, Henk Meijer, Suneeta Ramaswami, Diane L. Souvaine, Perouz Taslakian, Godfried T. Toussaint: Curves in the Sand: Algorithmic Drawing. CCCG 2006

Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer: A Characterization of the Degree Sequences of 2-Trees. CoRR abs/cs/0605011 (2006)

Vida Dujmovic, David R. Wood: Stacks, Queues and Tracks: Layouts of Graph Subdivisions. Discrete Mathematics & Theoretical Computer Science 7(1): 155-202 (2005)

Vida Dujmovic, Pat Morin, David R. Wood: Layout of Graphs with Bounded Tree-Width. SIAM J. Comput. 34(3): 553-579 (2005)

Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, Stephen K. Wismath: Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. CCCG 2005: 302-305

Vida Dujmovic, David R. Wood: Graph Treewidth and Geometric Thickness Parameters. Graph Drawing 2005: 129-140

Prosenjit Bose, Vida Dujmovic, David R. Wood: Induced Subgraphs of Bounded Degree and Bounded Treewidth. WG 2005: 175-186

Vida Dujmovic, Sue Whitesides: An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization. Algorithmica 40(1): 15-31 (2004)

Vida Dujmovic, David R. Wood: On Linear Layouts of Graphs. Discrete Mathematics & Theoretical Computer Science 6(2): 339-358 (2004)

Vida Dujmovic, Attila Pór, David R. Wood: Track Layouts of Graphs. Discrete Mathematics & Theoretical Computer Science 6(2): 497-522 (2004)

Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides: The number of lines tangent to arbitrary convex polyhedra in 3D. Symposium on Computational Geometry 2004: 46-55

Vida Dujmovic, Matthew Suderman, David R. Wood: Really Straight Graph Drawings. Graph Drawing 2004: 122-132

Vida Dujmovic, David R. Wood: Layouts of Graph Subdivisions. Graph Drawing 2004: 133-143

Vida Dujmovic, Pat Morin, David R. Wood: Layout of Graphs with Bounded Tree-Width. CoRR cs.DM/0406024 (2004)

Vida Dujmovic, Attila Pór, David R. Wood: Track Layouts of Graphs. CoRR cs.DM/0407033 (2004)

Olivier Devillers, Vida Dujmovic, Hazel Everett, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sylvain Petitjean: The Expected Number of 3D Visibility Events Is Linear. SIAM J. Comput. 32(6): 1586-1620 (2003)

Vida Dujmovic, David R. Wood: Three-Dimensional Grid Drawings with Sub-quadratic Volume. Graph Drawing 2003: 190-201

Vida Dujmovic, Henning Fernau, Michael Kaufmann: Fixed Parameter Algorithms for one-sided crossing minimization Revisited. Graph Drawing 2003: 332-344

Vida Dujmovic, David R. Wood: Tree-Partitions of k-Trees with Applications in Graph Layout. WG 2003: 205-217

Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides: On the number of lines tangent to four convex polyhedra. CCCG 2002: 113-117

Vida Dujmovic, Pat Morin, David R. Wood: Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs. Graph Drawing 2002: 42-53

Vida Dujmovic, Sue Whitesides: An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization. Graph Drawing 2002: 118-129

Greg Aloupis, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Stefan Langerman, Henk Meijer, Joseph O'Rourke, Mark H. Overmars, Michael A. Soss, Ileana Streinu, Godfried T. Toussaint: Flat-State Connectivity of Linkages under Dihedral Motions. ISAAC 2002: 369-380

Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood: On the Parameterized Complexity of Layered Graph Drawing. ESA 2001: 488-499

Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood: A Fixed-Parameter Approach to Two-Layer Planarization. Graph Drawing 2001: 1-15

Vida Dujmovic, Sue Whitesides: On validating planar worlds. SODA 2001: 791-792

Oswin Aichholzer, Carmen Cortés, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Henk Meijer, Mark H. Overmars, Belén Palop, Suneeta Ramaswami, Godfried T. Toussaint: Flipturning polygons. CoRR cs.CG/0008010 (2000)

Ioannis M. Rekleitis, Vida Dujmovic, Gregory Dudek: Efficient Topological Exploration. ICRA 1999: 676-681