Vida's papers

[1]

V. Dujmović, P. Morin, and D. R. Wood,
"Layered separators in minor-closed families with applications".
Submitted to Journal of Combinatorial Theory, Series B, (JCTB) in 2015.
[arXiv]

[2]

V. Dujmović, A. Sidiropoulos and D. R. Wood,
"3-Monotone Expanders".
Submitted to Theory of Computing, (ToC) in 2015.
[arXiv]

[3]

M. J. Bannister, W. E. Devanny, V. Dujmović, D. Eppstein and D. R. Wood,
"Track layouts, layered path decompositions, and leveled planarity". Preprint 2015.
[arXiv]

[4]

V. Dujmović,
"Graph Layouts via Layered Separators."
Journal of Combinatorial Theory, Series B, (JCTB), 110:79-89, 2015.
[arXiv] [pdf]

[5]

G. Aloupis, L. Barba, P. Carmi, V. Dujmović, F. Frati, and P. Morin
"Compatible connectivity augmentation of planar disconnected graphs",
Discrete & Computational Geometry, (DCG), 54(2): 459-480, 2015.
[arXiv]

[6]

V. Dujmović, P. Morin, and M.Smid,
"Average Stretch Factor: How Low Does It Go?"
Discrete & Computational Geometry , (DCG), 53(2): 296-326, 2015.
[arXiv]

[7]

V. Dujmović, G. Joret, J. Kozik and D.R. Wood,
"Nonrepetitive colouring via entropy compression".
Combinatorica, in press, 2015.
[arXiv] [pdf]

[8]

V. Dujmović, and P. Morin,
"On Obstacle Numbers".
Electronic Journal of Combinatorics, 22(3):P3.1, 2015.
[arXiv]

[9]

J. Barat, V. Dujmović, G. Joret, M. Payne, L. Scharf, D. Schymura, P. Valtr and D. R. Wood,
"Empty pentagons in point sets with collinearities,"
SIAM J. Discrete Math, (SIDMA), 29.1:198-209, 2015.
[arXiv] [pdf]

[10]

P. Bose, V. Dujmović, N. Hoda, and P. Morin.
"Visibility-monotonic polygon deflation".
Contributions to Discrete Mathematics, Accepted in 2015.
[arXiv]

[11]

V. Dujmović, P. Morin, and A. Sheffer,
"Crossings in grid drawings."
Electronic Journal of Combinatorics, , 21(1): P1.41, 2014.
[arXiv] [pdf]

[12]

P. Bose, V. Dujmović, P. Morin, and M. Smid,
"Robust Geometric Spanners"
SIAM Journal on Computing, 42(4), pp. 1720-1736, 2013.
[arXiv] [pdf]

[13]

V. Dujmović, D. Harvey, G. Joret, B. Reed, and D.R. Wood,
"A linear-time algorithm for finding a complete graph minor in a dense graph".
SIAM J. Discrete Mathematics, (SIDMA), 27(4):1770-1774, 2013.
[arXiv]

[14]

V. Dujmović, F. Frati, G. Joret, and D.R. Wood
"Nonrepetitive colourings of planar graphs with O(log n) colours",
Electronic J. Combinatorics, 20(1): P51, 2013.
[arXiv] [pdf]

[15]

V. Dujmović, and S. Langerman
"A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing".
Discrete & Computational Geometry (DCG), vol. 49(1), pp. 74-88, 2013.
Invited to a special issue of 27th ACM Symposium on Computational Geometry (SoCG 2011).
[arXiv] [pdf]

[16]

G. Aloupis, P. Bose, V. Dujmović, C. Gray, S. Langerman, and B. Speckmann
"Guarding Fat Polygons and Triangulating Guarded Polygons".
Computational Geometry: Theory and Applications (CGTA), 47(2):296-306, 2014.

[17]

