## Journal papers

• ### Compatible connectivity augmentation of planar disconnected graphs

, , , , , and .
Discrete & Computational Geometry, 54(2):459–480, 2015.
Preliminary version appeared at SODA 2015.
@article{augmentation,
author={G. Aloupis and L. Barba and P. Carmi and V. Dujmovi\'c and F. Frati and P. Morin},
title={Compatible Connectivity Augmentation of Planar Disconnected Graphs},
journal={Discrete {\&} Computational Geometry},
year={2015},
volume={54},
number={2},
pages={459--480},
note={Preliminary version appeared at SODA 2015}
}

• ### Visibility-monotonic polygon deflation

, , , and .
Contributions to Discrete Mathematics, 10(1):1–21, 2015.
Preliminary version appears in Proceedings of CCCG 2012.
@article{monovis,
author={P. Bose and V. Dujmovi\'c and N. Hoda and P. Morin},
title={Visibility-Monotonic Polygon Deflation},
journal={Contributions to Discrete Mathematics},
year={2015},
volume={10},
number={1},
pages={1--21},
note={Preliminary version appears in Proceedings of CCCG 2012}
}

• ### On obstacle numbers

and .
Electronic Journal of Combinatorics, 22(3), 2015.
P3.1 (7 pages).
@article{onobstacles,
author={V. Dujmovi\'c and P. Morin},
title={On Obstacle Numbers},
journal={Electronic Journal of Combinatorics},
year={2015},
volume={22},
number={3},
note={P3.1 (7 pages)}
}

• ### Average stretch factor: how low does it go?

, , and .
Discrete & Computational Geometry, 53(2):296–326, 2015.
@article{avgstretch,
author={V. Dujmovi\'c and P. Morin and M. Smid},
title={Average Stretch Factor: How Low Does It Go?},
journal={Discrete {\&} Computational Geometry},
year={2015},
volume={53},
number={2},
pages={296--326}
}

• ### The $\Theta_5$ graph is a spanner

, , , and .
Computational Geometry: Theory and Applications, 48(2):108–119, 2015.
Preliminary version appears in Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2013).
@article{theta5,
author={P. Bose and P. Morin and A. van Renssen and S. Verdonschot},
title={The {$\Theta_5$} Graph is a Spanner},
journal={Computational Geometry: Theory and Applications},
year={2015},
volume={48},
number={2},
pages={108--119},
note={Preliminary version appears in Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2013)}
}

• ### Crossings in grid drawings

, , and .
Electronic Journal of Combinatorics, 21(1), 2014.
P1.41 (18 pages).
@article{3dcrossings,
author={V. Dujmovi\'c and P. Morin and A. Sheffer},
title={Crossings in Grid Drawings},
journal={Electronic Journal of Combinatorics},
year={2014},
volume={21},
number={1},
note={P1.41 (18 pages)}
}

• ### Robust geometric spanners

, , , and .
SIAM Journal on Computing, 42(4):1720–1736, 2013.
Preliminary version appears in Proceedings of the Twenty-Ninth ACM Symposium on Computational Geometry (SoCG 2013), ACM Press, 2013.
@article{giant,
author={P. Bose and V. Dujmovi\'c and P. Morin and M. Smid},
title={Robust Geometric Spanners},
journal={SIAM Journal on Computing},
year={2013},
volume={42},
number={4},
pages={1720--1736},
note={Preliminary version appears in Proceedings of the Twenty-Ninth ACM Symposium on Computational Geometry (SoCG 2013), ACM Press, 2013}
}

• ### Approximating majority depth

and .
Computational Geometry: Theory and Applications, 46(9):1059–1064, 2013.
Special issue of selected papers from CCCG 2012.
@article{major2,
author={D. Chen and P. Morin},
title={Approximating Majority Depth},
journal={Computational Geometry: Theory and Applications},
year={2013},
volume={46},
number={9},
pages={1059--1064},
note={Special issue of selected papers from CCCG 2012}
}

• ### Absolute approximation of Tukey depth: theory and experiments

, , and .
Computational Geometry: Theory and Applications, 46(5):566–573, 2013.
Special issue on Geometric Optimization.
@article{tkapprox,
author={D. Chen and P. Morin and U. Wagner},
title={Absolute approximation of {T}ukey depth: Theory and experiments},
journal={Computational Geometry: Theory and Applications},
year={2013},
volume={46},
number={5},
pages={566--573},
note={Special issue on Geometric Optimization}
}

• ### Coverage with $k$-transmitters in the presence of obstacles

, , , , , , , , , , , , , and .
Journal of Combinatorial Optimization, 25(2):208–233, March 2013.
Preliminary version appears in Proceedings of the 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA2010), Part II: 1-15, 2010.
@article{transmitters-dummy,
author={B. Ballinger and N. Benbernou and P. Bose and M. Damian and E. D. Demaine and V. Dujmovi\'c and R. Flatland and F. Hurtado and J. Iacono and A. Lubiw and P. Morin and V. Sacrist\'an and D. Souvaine and R. Uehara},
title={Coverage with {$k$}-Transmitters in the Presence of Obstacles},
journal={Journal of Combinatorial Optimization},
year={2013},
volume={25},
number={2},
pages={208--233},
month={March},
note={Preliminary version appears in Proceedings of the 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA2010), Part II: 1-15, 2010}
}

• ### Oja centers and centers of gravity

, , , , and .
Computational Geometry: Theory and Applications, 46(2):140–147, 2013.
Special issue of selected papers from CCCG 2010.
@article{oja,
author={D. Chen and O. Devillers and J. Iacono and S. Langerman and P. Morin},
title={{O}ja Centers and Centers of Gravity},
journal={Computational Geometry: Theory and Applications},
year={2013},
volume={46},
number={2},
pages={140--147},
note={Special issue of selected papers from CCCG 2010}
}

• ### Fast local searches and updates in bounded universes

, , , , and .
Computational Geometry: Theory and Applications, 46(2):181–189, 2013.
Special issue of selected papers from CCCG 2010.
@article{loglogd,
author={P. Bose and K. Douïeb and V. Dujmovi\'c and J. Howat and P. Morin},
title={Fast Local Searches and Updates in Bounded Universes},
journal={Computational Geometry: Theory and Applications},
year={2013},
volume={46},
number={2},
pages={181--189},
note={Special issue of selected papers from CCCG 2010}
}

• ### Ghost chimneys

, , , , , and .
International Journal of Computational Geometry and Applications, 22(3):207–214, 2012.
Preliminary version appears in Proceedings of CCCG 2010.
@article{chimneys,
author={D. Charlton and E. D. Demaine and M. L. Demaine and V. Dujmovi\'c and P. Morin and R. Uehara},
title={Ghost Chimneys},
journal={International Journal of Computational Geometry and Applications},
year={2012},
volume={22},
number={3},
pages={207--214},
note={Preliminary version appears in Proceedings of CCCG 2010}
}

• ### Entropy, triangulation, and point location in planar subdivisions

, , , , and .
ACM Transactions on Algorithms, 8(3):29:1–29:18, 2012.
@article{entropy2,
author={S. Collette and V. Dujmovi\'c and J. Iacono and S. Langerman and P. Morin},
title={Entropy, Triangulation, and Point Location in Planar Subdivisions},
journal={ACM Transactions on Algorithms},
year={2012},
volume={8},
number={3},
pages={29:1--29:18}
}

• ### Skip lifts: a probabilistic alternative to red-black trees

, , and .
Journal of Discrete Algorithms, 14:13–20, 2012.
Special issue of selected papers from the International Workshop on Combinatorial Algorithms (IWOCA 2010).
@article{skiplifts,
author={P. Bose and K. Douïeb and P. Morin},
title={Skip Lifts: A Probabilistic Alternative to Red-Black Trees},
journal={Journal of Discrete Algorithms},
year={2012},
volume={14},
pages={13--20},
note={Special issue of selected papers from the International Workshop on Combinatorial Algorithms (IWOCA 2010)}
}

• ### A distribution-sensitive dictionary with low space overhead

, , and .
Journal of Discrete Algorithms, 10:140–145, 2012.
Preliminary version appears in Proceedings of the 16th International Workshop on Algorithms and Data Structures (WADS 2009), LNCS, pages 110-118. Springer, 2009..
@article{succprop,
author={P. Bose and J. Howat and P. Morin},
title={A Distribution-Sensitive Dictionary with Low Space Overhead},
journal={Journal of Discrete Algorithms},
year={2012},
volume={10},
pages={140--145},
note={Preliminary version appears in Proceedings of the 16th International Workshop on Algorithms and Data Structures (WADS 2009), LNCS, pages 110-118. Springer, 2009.}
}

• ### Succinct geometric indexes supporting point location

, , , , and .
ACM Transactions on Algorithms, 8(2):10:1–10:26, April 2012.
Preliminary version appeared in Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), pages 635-644, 2009.
@article{succinctpl,
author={P. Bose and E. Chen and M. He and A. Maheshwari and P. Morin},
title={Succinct Geometric Indexes Supporting Point Location},
journal={ACM Transactions on Algorithms},
year={2012},
volume={8},
number={2},
pages={10:1--10:26},
month={April},
note={Preliminary version appeared in Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), pages 635-644, 2009}
}

• ### Memoryless routing in convex subdivisions: random walks are optimal

, , , and .
Computational Geometry: Theory and Applications, 45(4):178–185, 2012.
Preliminary version appears at EuroCG 2010.
@article{convobl,
author={D. Chen and V. Dujmovi\'c and L. Devroye and P. Morin},
title={Memoryless Routing in Convex Subdivisions: Random Walks are Optimal},
journal={Computational Geometry: Theory and Applications},
year={2012},
volume={45},
number={4},
pages={178--185},
note={Preliminary version appears at EuroCG 2010}
}

• ### Biased range trees

, , and .
Algorithmica, 62(1):21–37, 2012.
Preliminary version appeared in Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), pages 486--495, 2009..
@article{rangetrees,
author={V. Dujmovi\'c and J. Howat and P. Morin},
title={Biased range trees},
journal={Algorithmica},
year={2012},
volume={62},
number={1},
pages={21--37},
note={Preliminary version appeared in Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), pages 486--495, 2009.}
}

• ### Notes on large angle crossing graphs

, , , and .
Chicago Journal of Theoretical Computer Science, 2011.
Special issue of selected papers from Computing: The Australasian Theory Symposium (CATS 2010).
@article{lac,
author={V. Dujmovi\'c and J. Gudmundsson and P. Morin and T. Wolle},
title={Notes on Large Angle Crossing Graphs},
journal={Chicago Journal of Theoretical Computer Science},
year={2011},
note={Special issue of selected papers from Computing: The Australasian Theory Symposium (CATS 2010)}
}

• ### Delaunay triangulation of imprecise points simplified and extended

, , , and .
Algorithmica, 61(3):674–693, 2011.
Preliminary version appears in Proceedings of the 16th International Workshop on Algorithms and Data Structures (WADS 2009), LNCS. Springer, 2009..
@article{impdel,
author={K. Buchin and M. L\"offler and W. Mulzer and P. Morin},
title={Delaunay Triangulation of Imprecise Points Simplified and Extended},
journal={Algorithmica},
year={2011},
volume={61},
number={3},
pages={674--693},
note={Preliminary version appears in Proceedings of the 16th International Workshop on Algorithms and Data Structures (WADS 2009), LNCS. Springer, 2009.}
}

• ### Randomized rendez-vous with limited memory

, , and .
ACM Transactions on Algorithms, 7(3):34:1–34:12, July 2011.
Preliminary version appears in Proceedings of the 8th Latin American Theoretical Informatics Symposium (LATIN2008), pages 605-616, 2008..
@article{rendezvous,
author={E. Kranakis and D. Krizanc and P. Morin},
title={Randomized Rendez-Vous with Limited Memory},
journal={ACM Transactions on Algorithms},
year={2011},
volume={7},
number={3},
pages={34:1--34:12},
month={July},
note={Preliminary version appears in Proceedings of the 8th Latin American Theoretical Informatics Symposium (LATIN2008), pages 605-616, 2008.}
}

• ### A generalized Winternitz theorem

, , , and .
Journal of Geometry, 100:29–35, 2011.
@article{winternitz,
author={P. Bose and P. Carmi and F. Hurtado and P. Morin},
title={A Generalized {W}internitz Theorem},
journal={Journal of Geometry},
year={2011},
volume={100},
pages={29--35}
}

• ### Algorithms for marketing-mix optimization

, , and .
Algorithmica, 60(4), 2011.
@article{pricing,
author={J. Gudmundsson and P. Morin and M. Smid},
title={Algorithms for Marketing-Mix Optimization},
journal={Algorithmica},
year={2011},
volume={60},
number={4}
}

• ### Sigma-local graphs

, , , , , and .
Journal of Discrete Algorithms, 8:15–23, 2010.
@article{sigma,
author={P. Bose and S. Collette and S. Langerman and A. Maheshwari and P. Morin and M. Smid},
title={Sigma-Local Graphs},
journal={Journal of Discrete Algorithms},
year={2010},
volume={8},
pages={15--23}
}

• ### On the expected maximum degree of Gabriel and Yao graphs

, , and .
Advances in Applied Probability, 41(4):1123–1140, 2009.
@article{proxdegree,
author={L. Devroye and J. Gudmundsson and P. Morin},
title={On the Expected Maximum Degree of {G}abriel and {Y}ao Graphs},
year={2009},
volume={41},
number={4},
pages={1123--1140}
}

• ### A polynomial bound for untangling geometric planar graphs

, , , , , and .
Discrete & Computational Geometry, 42(2):570–585, 2009.
Preliminary version appeared at Topological and Geometric Graph Theory (TGGT 2008).
@article{untangling,
author={P. Bose and V. Dujmovi\'c and F. Hurtado and S. Langerman and P. Morin and D. R. Wood},
title={A polynomial bound for untangling geometric planar graphs},
journal={Discrete {\&} Computational Geometry},
year={2009},
volume={42},
number={2},
pages={570--585},
note={Preliminary version appeared at Topological and Geometric Graph Theory (TGGT 2008)}
}

• ### Clamshell casting

, , , and .
Algorithmica, 55(4):666–702, 2009.
Preliminary version appears in Proceedings of CAD’07.
@article{clamshell3d,
author={P. Bose and P. Morin and M. Smid and S. Wuhrer},
title={Clamshell Casting},
journal={Algorithmica},
year={2009},
volume={55},
number={4},
pages={666--702},
note={Preliminary version appears in Proceedings of CAD'07}
}

• ### Connectivity-preserving transformations of binary images

, , , and .
Computer Vision and Image Understanding, 113(10):1027–1104, October 2009.
@article{pixels,
author={P. Bose and V. Dujmovi\'c and F. Hurtado and P. Morin},
title={Connectivity-Preserving Transformations of Binary Images},
journal={Computer Vision and Image Understanding},
year={2009},
volume={113},
number={10},
pages={1027--1104},
month={October}
}

• ### Algorithms for optimal outlier removal

, , , , , , , and .
Journal of Discrete Algorithms, 7:239–248, 2009.
@article{outliers2,
author={R. Atanassov and P. Bose and M. Couture and A. Maheshwari and P. Morin and M. Paquette and M. Smid and S. Wuhrer},
title={Algorithms for Optimal Outlier Removal},
journal={Journal of Discrete Algorithms},
year={2009},
volume={7},
pages={239--248}
}

• ### Rotationally monotone polygons

, , , and .
Computational Geometry: Theory and Applications, 42:471–483, 2009.
@article{clamshell2d,
author={P. Bose and P. Morin and M. Smid and S. Wuhrer},
title={Rotationally Monotone Polygons},
journal={Computational Geometry: Theory and Applications},
year={2009},
volume={42},
pages={471--483},
}

• ### Centerpoint theorems for wedges

, , and .
Discrete Mathematics & Theoretical Computer Science, 11(1):45–54, 2009.
@article{wedges,
author={J. Erickson and F. Hurtado and P. Morin},
title={Centerpoint Theorems for Wedges},
journal={Discrete Mathematics {\&} Theoretical Computer Science},
year={2009},
volume={11},
number={1},
pages={45--54}
}

• ### Spanners of complete $k$-partite geometric graphs

, , , , , and .
SIAM Journal on Computing, 38(5):1803–1820, 2009.
Preliminary version appears in Proceedings of the 8th Latin American Theoretical Informatics Symposium (LATIN2008), 2008..
@article{bispanners,
author={P. Bose and P. Carmi and M. Couture and A. Maheshwari and P. Morin and M. Smid},
title={Spanners of Complete {$k$}-Partite Geometric Graphs},
journal={SIAM Journal on Computing},
year={2009},
volume={38},
number={5},
pages={1803--1820},
note={Preliminary version appears in Proceedings of the 8th Latin American Theoretical Informatics Symposium (LATIN2008), 2008.}
}

• ### A characterization of the degree sequences of 2-trees

, , , , , , and .
Journal of Graph Theory, 58(3):191–209, 2008.
Preliminary version appears in Proceedings of ANALCO 2007.
@article{twotrees,
author={P. Bose and V. Dujmovi\'c and D. Krizanc and S. Langerman and P. Morin and D. R. Wood and S. Wuhrer},
title={A Characterization of the Degree Sequences of 2-Trees},
journal={Journal of Graph Theory},
year={2008},
volume={58},
number={3},
pages={191--209},
note={Preliminary version appears in Proceedings of ANALCO 2007}
}

• ### On the false-positive rate of Bloom filters

, , , , , , , and .
Information Processing Letters, 108:210–213, 2008.
@article{bloom,
author={P. Bose and H. Guo and E. Kranakis and A. Maheshwari and P. Morin and J. Morrison and M. Smid and Y. Tang},
title={On the False-Positive Rate of {B}loom Filters},
journal={Information Processing Letters},
year={2008},
volume={108},
pages={210--213}
}

• ### Distinct distances in graph drawings

, , , and .
Electronic Journal of Combinatorics, 15(R107), August 2008.
@article{distnum,
author={P. Carmi and V. Dujmovi\'c and P. Morin and D. R. Wood},
title={Distinct Distances in Graph Drawings},
journal={Electronic Journal of Combinatorics},
year={2008},
volume={15},
number={R107},
month={August}
}

• ### Output-sensitive algorithms for Tukey depth and related problems

, , , , and .
Statistics and Computing, 18(3):259–266, September 2008.
@article{ostukey,
author={D. Bremner and D. Chen and J. Iacono and S. Langerman and P. Morin},
title={Output-Sensitive Algorithms for {T}ukey Depth and Related Problems},
journal={Statistics and Computing},
year={2008},
volume={18},
number={3},
pages={259--266},
month={September}
}

• ### An optimal randomized algorithm for $d$-variate zonoid depth

.
Computational Geometry: Theory and Applications, 39(3):229–235, 2008.
@article{zonoidd,
author={P. Morin},
title={An Optimal Randomized Algorithm for {$d$}-Variate Zonoid Depth},
journal={Computational Geometry: Theory and Applications},
year={2008},
volume={39},
number={3},
pages={229--235}
}

• ### Computing the detour and spanning ratio of paths, trees and cycles in 2d and 3d

, , , , , , and .
Discrete & Computational Geometry, 39(1):17–37, 2008.
Related results are contained in Conference Paper \cite{detour}.
@article{detour2,
author={P. K. Agarwal and R. Klein and C. Knauer and S. Langerman and P. Morin and M. Sharir and M. Soss},
title={Computing the Detour and Spanning Ratio of Paths, Trees and Cycles in 2D and 3D},
journal={Discrete {\&} Computational Geometry},
year={2008},
volume={39},
number={1},
pages={17--37},
note={Related results are contained in Conference Paper \cite{detour}}
}

• ### Realizing partitions respecting full and partial order information

, , , , , , and .
Journal of Discrete Algorithms, 6:51–58, 2008.
Preliminary version appears in Proceedings of the Australasian Workshop on Combinatorial Algorithms (AWOCA 2005), pages 105-114, 2005.
@article{realizing,
author={E. D. Demaine and J. Erickson and D. Krizanc and H. Meijer and P. Morin and M. Overmars and S. Whitesides},
title={Realizing Partitions Respecting Full and Partial Order Information},
journal={Journal of Discrete Algorithms},
year={2008},
volume={6},
pages={51--58},
note={Preliminary version appears in Proceedings of the Australasian Workshop on Combinatorial Algorithms (AWOCA 2005), pages 105-114, 2005}
}

• ### Unfolding polyhedral bands

, , , , , , and .
Computational Geometry: Theory and Applications, 39(1):30–42, 2008.
Special issue of selected papers from The 16th Canadian Conference on Computational Geometry (CCCG 2004), 2004..
@article{band,
author={G. Aloupis and E. D. Demaine and S. Langerman and P. Morin and J. O'Rourke and I. Streinu and G. T. Toussaint},
title={Unfolding Polyhedral Bands},
journal={Computational Geometry: Theory and Applications},
year={2008},
volume={39},
number={1},
pages={30--42},
note={Special issue of selected papers from The 16th Canadian Conference on Computational Geometry (CCCG 2004), 2004.}
}

• ### Algorithms for bivariate zonoid depth

and .
Computational Geometry: Theory and Applications, 39(1):2–13, 2008.
Special issue of selected papers from the 16th Canadian Conference on Computational Geometry (CCCG 2004).
@article{zonoid,
author={H. Gopala and P. Morin},
title={Algorithms for Bivariate Zonoid Depth},
journal={Computational Geometry: Theory and Applications},
year={2008},
volume={39},
number={1},
pages={2--13},
note={Special issue of selected papers from the 16th Canadian Conference on Computational Geometry (CCCG 2004)}
}

• ### Reconfiguring triangulations with edge flips and point moves

, , and .
Algorithmica, 47(4):367–378, 2007.
Special issue of selected papers from the 12th International Symposium on Graph Drawing, pages 1--11, volume 3383 of LNCS, Springer-Verlag.
@article{flips2,
author={G. Aloupis and P. Bose and P. Morin},
title={Reconfiguring Triangulations with Edge Flips and Point Moves},
journal={Algorithmica},
year={2007},
volume={47},
number={4},
pages={367--378},
note={Special issue of selected papers from the 12th International Symposium on Graph Drawing, pages 1--11, volume 3383 of LNCS, Springer-Verlag}
}

• ### Geodesic ham-sandwich cuts

, , , , , and .
Discrete & Computational Geometry, 37(3):325–330, 2007.
Preliminary version appears in Proceedings of the Twentieth ACM Symposium on Computational Geometry (SoCG 2004), pages 1-9. ACM Press, 2004..
@article{geoham,
author={P. Bose and E. D. Demaine and F. Hurtado and S. Langerman and J. Iacono and P. Morin},
title={Geodesic Ham-Sandwich Cuts},
journal={Discrete {\&} Computational Geometry},
year={2007},
volume={37},
number={3},
pages={325--330},
note={Preliminary version appears in Proceedings of the Twentieth ACM Symposium on Computational Geometry (SoCG 2004), pages 1-9. ACM Press, 2004.}
}

• ### Space-efficient geometric divide-and-conquer algorithms

, , , , , and .
Computational Geometry: Theory and Applications, 37(3):209–227, 2007.
Preliminary version appears in Proceedings of the 20th European Workshop on Computational Geometry (EWCG 2004).
@article{insitu2,
author={P. Bose and A. Maheshwari and P. Morin and J. Morrison and M. Smid and J. Vahrenhold},
title={Space-Efficient Geometric Divide-and-Conquer Algorithms},
journal={Computational Geometry: Theory and Applications},
year={2007},
volume={37},
number={3},
pages={209--227},
note={Preliminary version appears in Proceedings of the 20th European Workshop on Computational Geometry (EWCG 2004)}
}

• ### Simultaneous diagonal flips in plane triangulations

, , , , and .
Journal of Graph Theory, 54(4):307–330, 2006.
Preliminary version appears in Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms, pages 212-221, 2006.
@article{flipping,
author={P. Bose and J. Czyzowicz and Z. Gao and P. Morin and D. R. Wood},
title={Simultaneous Diagonal Flips in Plane Triangulations},
journal={Journal of Graph Theory},
year={2006},
volume={54},
number={4},
pages={307--330},
note={Preliminary version appears in Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms, pages 212-221, 2006}
}

• ### Range mode and range median queries on lists and trees

, , and .
Nordic Journal of Computing, 12:1–17, 2005.
Preliminary version appears in Proceedings of the Fourteenth Annual International Symposium on Algorithms and Computation (ISAAC 2003), volume 1906 of LNCS, pages 517-526, 2003.
@article{rmmq,
author={D. Krizanc and P. Morin and M. Smid},
title={Range Mode and Range Median Queries on Lists and Trees},
journal={Nordic Journal of Computing},
year={2005},
volume={12},
pages={1--17},
note={Preliminary version appears in Proceedings of the Fourteenth Annual International Symposium on Algorithms and Computation (ISAAC 2003), volume 1906 of LNCS, pages 517-526, 2003}
}

• ### Output-sensitive algorithms for computing nearest-neighbour decision boundaries

, , , , , , and .
Discrete & Computational Geometry, 33(4):593–604, 2005.
Preliminary version appears in Proceedings of the Workshop on Algorithms and Data Structures (WADS 2003), pages 451--461, LNCS, 2748, Springer-Verlag, 2003.
@article{boundary,
author={D. Bremner and E. D. Demaine and J. Erickson and J. Iacono and S. Langerman and P. Morin and G. T. Toussaint},
title={Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries},
journal={Discrete {\&} Computational Geometry},
year={2005},
volume={33},
number={4},
pages={593--604},
note={Preliminary version appears in Proceedings of the Workshop on Algorithms and Data Structures (WADS 2003), pages 451--461, LNCS, 2748, Springer-Verlag, 2003}
}

• ### Covering things with things

and .
Discrete & Computational Geometry, 33(4):717–729, 2005.
Preliminary version appears in Proceedings of the 10th European Symposium on Algorithms (ESA 2002), pages 662--673, LNCS 2461, Springer-Verlag, 2002.
@article{covering,
author={S. Langerman and P. Morin},
title={Covering things with things},
journal={Discrete {\&} Computational Geometry},
year={2005},
volume={33},
number={4},
pages={717--729},
note={Preliminary version appears in Proceedings of the 10th European Symposium on Algorithms (ESA 2002), pages 662--673, LNCS 2461, Springer-Verlag, 2002}
}

• ### Layout of graphs with bounded tree-width

, , and .
SIAM Journal on Computing, 34(3):553–579, 2005.
@article{treewidth,
author={V. Dujmovi\'c and P. Morin and D. R. Wood},
title={Layout of Graphs with Bounded Tree-Width},
journal={SIAM Journal on Computing},
year={2005},
volume={34},
number={3},
pages={553--579}
}

• ### Three-dimensional 1-bend graph drawings

and .
Journal of Graph Algorithms and Applications, 8(3):357–366, 2004.
Preliminary version appears in Proceedings of the 16th Canadian Conference on Computational Geometry (CCCG 2004).
@article{onebend,
author={P. Morin and D. R. Wood},
title={Three-Dimensional 1-Bend Graph Drawings},
journal={Journal of Graph Algorithms and Applications},
year={2004},
volume={8},
number={3},
pages={357--366},
note={Preliminary version appears in Proceedings of the 16th Canadian Conference on Computational Geometry (CCCG 2004)}
}

• ### The maximum number of edges in a three-dimensional grid-drawing

, , , and .
Journal of Graph Algorithms and Applications, 8(1):21–26, 2004.
Preliminary version appeared at The 19th European Workshop on Computational Geometry (EuroCG 2003).
@article{maxedges3d,
author={P. Bose and J. Czyzowicz and P. Morin and D. R. Wood},
title={The Maximum Number of Edges in a Three-Dimensional Grid-Drawing},
journal={Journal of Graph Algorithms and Applications},
year={2004},
volume={8},
number={1},
pages={21--26},
note={Preliminary version appeared at The 19th European Workshop on Computational Geometry (EuroCG 2003)}
}

• ### The geometry of carpentry and joinery

and .
Discrete Applied Mathematics, 144(3):374–380, 2004.
Special issue of selected papers from Fun with Algorithms 2 (FUN 2001).
@article{carpentry,
author={P. Morin and J. Morrison},
title={The geometry of carpentry and joinery},
journal={Discrete Applied Mathematics},
year={2004},
volume={144},
number={3},
pages={374--380},
note={Special issue of selected papers from Fun with Algorithms 2 (FUN 2001)}
}

• ### Competitive online routing in geometric graphs

and .
Theoretical Computer Science, 324(2--3):273–288, 2004.
Special Issue: In Memoriam, Steve Seiden. Preliminary version appears in Proceedings of the VIIIth International Colloquium on Structural Information and Communication Complexity (SIROCCO 2001), pages 35--44, 2001.
@article{routing_competitive,
author={P. Bose and P. Morin},
title={Competitive Online Routing in Geometric Graphs},
journal={Theoretical Computer Science},
year={2004},
volume={324},
number={2--3},
pages={273--288},
note={Special Issue: In Memoriam, Steve Seiden. Preliminary version appears in Proceedings of the VIIIth International Colloquium on Structural Information and Communication Complexity (SIROCCO 2001), pages 35--44, 2001}
}

• ### Packing two disks into a polygonal environment

, , and .
Journal of Discrete Algorithms, 2(3):373–380, 2004.
Preliminary version appears in Proceedings of The 7th Annual International Computing and Combinatorics Conference (COCOON 2001), pages 142--149, LNCS 2108, Springer-Verlag, 2001.
@article{2disks,
author={P. Bose and P. Morin and A. Vigneron},
title={Packing two disks into a polygonal environment},
journal={Journal of Discrete Algorithms},
year={2004},
volume={2},
number={3},
pages={373--380},
note={Preliminary version appears in Proceedings of The 7th Annual International Computing and Combinatorics Conference (COCOON 2001), pages 142--149, LNCS 2108, Springer-Verlag, 2001}
}

• ### Online routing in triangulations

and .
SIAM Journal on Computing, 33(4):937–951, 2004.
Preliminary version appears in Proceedings of the Tenth International Symposium on Algorithms and Computation (ISAAC’99), pages 113--122, LNCS 1741, Springer-Verlag, 1999.
@article{routing_triangs,
author={P. Bose and P. Morin},
title={Online routing in triangulations},
journal={SIAM Journal on Computing},
year={2004},
volume={33},
number={4},
pages={937--951},
note={Preliminary version appears in Proceedings of the Tenth International Symposium on Algorithms and Computation (ISAAC'99), pages 113--122, LNCS 1741, Springer-Verlag, 1999}
}

• ### On worst case Robin-Hood hashing

, , and .
SIAM Journal on Computing, 33(4):923–936, 2004.
@article{robinhood,
author={L. Devroye and P. Morin and A. Viola},
title={On worst case {R}obin-{H}ood hashing},
journal={SIAM Journal on Computing},
year={2004},
volume={33},
number={4},
pages={923--936}
}

• ### Space-efficient planar convex hull algorithms

, , , , , and .
Theoretical Computer Science, 321(1):25–40, 2004.
Special issue of selected papers from Latin American Theoretical INformatics (LATIN 2002).
@article{insitu,
author={H. Br\"onnimann and J. Iacono and J. Katajainen and P. Morin and J. Morrison and G. T. Toussaint},
title={Space-efficient planar convex hull algorithms},
journal={Theoretical Computer Science},
year={2004},
volume={321},
number={1},
pages={25--40},
note={Special issue of selected papers from Latin American Theoretical INformatics (LATIN 2002)}
}

• ### Ordered theta graphs

, , and .
Computational Geometry: Theory and Applications, 28(1):11–18, 2004.
Special issue of selected papers from The 14th Canadian Conference on Computational Geometry (CCCG 2002).
@article{otheta,
author={P. Bose and J. Gudmundsson and P. Morin},
title={Ordered theta graphs},
journal={Computational Geometry: Theory and Applications},
year={2004},
volume={28},
number={1},
pages={11--18},
note={Special issue of selected papers from The 14th Canadian Conference on Computational Geometry (CCCG 2002)}
}

• ### Testing the quality of manufactured disks and balls

and .
Algorithmica, 38(2):161–177, 2004.
Special issue on Shape Algorithmics (Remco C. Veltkamp, editor).
@article{quality,
author={P. Bose and P. Morin},
title={Testing the Quality of Manufactured Disks and Balls},
journal={Algorithmica},
year={2004},
volume={38},
number={2},
pages={161--177},
note={Special issue on Shape Algorithmics (Remco C. Veltkamp, editor)}
}

• ### On simplifying dot maps

, , , and .
Computational Geometry: Theory and Applications, 27(1):43–62, 2004.
Special issue of selected papers from the Xth European Conference on Computational Geometry (EuroCG 2002).
@article{dotmaps,
author={M. de Berg and P. Bose and O. Cheong and P. Morin},
title={On simplifying dot maps},
journal={Computational Geometry: Theory and Applications},
year={2004},
volume={27},
number={1},
pages={43--62},
note={Special issue of selected papers from the Xth European Conference on Computational Geometry (EuroCG 2002)}
}

• ### Asymmetric communication protocols via hotlink assignments

, , , and .
Theory of Computing Systems, 36(6):655–661, 2003.
Special issue of selected papers from the IXth International Colloquium on Structural Information and Communication Complexity (SIROCCO 2002).
@article{asymmetric,
author={P. Bose and D. Krizanc and S. Langerman and P. Morin},
title={Asymmetric communication protocols via hotlink assignments},
journal={Theory of Computing Systems},
year={2003},
volume={36},
number={6},
pages={655--661},
note={Special issue of selected papers from the IXth International Colloquium on Structural Information and Communication Complexity (SIROCCO 2002)}
}

• ### Computing the center of area of a convex polygon

, , and .
International Journal of Computational Geometry and Applications, 13:439–445, 2003.
@article{tukey,
author={P. Bra\ss and L. Heinrich-Litan and P. Morin},
title={Computing the Center of Area of a Convex Polygon},
journal={International Journal of Computational Geometry and Applications},
year={2003},
volume={13},
pages={439--445}
}

• ### Translating a regular grid over a point set

, , , , and .
Computational Geometry: Theory and Applications, 25(1--2):21–34, 2003.
Special issue of selected papers from the The 17th European Workshop on Computational Geometry (EuroCG 2001), 2001. Preliminary version appears in Proceedings of the 7th Annual Workshop on Algorithms and Data Structures (WADS 2001), pages 180--191, LNCS 2125, Springer-Verlag, 2001.
@article{grids,
author={P. Bose and M. van Kreveld and A. Maheshwari and P. Morin and J. Morrison},
title={Translating a regular grid over a point set},
journal={Computational Geometry: Theory and Applications},
year={2003},
volume={25},
number={1--2},
pages={21--34},
note={Special issue of selected papers from the The 17th European Workshop on Computational Geometry (EuroCG 2001), 2001. Preliminary version appears in Proceedings of the 7th Annual Workshop on Algorithms and Data Structures (WADS 2001), pages 180--191, LNCS 2125, Springer-Verlag, 2001}
}

• ### Cuckoo hashing: further analysis

and .
Information Processing Letters, 86(4):215–219, 2003.
@article{cuckoo,
author={L. Devroye and P. Morin},
title={Cuckoo hashing: Further analysis},
journal={Information Processing Letters},
year={2003},
volume={86},
number={4},
pages={215--219}
}

• ### Fast approximations for sums of distances, clustering and the Fermat-Weber problem

, , and .
Computational Geometry: Theory and Applications, 24(3):135–146, 2002.
Preliminary version appears in IX Encuentros de Geometŕı a Computacional (9EGC), 2001.
@article{sums,
author={P. Bose and A. Maheshwari and P. Morin},
title={Fast approximations for sums of distances, clustering and the {F}ermat-{W}eber problem},
journal={Computational Geometry: Theory and Applications},
year={2002},
volume={24},
number={3},
pages={135--146},
note={Preliminary version appears in IX Encuentros de Geometr\'\i a Computacional (9EGC), 2001}
}

• ### An improved algorithm for subdivision traversal without extra storage

and .
International Journal of Computational Geometry and Applications, 12(4):297–308, 2002.
Special issue of selected papers from the 11th Annual International Symposium on Algorithms and Computation (ISAAC 2000).
@article{traversal,
author={P. Bose and P. Morin},
title={An improved algorithm for subdivision traversal without extra storage},
journal={International Journal of Computational Geometry and Applications},
year={2002},
volume={12},
number={4},
pages={297--308},
note={Special issue of selected papers from the 11th Annual International Symposium on Algorithms and Computation (ISAAC 2000)}
}

• ### Online routing in convex subdivisions

, , , , , , , and .
International Journal of Computational Geometry and Applications, 12(4):283–296, 2002.
Special issue of selected papers from the 11th Annual International Symposium on Algorithms and Computation (ISAAC 2000).
@article{routing_convex,
author={P. Bose and A. Brodnik and S. Carlsson and E. D. Demaine and R. Fleischer and A. L\'opez-Ortiz and P. Morin and J. I. Munro},
title={Online routing in convex subdivisions},
journal={International Journal of Computational Geometry and Applications},
year={2002},
volume={12},
number={4},
pages={283--296},
note={Special issue of selected papers from the 11th Annual International Symposium on Algorithms and Computation (ISAAC 2000)}
}

• ### Convexifying polygons with simple projections

, , , , and .
Information Processing Letters, 80(2):81–86, 2001.
@article{convexification,
author={J. A. Calvo and D. Krizanc and P. Morin and M. Soss and G. T. Toussaint},
title={Convexifying polygons with simple projections},
journal={Information Processing Letters},
year={2001},
volume={80},
number={2},
pages={81--86}
}

• ### Simple polygons with an infinite sequence of deflations

, , , , and .
Beiträge zur Algebra und Geometrie (Contributions to Algebra and Geometry), 42(2):307–311, 2001.
@article{deflation,
author={T. Fevens and A. Hernandez, A. Mesa and P. Morin and M. Soss and G. T. Toussaint},
title={Simple polygons with an infinite sequence of deflations},
journal={Beitr\"age zur Algebra und Geometrie (Contributions to Algebra and Geometry)},
year={2001},
volume={42},
number={2},
pages={307--311}
}

• ### Routing with guaranteed delivery in ad hoc wireless networks

, , , and .
Wireless Networks, 7(6):609–616, 2001.
Special issue of selected papers from the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM’99).
@article{routing_adhoc,
author={P. Bose and P. Morin and I. Stojmenovi\'c and J. Urrutia},
title={Routing with guaranteed delivery in ad hoc wireless networks},
journal={Wireless Networks},
year={2001},
volume={7},
number={6},
pages={609--616},
note={Special issue of selected papers from the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM'99)}
}


, , , , , and .
Geombinatorics, X(2):57–63, 2000.
Preliminary version appears in Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00).
@article{flipturns,
author={H.-K. Ahn and P. Bose and J. Czyzowicz and N. Hanusse and E. Kranakis and P. Morin},
journal={Geombinatorics},
year={2000},
volume={X},
number={2},
pages={57--63},
note={Preliminary version appears in Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG'00)}
}

• ### Guest editor’s introduction

.
Computational Geometry: Theory and Applications, 47(2):295, 2014.
Special issue of selected papers from CCCG 2008.
@article{cccg-special-issue,
author={P. Morin},
title={Guest Editor's Introduction},
journal={Computational Geometry: Theory and Applications},
year={2014},
volume={47},
number={2},
pages={295},
note={Special issue of selected papers from CCCG 2008}
}

• ### Guest editors’ introduction

and .
Algorithmica, 42(1):1–2, 2005.
Special issue of selected papers from ISAAC 2002.
@article{bm03,
author={P. Bose and P. Morin},
title={Guest Editors' Introduction},
journal={Algorithmica},
year={2005},
volume={42},
number={1},
pages={1--2},
note={Special issue of selected papers from ISAAC 2002}
}

• ### Guest editors’ introduction

and .
Theory of Computing Systems, 38:251, 2005.
Special issue of selected papers from ISAAC 2002.
@article{bm04,
author={P. Bose and P. Morin},
title={Guest Editors' Introduction},
journal={Theory of Computing Systems},
year={2005},
volume={38},
pages={251},
note={Special issue of selected papers from ISAAC 2002}
}


## Conference papers

• ### On the average number of edges in theta graphs

and .
In Proceeding of the Eleventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO 2014), pages 121–132, 2014.
@inproceedings{avgtheta,
author={P. Morin and S. Verdonschot},
title={On the Average Number of Edges in Theta Graphs},
booktitle={Proceeding of the Eleventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO 2014)},
year={2014},
publisher={SIAM},
pages={121--132}
}

• ### Common unfoldings of polyominoes and polycubes

, , , , , , , , , and .
In Abstracts from the China-Japan Joint Conference on Computational Geometry, Graphs and Applications, pages 44–54, 2010.
@inproceedings{common,
author={G. Aloupis and P. Bose and S. Collette and E. D. Demaine and M. L. Demaine and K. Douïeb and V. Dujmovi\'c and J. Iacono and S. Langerman and P. Morin},
title={Common Unfoldings of Polyominoes and Polycubes},
booktitle={Abstracts from the China-Japan Joint Conference on Computational Geometry, Graphs and Applications},
year={2010},
publisher={Springer},
volume={7033},
series={Lecture Notes in Computer Science},
pages={44--54}
}

• ### Improved methods for generating quasi-Gray codes

, , , , and .
In Proceedings of the 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2010), pages 224–235, 2010.
@inproceedings{counters,
author={P. Bose and P. Carmi and D. Jansens and A. Maheshwari and M. Smid},
title={Improved Methods for Generating Quasi-{G}ray Codes},
booktitle={Proceedings of the 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2010)},
year={2010},
pages={224--235}
}

• ### Planar visibility: testing and counting

and .
In Proceedings of the Twenty-Sixth ACM Symposium on Computational Geometry (SoCG 2010), pages 77–86, 2010.
Submitted to SIAM Journal on Computing in January 2010; rejected in July 2010..
@inproceedings{viscover,
author={J. Gudmundsson and P. Morin},
title={Planar Visibility: Testing and Counting},
booktitle={Proceedings of the Twenty-Sixth ACM Symposium on Computational Geometry (SoCG 2010)},
year={2010},
pages={77--86},
note={Submitted to SIAM Journal on Computing in January 2010; rejected in July 2010.}
}

• ### Succinct orthogonal range search structures on a grid with applications to text indexing

, , , and .
In Proceedings of the 16th International Workshop on Algorithms and Data Structures (WADS 2009), pages 98–109, 2009.
Submitted to Computational Geometry: Theory and Applications in June 2010; rejected in February 2011.
@inproceedings{succorth,
author={P. Bose and M. He and A. Maheshwari and P. Morin},
title={Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing},
booktitle={Proceedings of the 16th International Workshop on Algorithms and Data Structures (WADS 2009)},
year={2009},
publisher={Springer},
series={LNCS},
pages={98--109},
note={Submitted to Computational Geometry: Theory and Applications in June 2010; rejected in February 2011}
}

• ### Distribution-sensitive point location in convex subdivisions

, , , , and .
In Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pages 912–921, 2008.
Submitted to Journal of the ACM in November 2006; rejected in August 2007.
Submitted to SIAM Journal on Computing in August 2007; rejected in May 2008..

@inproceedings{entropy,
author={S. Collette and V. Dujmovi\'c and J. Iacono and S. Langerman and P. Morin},
title={Distribution-Sensitive Point Location in Convex Subdivisions},
booktitle={Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA 2008)},
year={2008},
pages={912--921},
note={Submitted to Journal of the ACM in November 2006; rejected in August 2007. Submitted to SIAM Journal on Computing in August 2007; rejected in May 2008.}
}

• ### Approximate range mode and range median queries

, , , and .
In Proceedings of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS 2005), pages 377–388, 2005.
@inproceedings{rmq2,
author={P. Bose and E. Kranakis and P. Morin and Y. Tang},
title={Approximate Range Mode and Range Median Queries},
booktitle={Proceedings of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS 2005)},
year={2005},
publisher={Springer-Verlag},
volume={3404},
series={Lecture Notes in Computer Science},
pages={377--388}
}

• ### Improving distance based geographic location techniques in sensor networks

, , , and .
In Proceedings of the 3rd International Conference on AD-HOC Networks & Wireless (ADHOC-NOW’04), pages 197–210, 2004.
@inproceedings{gps,
author={M. Barbeau and E. Kranakis and D. Krizanc and P. Morin},
title={Improving Distance Based Geographic Location Techniques in Sensor Networks},
booktitle={Proceedings of the 3rd International Conference on AD-HOC Networks \& Wireless (ADHOC-NOW'04)},
year={2004},
pages={197--210}
}

• ### Bounds for frequency estimation of packet streams

, , , and .
In Proceedings of the 10th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2003), pages 33–42, 2003.
@inproceedings{streaming,
author={P. Bose and E. Kranakis and P. Morin and Y. Tang},
title={Bounds for Frequency Estimation of Packet Streams},
booktitle={Proceedings of the 10th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2003)},
year={2003},
pages={33--42}
}

• ### Pathwidth and 3-dimensional straight-line grid drawings of graphs

, , and .
In Proceedings of the 10th International Symposium on Graph Drawing (GD2002), pages 42–53, 2002.
@inproceedings{straight3d,
author={V. Dujmovi\'c and P. Morin and D. R. Wood},
title={Pathwidth and 3-dimensional straight-line grid drawings of graphs},
booktitle={Proceedings of the 10th International Symposium on Graph Drawing (GD2002)},
year={2002},
publisher={Springer-Verlag},
volume={2528},
series={Lecture Notes in Computer Science},
pages={42--53}
}

• ### Computing the maximum detour and spanning ratio of planar paths, trees and cycles

, , and .
In Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science (STACS 2002), pages 250–261, 2002.
Extended abstract appears at 11th Fall Workshop on Computational Geometry, 2001.
@inproceedings{detour,
author={S. Langerman and P. Morin and M. Soss},
title={Computing the maximum detour and spanning ratio of planar paths, trees and cycles},
booktitle={Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science (STACS 2002)},
year={2002},
publisher={Springer-Verlag},
volume={2285},
series={Lecture Notes in Computer Science},
pages={250--261},
note={Extended abstract appears at 11th Fall Workshop on Computational Geometry, 2001}
}

• ### Testing the quality of manufactured balls

and .
In Proceedings of the 6th International Workshop on Algorithms and Data Structures (WADS’99), pages 145–156, 1999.
@inproceedings{balls,
author={P. Bose and P. Morin},
title={Testing the quality of manufactured balls},
booktitle={Proceedings of the 6th International Workshop on Algorithms and Data Structures (WADS'99)},
year={1999},
publisher={Springer-Verlag},
volume={1663},
series={Lecture Notes in Computer Science},
pages={145--156}
}

• ### Testing the quality of manufactured disks and cylinders

and .
In Proceedings of the Ninth Annual International Symposium on Algorithms and Computation (ISAAC’98), pages 129–138, 1998.
@inproceedings{disks,
author={P. Bose and P. Morin},
title={Testing the quality of manufactured disks and cylinders},
booktitle={Proceedings of the Ninth Annual International Symposium on Algorithms and Computation (ISAAC'98)},
year={1998},
publisher={Springer-Verlag},
volume={1533},
series={Lecture Notes in Computer Science},
pages={129--138}
}

• ### Coarse grained parallel computing on heterogeneous systems

.
In Proceedings of the 1998 ACM Symposium on Applied Computing (SAC’98), pages 628–634, 1998.
@inproceedings{hcgm,
author={P. Morin},
title={Coarse grained parallel computing on heterogeneous systems},
booktitle={Proceedings of the 1998 ACM Symposium on Applied Computing (SAC'98)},
year={1998},
publisher={ACM Press},
pages={628--634}
}

• ### Progressive TINs: algorithms and applications

, , and .
In Proceedings of the 5th International Workshop on Advances in Geographic Information Systems (ACM-GIS’97), pages 24–29, 1997.
@inproceedings{pm,
author={A. Maheshwari and P. Morin and J.-R. Sack},
title={Progressive {TIN}s: Algorithms and applications},
booktitle={Proceedings of the 5th International Workshop on Advances in Geographic Information Systems (ACM-GIS'97)},
year={1997},
publisher={ACM Press},
pages={24--29}
}

• ### Provably secure and efficient block ciphers

.
In Proceedings of the Third Annual Workshop on Selected Areas in Cryptography (SAC’96), pages 30–37, 1996.
@inproceedings{aardvark,
author={P. Morin},
title={Provably secure and efficient block ciphers},
booktitle={Proceedings of the Third Annual Workshop on Selected Areas in Cryptography (SAC'96)},
year={1996},
pages={30--37}
}

• ### Optimal bounds on theta-graphs: more is not always better

, , , , and .
In The 24th Canadian Conference on Computational Geometry (CCCG 2012), pages 305–310, 2012.
@inproceedings{theta2vs4,
author={P. Bose and J.-L. De Carufel and P. Morin and A. van Renssen and S. Verdonschot},
title={Optimal Bounds on Theta-Graphs: More is Not Always Better},
booktitle={The 24th Canadian Conference on Computational Geometry (CCCG 2012)},
year={2012},
pages={305--310}
}

• ### A note on interference in random point sets

and .
In The 24th Canadian Conference on Computational Geometry (CCCG 2012), pages 201–206, 2012.
Submitted to ACM/IEEE Transactions on Networking in March 2012 and immediately rejected. \newblock Submitted to IEEE Transactions on Wireless Communications in March 2012 and immediately rejected. \newblock Submitted to Wireless Networks in April 2012 and rejected in August 2012.
@inproceedings{interference2,
author={L. Devroye and P. Morin},
title={A Note on Interference in Random Point Sets},
booktitle={The 24th Canadian Conference on Computational Geometry (CCCG 2012)},
year={2012},
pages={201--206},
note={Submitted to ACM/IEEE Transactions on Networking in March 2012 and immediately rejected. \newblock Submitted to IEEE Transactions on Wireless Communications in March 2012 and immediately rejected. \newblock Submitted to Wireless Networks in April 2012 and rejected in August 2012}
}

• ### Algorithms for bivariate majority depth

and .
In Proceedings of the 23nd Canadian Conference on Computational Geometry (CCCG 2011), pages 425–430, 2011.
@inproceedings{majority,
author={D. Chen and P. Morin},
title={Algorithms for Bivariate Majority Depth},
booktitle={Proceedings of the 23nd Canadian Conference on Computational Geometry (CCCG 2011)},
year={2011},
pages={425--430}
}

• ### Removing outliers to minimize area and perimeter

, , and .
In Proceedings of the 18th Canadian Conference on Computational Geometry (CCCG 2006), 2006.
@inproceedings{outliers,
author={R. Atanassov and P. Morin and S. Wuhrer},
title={Removing Outliers to Minimize Area and Perimeter},
booktitle={Proceedings of the 18th Canadian Conference on Computational Geometry (CCCG 2006)},
year={2006}
}

• ### Rotational clamshell casting in two dimensions

, , , and .
In Proceedings of the 18th Canadian Conference on Computational Geometry (CCCG 2006), 2006.
@inproceedings{clamshell2d_cccg,
author={P. Bose and P. Morin and M. Smid and S. Wuhrer},
title={Rotational Clamshell Casting in Two Dimensions},
booktitle={Proceedings of the 18th Canadian Conference on Computational Geometry (CCCG 2006)},
year={2006}
}

• ### Succinct data structures for approximating convex functions with applications

, , and .
In Proceedings of the Japan Conference on Discrete and Computational Geometry (JCDCG 2002), pages 97–107, 2003.
Submitted to Journal of Discrete Algorithms in January 2005.
@inproceedings{minimalist,
author={P. Bose and L. Devroye and P. Morin},
title={Succinct Data Structures for Approximating Convex Functions with Applications},
booktitle={Proceedings of the Japan Conference on Discrete and Computational Geometry (JCDCG 2002)},
year={2003},
publisher={Springer-Verlag},
volume={2866},
series={LNCS},
pages={97--107},
note={Submitted to Journal of Discrete Algorithms in January 2005}
}

• ### Covering points with lines (abstract)

and .
In 11th Fall Workshop on Computational Geometry, 2001.
Results are included in Journal Paper \cite{covering}.
@inproceedings{covering_basic,
author={S. Langerman and P. Morin},
title={Covering points with lines (abstract)},
booktitle={11th Fall Workshop on Computational Geometry},
year={2001},
note={Results are included in Journal Paper \cite{covering}}
}

• ### A framework for multiresolution modeling

, , and .
In Proceedings of the Workshop on Multiresolution Representation of 3D Geometry for Progressive Transmission, 1998.
@inproceedings{framework,
author={A. Maheshwari and P. Morin and J.-R. Sack},
title={A framework for multiresolution modeling},
booktitle={Proceedings of the Workshop on Multiresolution Representation of 3D Geometry for Progressive Transmission},
year={1998}
}

• ### A parallel cartographic modelling system: design, implementation and performance

, , and .
In GIS’97 Proceedings, pages 16–20, 1997.
@inproceedings{tomlin,
author={D. Dubrule and P. Morin and J.-R. Sack},
title={A parallel cartographic modelling system: Design, implementation and performance},
booktitle={GIS'97 Proceedings},
year={1997},
pages={16--20}
}


## Books

• ### Open data structures (in pseudocode)

.
Web, 2014.
A freely-available open content textbook.
@book{ods_python,
author={P. Morin},
title={Open Data Structures (in Pseudocode)},
year={2014},
publisher={Web},
note={A freely-available open content textbook}
}

• ### Open data structures: an introduction

.
Athabasca University Press, 2013.
Also freely available as \em Open Data Structures (in Java) at opendatastructures.org.
@book{ods_java,
author={P. Morin},
title={Open Data Structures: An Introduction},
year={2013},
publisher={Athabasca University Press},
note={Also freely available as {\em Open Data Structures (in Java)} at opendatastructures.org}
}

• ### Open data structures (in c++)

.
Web, 2012.
A freely-available open content textbook.
@book{ods_cpp,
author={P. Morin},
title={Open Data Structures (in C++)},
year={2012},
publisher={Web},
note={A freely-available open content textbook}
}


## Chapters in Books

• ### Hash tables

.
In Handbook of Data Structures and Applications, chapter 9. CRC Press, 2004.
@incollection{hashtables,
author={P. Morin},
title={Hash Tables},
booktitle={Handbook of Data Structures and Applications},
year={2004},
editor={Dinesh Mehta and Sartaj K. Sahni},
publisher={CRC Press},
chapter={9}
}


## Theses

• ### Online routing in geometric graphs

.
PhD thesis, School of Computer Science, Carleton University, January 2001.
@phdthesis{phdthesis,
author={P. Morin},
title={Online Routing in Geometric Graphs},
type={PhD thesis},
school={School of Computer Science, Carleton University},
year={2001},
month={January}
}

• ### Two topics in applied algorithmics

.
Master’s thesis, School of Computer Science, Carleton University, 1998.
@mastersthesis{mcsthesis,
author={P. Morin},
title={Two topics in applied algorithmics},
type={Master's thesis},
school={School of Computer Science, Carleton University},
year={1998}
}


## Other

• ### Tic tac toe

and .
2015.
First Place: Graph Drawing Contest 2015 (Creative Topics: Tic Tac Toe).
• ### A tight bound on the maximum interference of random sensors in the highway model

, , , , and .
arXiv:1007.2120, July 2010.
• ### Odds-on trees

, , , , , and .
arXiv:1002.1092, February 2010.
• ### Point location in disconnected planar subdivisions

, , , , , and .
arXiv:1001.2763, January 2010.
• ### Putting your data structure on a diet

, , and .
Technical report CPH-STL-2007-1, Performance Engineering Laboratory, DIKU, 2007.
@techreport{diet2,
author={H. Br\"onnimann and J. Katajainen and P. Morin},
title={Putting your data structure on a diet},
type={technical report},
institution={Performance Engineering Laboratory, DIKU},
year={2007},
number={CPH-STL-2007-1}
}

• ### Rotational clamshell casting in three dimensions

, , , and .
Technical report TR-06-04, Carleton University School of Computer Science, 2006.
@techreport{clamshell3dtr,
author={P. Bose and P. Morin and M. Smid and S. Wuhrer},
title={Rotational Clamshell Casting in Three Dimensions},
type={technical report},
institution={Carleton University School of Computer Science},
year={2006},
number={TR-06-04}
}

• ### Putting your dictionary on a diet

.
Technical report TR-02-07, Carleton University School of Computer Science, November 2002.
@techreport{diet,
author={P. Morin},
title={Putting your Dictionary on a Diet},
type={technical report},
institution={Carleton University School of Computer Science},
year={2002},
number={TR-02-07},
month={nov}
}

• ### Secure non-interactive electronic cash

.
Technical report TR-96-06, School of Computer Science, Carleton University, 1996.
@techreport{ecash,
author={P. Morin},
title={Secure non-interactive electronic cash},
type={technical report},
institution={School of Computer Science, Carleton University},
year={1996},
number={TR-96-06}
}

• ### Proceedings of the 14th annual international symposium on algorithms and computation (isaac 2002)

and , editors.
Volume 2815 of LNCS. Springer-Verlag, 2002.
@proceedings{bm02,
editor={P. Bose and P. Morin},
title={Proceedings of the 14th Annual International Symposium on Algorithms and Computation (ISAAC 2002)},
year={2002},
publisher={Springer-Verlag},
volume={2815},
series={LNCS}
}