The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Vida Dujmovic: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:113-117 [Conf]
  2. Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, Steve Wismath
    Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:302-305 [Conf]
  3. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:46-55 [Conf]
  4. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:488-499 [Conf]
  5. 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. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:1-15 [Conf]
  6. Vida Dujmovic, Henning Fernau, Michael Kaufmann
    Fixed Parameter Algorithms for one-sided crossing minimization Revisited. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:332-344 [Conf]
  7. Vida Dujmovic, Pat Morin, David R. Wood
    Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:42-53 [Conf]
  8. Vida Dujmovic, Matthew Suderman, David R. Wood
    Really Straight Graph Drawings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:122-132 [Conf]
  9. Vida Dujmovic, Sue Whitesides
    An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:118-129 [Conf]
  10. Vida Dujmovic, David R. Wood
    Three-Dimensional Grid Drawings with Sub-quadratic Volume. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:190-201 [Conf]
  11. Vida Dujmovic, David R. Wood
    Layouts of Graph Subdivisions. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:133-143 [Conf]
  12. Vida Dujmovic, David R. Wood
    Graph Treewidth and Geometric Thickness Parameters. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:129-140 [Conf]
  13. Ioannis M. Rekleitis, Vida Dujmovic, Gregory Dudek
    Efficient Topological Exploration. [Citation Graph (0, 0)][DBLP]
    ICRA, 1999, pp:676-681 [Conf]
  14. 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. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:369-380 [Conf]
  15. Vida Dujmovic, Sue Whitesides
    On validating planar worlds. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:791-792 [Conf]
  16. Prosenjit Bose, Vida Dujmovic, David R. Wood
    Induced Subgraphs of Bounded Degree and Bounded Treewidth. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:175-186 [Conf]
  17. Vida Dujmovic, David R. Wood
    Tree-Partitions of k-Trees with Applications in Graph Layout. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:205-217 [Conf]
  18. Vida Dujmovic, Sue Whitesides
    An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:40, n:1, pp:15-31 [Journal]
  19. 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. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:2, pp:159-182 [Journal]
  20. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  21. Vida Dujmovic, Pat Morin, David R. Wood
    Layout of Graphs with Bounded Tree-Width [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  22. Vida Dujmovic, Attila Pór, David R. Wood
    Track Layouts of Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  23. Vida Dujmovic, David R. Wood
    Upward Three-Dimensional Grid Drawings of Graphs. [Citation Graph (0, 0)][DBLP]
    Order, 2006, v:23, n:1, pp:1-20 [Journal]
  24. Olivier Devillers, Vida Dujmovic, Hazel Everett, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sylvain Petitjean
    The Expected Number of 3D Visibility Events Is Linear. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:6, pp:1586-1620 [Journal]
  25. Vida Dujmovic, Pat Morin, David R. Wood
    Layout of Graphs with Bounded Tree-Width. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:3, pp:553-579 [Journal]
  26. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  27. Vida Dujmovic, David Eppstein, Matthew Suderman, David R. Wood
    Drawings of planar graphs with few slopes and segments. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:38, n:3, pp:194-212 [Journal]
  28. Vida Dujmovic, Matthew Suderman, David R. Wood
    Graph drawings with few slopes. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:38, n:3, pp:181-193 [Journal]
  29. Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer
    A Characterization of the Degree Sequences of 2-Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  30. Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Stefan Langerman, Pat Morin, David R. Wood
    A polynomial bound for untangling geometric planar graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  31. Vida Dujmovic, David R. Wood
    Graph Treewidth and Geometric Thickness Parameters. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:37, n:4, pp:641-670 [Journal]
  32. Vida Dujmovic, Attila Pór, David R. Wood
    Track Layouts of Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2004, v:6, n:2, pp:497-522 [Journal]
  33. Vida Dujmovic, David R. Wood
    On Linear Layouts of Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2004, v:6, n:2, pp:339-358 [Journal]
  34. Vida Dujmovic, David R. Wood
    Stacks, Queues and Tracks: Layouts of Graph Subdivisions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:155-202 [Journal]
  35. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:2, pp:522-551 [Journal]

  36. Triangulating and Guarding Realistic Polygons. [Citation Graph (, )][DBLP]


  37. On the perimeter of fat objects. [Citation Graph (, )][DBLP]


  38. Fast local searches and updates in bounded universes. [Citation Graph (, )][DBLP]


  39. Ghost chimneys. [Citation Graph (, )][DBLP]


  40. Every Large Point Set contains Many Collinear Points or an Empty Pentagon. [Citation Graph (, )][DBLP]


  41. Improved upper bounds on the crossing number. [Citation Graph (, )][DBLP]


  42. Layered Working-Set Trees. [Citation Graph (, )][DBLP]


  43. Distribution-sensitive point location in convex subdivisions. [Citation Graph (, )][DBLP]


  44. Biased range trees. [Citation Graph (, )][DBLP]


  45. An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times. [Citation Graph (, )][DBLP]


  46. On the Parameterized Complexity of Layered Graph Drawing. [Citation Graph (, )][DBLP]


  47. A note on the perimeter of fat objects. [Citation Graph (, )][DBLP]


  48. Biased Range Trees [Citation Graph (, )][DBLP]


  49. Entropy, Triangulation, and Point Location in Planar Subdivisions [Citation Graph (, )][DBLP]


  50. Layered Working-Set Trees [Citation Graph (, )][DBLP]


  51. Minimum feature size preserving decompositions [Citation Graph (, )][DBLP]


  52. Notes on large angle crossing graphs [Citation Graph (, )][DBLP]


  53. Memoryless Routing in Convex Subdivisions: Random Walks are Optimal [Citation Graph (, )][DBLP]


  54. Point Location in Disconnected Planar Subdivisions [Citation Graph (, )][DBLP]


  55. Odds-On Trees [Citation Graph (, )][DBLP]


  56. An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times [Citation Graph (, )][DBLP]


  57. A Polynomial Bound for Untangling Geometric Planar Graphs. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.452secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002