P. Bose, K. Douieb, V. Dujmović, J. Howat, and P. Morin
"Fast Local Searches and Updates in Bounded Universes".
Computational Geometry: Theory and Applications. (CGTA), 46(2), pp 181-189, 2013.
[pdf]

[18]

V. Dujmović, W. Evans, S. Lazard, W. Lenhart, G. Liotta, D. Rappaport and S. Wismat
"On Point-sets that Support Planar Graphs",
Computational Geometry: Theory and Applications (CGTA). vol. 46(1), pp. 29--50, 2013.
[publication] [pdf]

[19]

V. Dujmović, G. Joret, and D.R. Wood
"An improved bound for first-fit on posets without two long incomparable chains",
SIAM J. Discrete Mathematics, vol. 26(3), pp. 1068-1075, 2012.
[arXiv] [pdf]

[20]

G. Biau, L. Devroye, V. Dujmović, and A. Krzyzak
"An Affine Invariant k-Nearest Neighbor Regression Estimate".
Journal of Multivariate Analysis, vol. 112, pp. 24-34, 2012.
[arXiv] [pdf]

[21]

P. Bose, V. Dujmović, F. Hurtado, J. Iacono, S. Langerman, H. Meijer, V. Sacristán, M. Saumell, and D.R. Wood
"Proximity graphs: E, δ, Δ, χ and ω".
International Journal of Computational Geometry and Applications (IJCGA), 22(5): 439-470, 2012.
[pdf]

[22]

D. Charlton, E. D. Demaine, M. L. Demaine, V. Dujmović, P. Morin, and R. Uehara
"Ghost Chimneys".
International Journal of Computational Geometry and Applications (IJCGA), vol. 22(3), pp. 207-214, 2012.
[pdf]

[23]

S. Collette, V. Dujmović, J. Iacono, S. Langerman, and P. Morin
"Entropy, triangulation, and point location in planar subdivisions".
ACM Transactions on Algorithms, vol. 8(3), article num. 29, 2012.
[arXiv] [pdf]

[24]

V. Dujmović, J. Howat, and P. Morin
"Biased Range Trees".
Algorithmica, vol. 62(1), pp. 21-37, 2012.
[arXiv] [pdf]

[25]

P. Bose, K. Douieb, V. Dujmović, and J. Howat
"Layered Working-Set Trees".
Algorithmica, 63(1), pp. 476-489, 2012.
[arXiv] [pdf]

[26]

D. Chen, L. Devroye, V. Dujmović, and P. Morin
"Memoryless Routing in Convex Subdivisions: Random Walks Are Optimal".
Computational Geometry: Theory and Applications (CGTA), 45(4), pp. 178-185, 2012
[arXiv] [pdf]

[27]

B. Ballinger, N. Benbernou, P. Bose, M. Damian, E. D. Demaine, V. Dujmović, R. Flatland, F. Hurtado, J. Iacono, A. Lubiw, P. Morin, V. Sacristan, D. Souvaine, and R. Uehara
"Coverage with k-transmitters in the presence of obstacle".
Journal of Combinatorial Optimization
25(2): 208-233, 2013.
Special issue of selected papers from COCOA 2010.
[pdf]

[28]

V. Dujmović, G. Fijavz, G. Joret, T. Sulanke, and D. R. Wood
"On the maximum number of cliques in a graph embedded in a surface". ,
European J. Combinatorics 32.8:1244-1252, 2011.
[arXiv] [publication] [pdf]

[29]

V. Dujmović, and D. R. Wood,
"On the book thickness of k-trees".
Discrete Maths. & Theoretical Computer Science 13.3:39-44, 2011.
[arXiv] [pdf]

[30]

V. Dujmović, J. Gudmundsson, P. Morin, and T. Wolle
"Notes on large angle crossing graphs".
Chicago Journal of Theoretical Computer Science , Article 4, 2011.
Special issue of selected papers from CATS 2010.
[arXiv] [pdf]

[31]

P. Bose, O. Cheong, and V. Dujmović
"A note on the perimeter of fat objects".
Computational Geometry: Theory and Applications, (CGTA) vol. 44(1), pp.163-166, 2010.
[pdf]

[32]

Z. Abel, B. Ballinger, P. Bose, S. Collette, V. Dujmović, F. Hurtado, S. D. Kominers, S. Langerman, A. Pór, and D. R. Wood
"Every large point set contains many collinear points or an empty pentagon".
Graphs and Cdombinatorics, vol. 27(1), pp. 47-60, 2011.
[arXiv] [pdf]

[33]

P. Bose, V. Dujmović, F. Hurtado, S. Langerman, P. Morin, and D. R. Wood
"A polynomial bound for untangling geometric planar graphs".
Discrete and Computational Geometry , (DCG) vol. 42(4) pp. 570-585, 2009.
[arXiv] [pdf]©Springer

[34]

P. Carmi, V. Dujmović, P. Morin, and D. R. Wood
"Distinct distances in graph drawings".
The Electronic Journal of Combinatorics, 15:R107, 2008.
[arXiv] [pdf]

[35]

P. Bose, V. Dujmović, D. Krizanc, S. Langerman, P. Morin, D. R. Wood and S. Wuhrer
"A Characterization of the Degree Sequences of 2-Trees",
Journal of Graph Theory, vol 58(3), pp.191-209, 2008.
[pdf] [ps.gz]]©Wiley

[36]

V. Dujmović, and D. R. Wood
"Graph Treewidth and Geometric Thickness Parameters",
Discrete and Computational Geometry, (DCG) vol 37(4), pp. 641-670, 2007.
[pdf] [ps.gz]©Springer

[37]

P. Bose, V. Dujmović, F. Hurtado and P. Morin
"Connectivity-Preserving Transformations of Binary Images",
Computer Vision and Image Understanding, Special issue dedicated to the memory of Azriel Rosenfeld, vol. 6(2), pp. 313-323, 2008.
[pdf] [ps.gz] ©Elsevier

[38]

V. Dujmović, M. Fellows, M. Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F. Rosamond, S. Whitesides, and D. R. Wood
"On the Parameterized Complexity of Layered Graph Drawing",
Algorithmica, vol. 52(2), pp. 267-292, 2008.
[ps.gz]©Springer

[39]

V. Dujmović, D. Eppstein, M. Suderman and D. R. Wood
"Drawings of Planar Graphs with Few Slopes and Segments",
Computational Geometry: Theory and Applications (CGTA), vol. 38, pp. 194-212, 2007.
[pdf] [ps.gz] ©Elsevier

[40]

V. Dujmović, M. Suderman and D. R. Wood
"Graph Drawings with Few Slopes",
Computational Geometry: Theory and Applications (CGTA), vol. 38, pp. 181-193, 2007.
[pdf] [ps.gz] ©Elsevier

[41]

V. Dujmović, H. Fernau and M. Kaufmann
"Fixed Parameter Algorithms for one-sided crossing minimization -- Revisited",
Journal of Discrete Algorithms, vol 6(2), pp. 313-323, 2008.
[pdf] [ps.gz] ©Elsevier

[42]

H. Brönnimann, O. Devillers, V. Dujmović, H. Everett, M. Glisse, X. Goaoc, S. Lazard, H.-S. Na, and S. Whitesides
"On the Number of maximal free line segments Tangent to Arbitrary Three-dimensional Convex Polyhedra",
SIAM Journal on Computing, vol. 37(2), pp. 522--551, 2007.
[pdf] [ps.gz] ©SIAM Press

[43]

V. Dujmović, and D. R. Wood
"Upward Three-Dimensional Grid Drawings of Graphs",
Order, vol 23, pp. 1-20, 2006.
[pdf] [ps.gz] ©Springer

[44]

O. Devillers, V. Dujmović, H. Everett, S. Hornus, S. Whitesides and S. Wismath
"Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint",
International Journal of Computational Geometry and Applications (IJCGA), vol. 17(4), pp. 297-304, 2007.
[pdf] [ps.gz]

[45]

P. Bose, V. Dujmović, and D. R. Wood
"Induced Subgraphs of Bounded Degree and Bounded Treewidth",
Contributions to Discrete Mathematics, vol 1(1), pp. 88-105, 2006.
[pdf] [ps.gz]

[46]

V. Dujmović and D. R. Wood
"Stacks, queues and tracks: Layouts of graph subdivisions",
Discrete Mathematics and Theoretical Computer Science (DMTCS), vol 7, pp. 155-202, 2005.
[pdf] [ps.gz] ©DMTCS

[47]

V. Dujmović, P. Morin, and D. R. Wood
"Layout of graphs with bounded tree-width",
SIAM Journal on Computing, vol 34 (3), pp. 553-579, 2005.
[pdf] [ps.gz] ©SIAM Press

[48]

V. Dujmović, M. Fellows, M. Hallett, M. Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F. Rosamond, M. Suderman, S. Whitesides, and D. R. Wood
"A Fixed-Parameter Approach to Two-Layer Planarization",
Algorithmica, vol 45. pp. 159-182, 2006.
[pdf] [ps.gz] ©Springer

[49]

V. Dujmović, A. Pór and D. R. Wood
"Track layouts of graphs",
Discrete Mathematics and Theoretical Computer Science (DMTCS), vol 6(2), pp. 497-522, 2004.
[pdf] [ps.gz] ©DMTCS

[50]

V. Dujmović and D. R. Wood
"On linear layouts of graphs",
Discrete Mathematics and Theoretical Computer Science (DMTCS), vol. 6(2), pp. 339-358, 2004.
[pdf] [ps.gz] ©DMTCS

[51]

V. Dujmović and S. Whitesides
"An efficient fixed parameter tractable algorithm for 1-sided crossing minimization",
Algorithmica, vol. 40(1), pp. 15-31, 2004.
[ps.gz] ©Springer

[52]

O. Devillers, V. Dujmović, H. Everett, X. Goaoc, S. Lazard, H-S. Na, S. Petitjean
"The expected number of 3D visibility events is linear",
SIAM Journal on Computing, vol. 32(6), pp. 1586-1620, 2003.
[pdf] [ps.gz] ©SIAM Press

[53]

O. Aichholzer, C. Cortés , V. Dujmović, E. Demaine, J. Erickson, H. Meijer, M. Overmars, B. Palop, S. Ramaswami, and G. Toussaint
"Flipturning polygons",
Discrete and Computational Geometry (DCG), vol. 28, pp. 231-253, 2002.
[pdf] [ps.gz]

[54]

V. Dujmović and D. R. Wood
"Three-dimensional grid drawings with sub-quadratic volume",
In Towards a Theory of Geometric Graphs (János Pach, ed.), Contemporary Mathematics vol. 342, American Mathematical Society, pp. 55-66, 2004.
[pdf] [ps.gz] ©AMS Press

[55]

V. Dujmović and S. Whitesides
"Three-dimensional drawing algorithms",
Invited Chapter in Handbook of Graph Drawing and Visualization, Roberto Tamassia Editor, CRC Press, 455-489, 2013.
Preprint at [Handbook] [pdf]

[56]

V. Dujmović
"On Utility of Untangling".
In Proceedings of International Symposium on Graph Drawing and Network Visualization (GD 2015), to appear, 2015.
[arXiv]

[57]

V. Dujmović, D. Eppstein, and D. R. Wood
"Genus, Treewidth, and Local Crossing Number",
In Proceedings of International Symposium on Graph Drawing and Network Visualization (GD 2015), to appear, 2015.
[arXiv]

[58]

G. Aloupis, L. Barba, P. Carmi, V. Dujmović, F. Frati, and P. Morin
"Compatible connectivity augmentation of planar disconnected graphs",
In Proceedings of the 26th ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), 486-496, 2015

[59]

V. Dujmović, P. Morin, and D. R. Wood,
"Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive Coloring".
In Proceedings of the IEEE Annual Symposium on Foundations of Computer Science (FOCS 2013), 280-289, 2013.

[60]

P. Bose, V. Dujmović, P. Morin, and M. Smid
"Robust Geometric Spanners"
In Proceedings of 29th ACM Symposium on Computational Geometry (SoCG 2013), 449-458, 2013.
(See [7] for the full paper.)

[61]

G. Biau, L. Devroye, V. Dujmović, and A. Krzyzak
"An Affine Invariant k-Nearest Neighbor Regression Estimate".
In Proceedings of the IEEE International Symposium on Information Theory (ISIT'12). pp. 1445-1447, 2012.
(See [12] for the full paper.)

[62]

V. Dujmović, and S. Langerman
"A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing". In Proceedings of 27th ACM Symposium on Computational Geometry (SoCG 2011), pp. 117-124, 2011.
Invited to a special issue of Discrete & Computational Geometry (DCG).
(See [10] for the full paper.)
[arXiv] [pdf]

[63]

V. Dujmović, W. Evans, S. Lazard, W. Lenhart, G. Liotta, D. Rappaport and S. Wismat
"On Point-sets that Support Planar Graphs",
In Proceedings of the 19th International Symposium on Graph Drawing, (GD'11), vol. 7034 of LNCS, pp. 64-74, 2012.
(See [14] for the full paper.)
[pdf]

[64]

P. Bose, K. Douieb, V. Dujmović, and R. Fagerberg
"An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times".
In Proceedings of 12th Scandinavian Symposium and Workshops on Algorithm Theory, (SWAT), pp. 38-49, 2010.
[pdf]

[65]

V. Dujmović, W. Evans, S. Kobourov, G. Liotta, C. Weibel, and S. Wismath
"On Graphs Supported by Line Sets".
In Proceedings of the 18th International Symposium on Graph Drawing, (GD'10), vol. 6502, pp. 177-182, 2011.
[pdf]

[66]

P. Bose, K. Douieb, V. Dujmović, and J. Howat
"Layered Working-Set Trees".
In Proceedings of the Latin American Theoretical Informatics Symposium (LATIN), vol. 6034 of LNCS, pp. 686-696, 2010.
(See [18] for the full paper.)
[arXiv] [pdf]

[67]

V. Dujmović, J. Gudmundsson, P. Morin, and T. Wolle
"Notes on large angle crossing graphs".
In Proceedings of the 16th Symposium on Computing: The Australasian Theory (CATS), vol. 109, pp. 19-24, 2010.
(See [23] for the full paper.)
[arXiv] [pdf]

[68]

B. Ballinger, N. Benbernou, P. Bose, M. Damian, E. D. Demaine, V. Dujmović, R. Flatland, F. Hurtado, J. Iacono, A. Lubiw, P. Morin, V. Sacristan, D. Dubrule, and R. Uehara
"Coverage with k-transmitters in the presence of obstacle".
In Proceedings of the 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA'10), vol. 6509, pp. 1-15.
(See [19] for the full paper.)
[pdf]

[69]

V. Dujmović, J. Howat, and P. Morin
"Biased Range Trees".
In Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms (SODA'09), pp. 486-496, 2009.
(See [26] for the full paper.)
[pdf] ©SIAM Press

[70]

V. Dujmović, K. Kawarabayashi, B. Mohar and D. R. Wood
"Improved Upper Bounds on the Crossing Number".
In Proceedings of the 24th ACM Symposium on Computational Geometry (SoCG '08), pp. 375-384, 2008.
[pdf]

[71]

S. Collette, V. Dujmović, J. Iacono, S. Langerman, and P. Morin
"Distribution-sensitive point location in convex subdivisions",
In Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms, (SODA '08), pp. 912-921, 2008.
[pdf]©SIAM Press

[72]

P. Bose, V. Dujmović, F. Hurtado, S. Langerman, P. Morin, and D. R. Wood
"A polynomial bound for untangling geometric planar graphs".
In Proceedings of the Topological & Geometric Graph Theory (TGGT '08), Paris, 2008. Electronic Notes in Discrete Mathematics, vol. 31, pp. 213-218, 2008.
(See [26] for the full paper.)

[73]

P. Bose, V. Dujmović, D. Krizanc, S. Langerman, P. Morin, D. R. Wood and S. Wuhrer
"A Characterization of the Degree Sequences of 2-Trees",
In Proceedings of the 4th Workshop on Analytic Algorithms and Combinatorics (ANALCO'07), 232-241, 2007.
(See [30] for the full paper.)
[pdf] [ps.gz] ©SIAM Press

[74]

V. Dujmović, and D. R. Wood
"Graph Treewidth and Geometric Thickness Parameters",
In Proceedings of the 13th International Symposium on Graph Drawing (GD'05), vol. 3843 of LNCS, pp. 129-140, 2006.
(See [31] for the full paper.)
[pdf] ©Springer

[75]

P. Bose, V. Dujmović, and D. R. Wood
"Induced Subgraphs of Bounded Degree and Bounded Treewidth",
In Proceedings of the 31st Workshop on Graph Theoretic Concepts in Computer Science (WG'05), vol. 3787 of LNCS, pp. 175-186, 2005.
(See [40] for the full version.)
[pdf] [ps.gz] ©Springer

[76]

V. Dujmović and D. R. Wood
"Layouts of Graph Subdivisions",
In Proceedings of the 12th International Symposium on Graph Drawing (GD'04), vol. 3383 of LNCS, pp. 133-143, 2004.
(See [41] for the full paper.)
[pdf] ©Springer

[77]

V. Dujmović, M. Suderman and D. R. Wood
"Really Straight Graph Drawings",
In Proceedings of the 12th International Symposium on Graph Drawing (GD'04), vol. 3383 of LNCS, pp. 122-132, 2004.
(See [34] and [35] for the full papers.)
[pdf] ©Springer

[78]

H. Brönnimann, O. Devillers, V. Dujmović, H. Everett, M. Glisse, X. Goaoc, S. Lazard, H.-S. Na, and S. Whitesides
"The number of lines tangent to arbitrary convex polyhedra in 3D",
In Proceedings of the 20th ACM Symposium on Computational Geometry (SoCG'04), pp. 46-55, 2004.
(See [37] for the full paper.)
[pdf] ©ACM Press

[79]

V. Dujmović and D. R. Wood
"Three-dimensional grid drawings with sub-quadratic volume",
In Proceedings of the 11th International Symposium on Graph Drawing (GD'03), vol. 2912 of LNCS, pp. 190-201, 2003.
(See [49] for a full paper.)
[pdf] [ps.gz] ©Springer

[80]

V. Dujmović, H. Fernau and M. Kaufmann
"Fixed parameter algorithms for one-sided crossing minimization revisited",
In Proceedings of the 11th International Symposium on Graph Drawing (GD'03), vol. 2912 of LNCS, pp. 332-344, 2003.
(See [36] for the full paper.)
[pdf] ©Springer

[81]

V. Dujmović and D. R. Wood
"Tree-partitions of k-trees with applications in graph layout",
In Proceedings of the 29th Workshop on Graph Theoretic Concepts in Computer Science (WG'03), vol. 2880 of LNCS, pp. 205-217, 2003.
[pdf] [ps.gz] ©Springer

[82]

V. Dujmović and S. Whitesides
"An efficient fixed parameter tractable algorithm for 1-sided crossing minimization",
In Proceedings of the 10th International Symposium on Graph Drawing (GD'02), vol. 2528 of LNCS, pp. 118-130, 2002.
(See [46] for a full paper.)
[pdf] [ps.gz] ©Springer

[83]

V. Dujmović, P. Morin and D. R. Wood
"Path-width and three-dimensional straight-line grid drawing of graphs",
In Proceedings of the 10th International Symposium on Graph Drawing (GD'02), vol. 2528 of LNCS, pp. 42-53, 2002.
[pdf] [ps.gz] ©Springer

[84]

G. Aloupis, E. Demaine, V. Dujmović, J. Erickson, S. Langerman, H. Meijer, I. Streinu, J. O'Rourke, M. Overmars, M. Soss, and G. Toussaint
"Flat-state connectivity of linkages under dihedral motions",
In Proceedings of the 13th International Symposium on Algorithms and Computation (ISAAC'02), vol.2518 of LNCS, pp. 369-380, 2002.
[pdf] [ps.gz] ©Springer

[85]

V. Dujmović, and S. Whitesides
"On validating planar worlds",
In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA'01), pp. 791-792, 2001.
[pdf] [ps.gz] ©SIAM Press

[86]

V. Dujmović, M. Fellows, M. Hallett, M. Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F. Rosamond, M. Suderman, S. Whitesides, and D. R. Wood
"A Fixed-Parameter Approach to Two Layer Planarization",
In Proceedings of the 9th International Symposium on Graph Drawing (GD'01), vol. 2265 in LNCS , pp. 1-15, 2001.
(See [43] for the full paper.)
[pdf] [ps.gz] ©Springer

[87]

V. Dujmović, M. Fellows, M. Hallett, M. Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F. Rosamond, M. Suderman, S. Whitesides, and D. R. Wood
"On the Parameterized Complexity of Layered Graph Drawing",
In Proceedings of the 9th European Symposium on Algorithms (ESA'01), vol. 2161 in LNCS , pp. 488-499, 2001.
(See [33] for the full paper.)
[pdf] [ps.gz] ©Springer

[88]

I. Rekleitis, V. Dujmović, and G. Dudek
"Efficient Topological Exploration",
In Proceedings of IEEE International Conference in Robotics and Automation (ICRA '99), pp. 676-681, IEEE Press, 1999.

[89]

P. Bose, V. Dujmović, N. Hoda, and P. Morin.
"Visibility-monotonic polygon deflation".
In Proceedings of the 24th Canadian Conference on Computational Geometry (CCCG '12), pp. 13-18, 2012.
[arXiv]

[90]

P. Bose, V. Dujmović, F. Hurtado, J. Iacono, S. Langerman, H. Meijer, V. Sacristán, M. Saumell, and D.R. Wood
"Proximity graphs: E, δ, Δ, χ and ω".
In Proceedings of the 28th European Workshop on Computational Geometry (EuroCG'12), pp. 217-220, 2012.

[91]

G. Aloupis, E. D. Demaine, M. L. Demaine, V. Dujmović, and J. Iacono
"Meshes Preserving Minimum Feature Size".
In Proceedings of the XIV Spanish Meeting on Computational Geometry (Encuentros de Geometra Computacional 2011), pp. 205--208, 2011.
[pdf].

[92]

O. Aichholzer, G. Aloupis, E. D. Demaine, M. L. Demaine, V. Dujmović, F. Hurtado, A. Lubiw, G. Rote, A. Schulz, D. L. Souvaine and A. Winslow
"Convexifying Polygons Without Losing Visibilities".
In Proceedings of the 23st Canadian Conference on Computational Geometry (CCCG '11), pp. 229-234, 2011.
[pdf]

[93]

P. Bose, O. Cheong, and V. Dujmović
"A note on the perimeter of fat objects".
In Proceedings of the 22st Canadian Conference on Computational Geometry (CCCG '10), pp. 163-166, 2010.
(See [25] for the full paper.)
[pdf]

[94]

P. Bose, K. Douieb, V. Dujmović, J. Howat, and P. Morin
"Fast Local Searches and Updates in Bounded Universes".
In Proceedings of the 22st Canadian Conference on Computational Geometry (CCCG '10), pp. 261-264, 2010. Invited to a special issue of Comp. Geom.: Theory and Appl. (CGTA).
(See [17] for the full paper.)
[pdf]

[95]

D. Charlton, E. D. Demaine, M. L. Demaine, V. Dujmović, P. Morin, and R. Uehara
"Ghost Chimneys".
In Proceedings of the 22st Canadian Conference on Computational Geometry (CCCG '10), pp. 63-66, 2010.
[pdf]

[96]

D. Chen, L. Devroye, V. Dujmović, and P. Morin
"Memoryless Routing in Convex Subdivisions: Random Walks Are Optimal".
In Proceedings of the 26th European Workshop on Computational Geometry (EuroCG '10), pp. 109-113, 2010.
(See [24] for the full paper.)

[97]

P. Bose, L. Devroye, K. Douieb, V. Dujmović, J. King, and P. Morin
"Odds-on trees". Preprint, February 2010.
[arXiv] [note].

[98]

G. Aloupis, P. Bose, S. Collette, E. D. Demaine, M. L. Demaine, K. Douieb, V. Dujmovic, J. Iacono, S. Langerman, and P. Morin
"Common unfoldings of polyominoes and polycubes".
In Revised Papers from the China-Japan Joint Conference on Computational Geometry, Graphs and Applications} (CGGA 2010), LNCS vol. 7033, pp. 44-54.
[pdf]

[99]

Z. Abel, B. Ballinger, P. Bose, S. Collette, V. Dujmović, F. Hurtado, S. D. Kominers, S. Langerman, A. Pór, and D. R. Wood
"Every large point set contains many collinear points or an empty pentagon".
In Proceedings of the 21st Canadian Conference on Computational Geometry (CCCG '09), pp. 99-102, 2009.
(See [27] for the full paper.)
[pdf]

[100]

G. Aloupis, P. Bose, V. Dujmović, C. Gray, S. Langerman, and B. Speckmann
"Guarding Fat Polygons and Triangulating Guarded Polygons",
In Proceedings of the 20th Canadian Conference on Computational Geometry (CCCG'08), pp. 107-110, 2008.
(See [21] for the full paper.)
[pdf]

[101]

M. Damian, E. Demaine, M. Demaine, V. Dujmović, D. El-Khechen, R. Flatland, J. Iacono, S. Langerman, H. Meijer, S. Ramaswami, D. Souvaine, P. Taslakian and G. Toussaint
"Curves in the Sand: Algorithmic Drawing",
In Proceedings of the 18h Canadian Conference on Computational Geometry (CCCG'06), pp. 11-15, 2006.
[pdf]

[102]

O. Devillers, V. Dujmović, H. Everett, S. Hornus, S. Whitesides and S. Wismath
"Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint",
In Proceedings of the 17th Canadian Conference on Computational Geometry, (CCCG'05), pp. 302-305, 2005.
(See [39] for the full paper.)
[pdf] [ps]

[103]

H. Brönnimann, O. Devillers, V. Dujmović, H. Everett, M. Glisse, X. Goaoc, S. Lazard, H.-S. Na, and S. Whitesides
"On the number of lines tangent to four convex polyhedra",
In Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG'02), pp. 113-117, 2002.
[pdf] [ps]

[104]

O. Aichholzer, C. Cortés , V. Dujmović, E. Demaine, J. Erickson, H. Meijer, M. Overmars, B. Palop, S. Ramaswami, and G. Toussaint
"Flipturning polygons",
In Proceedings of Japan Conference on Discrete and Computational Geometry (JCDCG'00)}, pp. 107-108, 2000.
(See [48] for the full paper.)
[pdf] [ps.gz] ©Springer