Progressive TINs: Algorithms and Applications. - Anil Maheshwari; Pat Morin; Jörg-Rüdiger Sack (ACM-GIS, 1997)

Testing the Quality of Manufactured Disks and Cylinders. - Prosenjit Bose; Pat Morin (ISAAC, 1998)

Coarse grained parallel computing on heterogeneous systems. - Pat Morin (SAC, 1998)

Testing the Quality of Manufactured Balls. - Prosenjit Bose; Pat Morin (WADS, 1999)

Flipping your Lid. - Hee-Kap Ahn; Prosenjit Bose; Jurek Czyzowicz; Nicolas Hanusse; Evangelos Kranakis; Pat Morin (CCCG, 2000)

The Grid Placement Problem. - Prosenjit Bose; Anil Maheshwari; Pat Morin; Jason Morrison (WADS, 2001)

Convexifying polygons with simple projections. - Jorge Alberto Calvo; Danny Krizanc; Pat Morin; Michael A. Soss; Godfried T. Toussaint (Inf. Process. Lett., 2001)

Routing with Guaranteed Delivery in Ad Hoc Wireless Networks. - Prosenjit Bose; Pat Morin; Ivan Stojmenovic; Jorge Urrutia (Wirel. Networks, 2001)

Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs. - Vida Dujmovic; Pat Morin; David R. Wood (GD, 2002)

Succinct Data Structures for Approximating Convex Functions with Applications. - Prosenjit Bose; Luc Devroye; Pat Morin (JCDCG, 2002)

In-Place Planar Convex Hull Algorithms. - Hervé Brönnimann; John Iacono; Jyrki Katajainen; Pat Morin; Jason Morrison; Godfried T. Toussaint (LATIN, 2002)

Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles. - Stefan Langerman; Pat Morin; Michael A. Soss (STACS, 2002)

Online Routing in Convex Subdivisions. - Prosenjit Bose; Andrej Brodnik; Svante Carlsson; Erik D. Demaine; Rudolf Fleischer; Alejandro López-Ortiz; Pat Morin; J. Ian Munro (Int. J. Comput. Geom. Appl., 2002)

An Improved Algorithm for Subdivision Traversal without Extra Storage. - Prosenjit Bose; Pat Morin (Int. J. Comput. Geom. Appl., 2002)

Bounds for Frequency Estimation of Packet Streams. - Prosenjit Bose; Evangelos Kranakis; Pat Morin; Yihui Tang (SIROCCO, 2003)

Translating a regular grid over a point set. - Prosenjit Bose; Marc J. van Kreveld; Anil Maheshwari; Pat Morin; Jason Morrison (Comput. Geom., 2003)

Fast approximations for sums of distances, clustering and the Fermat-Weber problem. - Prosenjit Bose; Anil Maheshwari; Pat Morin (Comput. Geom., 2003)

Computing the Center of Area of a Convex Polygon. - Peter Braß; Laura Heinrich-Litan; Pat Morin (Int. J. Comput. Geom. Appl., 2003)

Cuckoo hashing: Further analysis. - Luc Devroye; Pat Morin (Inf. Process. Lett., 2003)

Asymmetric Communication Protocols via Hotlink Assignments. - Prosenjit Bose; Danny Krizanc; Stefan Langerman; Pat Morin (Theory Comput. Syst., 2003)

Improving Distance Based Geographic Location Techniques in Sensor Networks. - Michel Barbeau; Evangelos Kranakis; Danny Krizanc; Pat Morin (ADHOC-NOW, 2004)

Unfolding polyhedral bands. - Greg Aloupis; Erik D. Demaine; Stefan Langerman; Pat Morin; Joseph O'Rourke; Ileana Streinu; Godfried T. Toussaint (CCCG, 2004)

Testing the Quality of Manufactured Disks and Balls. - Prosenjit Bose; Pat Morin (Algorithmica, 2004)

On simplifying dot maps. - Mark de Berg; Prosenjit Bose; Otfried Cheong; Pat Morin (Comput. Geom., 2004)

Ordered theta graphs. - Prosenjit Bose; Joachim Gudmundsson; Pat Morin (Comput. Geom., 2004)

The geometry of carpentry and joinery. - Pat Morin; Jason Morrison (Discret. Appl. Math., 2004)

Packing two disks into a polygonal environment. - Prosenjit Bose; Pat Morin; Antoine Vigneron (J. Discrete Algorithms, 2004)

The Maximum Number of Edges in a Three-Dimensional Grid-Drawing. - Prosenjit Bose; Jurek Czyzowicz; Pat Morin; David R. Wood (J. Graph Algorithms Appl., 2004)

Three-Dimensional 1-Bend Graph Drawings. - Pat Morin; David R. Wood (J. Graph Algorithms Appl., 2004)

Online Routing in Triangulations. - Prosenjit Bose; Pat Morin (SIAM J. Comput., 2004)

On Worst-Case Robin Hood Hashing. - Luc Devroye; Pat Morin; Alfredo Viola (SIAM J. Comput., 2004)

Competitive online routing in geometric graphs. - Prosenjit Bose; Pat Morin (Theor. Comput. Sci., 2004)

Space-efficient planar convex hull algorithms. - Hervé Brönnimann; John Iacono; Jyrki Katajainen; Pat Morin; Jason Morrison; Godfried T. Toussaint (Theor. Comput. Sci., 2004)

Hash Tables. - Pat Morin (Handbook of Data Structures and Applications, 2004)

Approximate Range Mode and Range Median Queries. - Prosenjit Bose; Evangelos Kranakis; Pat Morin; Yihui Tang (STACS, 2005)

Guest Editors' Foreword. - Prosenjit Bose; Pat Morin (Algorithmica, 2005)

Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. - David Bremner; Erik D. Demaine; Jeff Erickson 001; John Iacono; Stefan Langerman; Pat Morin; Godfried T. Toussaint (Discret. Comput. Geom., 2005)

Covering Things with Things. - Stefan Langerman; Pat Morin (Discret. Comput. Geom., 2005)

Range Mode and Range Median Queries on Lists and Trees. - Danny Krizanc; Pat Morin; Michiel H. M. Smid (Nord. J. Comput., 2005)

Layout of Graphs with Bounded Tree-Width. - Vida Dujmovic; Pat Morin; David R. Wood (SIAM J. Comput., 2005)

Removing Outliers to Minimize Area and Perimeter. - Rossen Atanassov; Pat Morin; Stefanie Wuhrer (CCCG, 2006)

Reconfiguring Triangulations with Edge Flips and Point Moves. - Greg Aloupis; Prosenjit Bose; Pat Morin (Algorithmica, 2007)

Space-efficient geometric divide-and-conquer algorithms. - Prosenjit Bose; Anil Maheshwari; Pat Morin; Jason Morrison; Michiel H. M. Smid; Jan Vahrenhold (Comput. Geom., 2007)

Geodesic Ham-Sandwich Cuts. - Prosenjit Bose; Erik D. Demaine; Ferran Hurtado; John Iacono; Stefan Langerman; Pat Morin (Discret. Comput. Geom., 2007)

Simultaneous diagonal flips in plane triangulations. - Prosenjit Bose; Jurek Czyzowicz; Zhicheng Gao; Pat Morin; David R. Wood (J. Graph Theory, 2007)

Randomized Rendez-Vous with Limited Memory. - Evangelos Kranakis; Danny Krizanc; Pat Morin (LATIN, 2008)

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

Distinct Distances in Graph Drawings. - Paz Carmi; Vida Dujmovic; Pat Morin; David R. Wood (Electron. J. Comb., 2008)

Edge-unfolding nested polyhedral bands. - Greg Aloupis; Erik D. Demaine; Stefan Langerman; Pat Morin; Joseph O'Rourke; Ileana Streinu; Godfried T. Toussaint (Comput. Geom., 2008)

Algorithms for bivariate zonoid depth. - Harish Gopala; Pat Morin (Comput. Geom., 2008)

An optimal randomized algorithm for d-variate zonoid depth. - Pat Morin (Comput. Geom., 2008)

Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D. - Pankaj K. Agarwal; Rolf Klein; Christian Knauer; Stefan Langerman; Pat Morin; Micha Sharir; Michael A. Soss (Discret. Comput. Geom., 2008)

A Polynomial Bound for Untangling Geometric Planar Graphs. - Prosenjit Bose; Vida Dujmovic; Ferran Hurtado; Pat Morin; Stefan Langerman; David R. Wood (Electron. Notes Discret. Math., 2008)

On the false-positive rate of Bloom filters. - Prosenjit Bose; Hua Guo; Evangelos Kranakis; Anil Maheshwari; Pat Morin; Jason Morrison; Michiel H. M. Smid; Yihui Tang (Inf. Process. Lett., 2008)

Realizing partitions respecting full and partial order information. - Erik D. Demaine; Jeff Erickson 001; Danny Krizanc; Henk Meijer; Pat Morin; Mark H. Overmars; Sue Whitesides (J. Discrete Algorithms, 2008)

A Characterization of the degree sequences of 2-trees. - Prosenjit Bose; Vida Dujmovic; Danny Krizanc; Stefan Langerman; Pat Morin; David R. Wood; Stefanie Wuhrer (J. Graph Theory, 2008)

Output-sensitive algorithms for Tukey depth and related problems. - David Bremner; Dan Chen 003; John Iacono; Stefan Langerman; Pat Morin (Stat. Comput., 2008)

Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing. - Prosenjit Bose; Meng He 001; Anil Maheshwari; Pat Morin (WADS, 2009)

Delaunay Triangulation of Imprecise Points Simplified and Extended. - Kevin Buchin; Maarten Löffler; Pat Morin; Wolfgang Mulzer (WADS, 2009)

Clamshell Casting. - Prosenjit Bose; Pat Morin; Michiel H. M. Smid; Stefanie Wuhrer (Algorithmica, 2009)

Rotationally monotone polygons. - Prosenjit Bose; Pat Morin; Michiel H. M. Smid; Stefanie Wuhrer (Comput. Geom., 2009)

On the Expected Maximum Degree of Gabriel and Yao Graphs - Luc Devroye; Joachim Gudmundsson; Pat Morin (CoRR, 2009)

Connectivity-preserving transformations of binary images. - Prosenjit Bose; Vida Dujmovic; Ferran Hurtado; Pat Morin (Comput. Vis. Image Underst., 2009)

Centerpoint Theorems for Wedges. - Jeff Erickson 001; Ferran Hurtado; Pat Morin (Discret. Math. Theor. Comput. Sci., 2009)

Algorithms for optimal outlier removal. - Rossen Atanassov; Prosenjit Bose; Mathieu Couture; Anil Maheshwari; Pat Morin; Michel Paquette; Michiel H. M. Smid; Stefanie Wuhrer (J. Discrete Algorithms, 2009)

Spanners of Complete k-Partite Geometric Graphs. - Prosenjit Bose; Paz Carmi; Mathieu Couture; Anil Maheshwari; Pat Morin; Michiel H. M. Smid (SIAM J. Comput., 2009)

Oja medians and centers of gravity. - Dan Chen 003; Olivier Devillers; John Iacono; Stefan Langerman; Pat Morin (CCCG, 2010)

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

Coverage with k-Transmitters in the Presence of Obstacles. - Brad Ballinger; Nadia M. Benbernou; Prosenjit Bose; Mirela Damian; Erik D. Demaine; Vida Dujmovic; Robin Y. Flatland; Ferran Hurtado; John Iacono; Anna Lubiw; Pat Morin; Vera Sacristán Adinolfi; et al. (COCOA (2), 2010)

Planar visibility: testing and counting. - Joachim Gudmundsson; Pat Morin (SCG, 2010)

Improved Methods For Generating Quasi-gray Codes. - Prosenjit Bose; Paz Carmi; Dana Jansens; Anil Maheshwari; Pat Morin; Michiel H. M. Smid (SWAT, 2010)

Point Location in Disconnected Planar Subdivisions - Prosenjit Bose; Luc Devroye; Karim Douïeb; Vida Dujmovic; James King 001; Pat Morin (CoRR, 2010)

Odds-On Trees - Prosenjit Bose; Luc Devroye; Karim Douïeb; Vida Dujmovic; James King 001; Pat Morin (CoRR, 2010)

A Tight Bound on the Maximum Interference of Random Sensors in the Highway Model - Evangelos Kranakis; Danny Krizanc; Pat Morin; Lata Narayanan; Ladislav Stacho (CoRR, 2010)

Sigma-local graphs. - Prosenjit Bose; Sébastien Collette; Stefan Langerman; Anil Maheshwari; Pat Morin; Michiel H. M. Smid (J. Discrete Algorithms, 2010)

Algorithms for Bivariate Majority Depth. - Dan Chen 003; Pat Morin (CCCG, 2011)

Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended. - Kevin Buchin; Maarten Löffler; Pat Morin; Wolfgang Mulzer (Algorithmica, 2011)

Algorithms for Marketing-Mix Optimization. - Joachim Gudmundsson; Pat Morin; Michiel H. M. Smid (Algorithmica, 2011)

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

Randomized rendezvous with limited memory. - Evangelos Kranakis; Danny Krizanc; Pat Morin (ACM Trans. Algorithms, 2011)

Optimal Bounds on Theta-Graphs: More is not Always Better. - Prosenjit Bose; Jean-Lou De Carufel; Pat Morin; André van Renssen; Sander Verdonschot (CCCG, 2012)

Biased Range Trees. - Vida Dujmovic; John Howat; Pat Morin (Algorithmica, 2012)

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

A Note on Interference in Random Point Sets - Luc Devroye; Pat Morin (CoRR, 2012)

The theta-5-graph is a spanner - Prosenjit Bose; Pat Morin; André van Renssen; Sander Verdonschot (CoRR, 2012)

Ghost chimneys. - David Charlton; Erik D. Demaine; Martin L. Demaine; Vida Dujmovic; Pat Morin; Ryuhei Uehara (Int. J. Comput. Geom. Appl., 2012)

Skip lift: A probabilistic alternative to red-black trees. - Prosenjit Bose; Karim Douïeb; Pat Morin (J. Discrete Algorithms, 2012)

A distribution-sensitive dictionary with low space overhead. - Prosenjit Bose; John Howat; Pat Morin (J. Discrete Algorithms, 2012)

Succinct geometric indexes supporting point location queries. - Prosenjit Bose; Eric Y. Chen; Meng He 001; Anil Maheshwari; Pat Morin (ACM Trans. Algorithms, 2012)

Entropy, triangulation, and point location in planar subdivisions. - Sébastien Collette; Vida Dujmovic; John Iacono; Stefan Langerman; Pat Morin (ACM Trans. Algorithms, 2012)

A History of Distribution-Sensitive Data Structures. - Prosenjit Bose; John Howat; Pat Morin (Space-Efficient Data Structures, Streams, and Algorithms, 2013)

Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive Coloring. - Vida Dujmovic; Pat Morin; David R. Wood (FOCS, 2013)

The θ 5-Graph is a Spanner. - Prosenjit Bose; Pat Morin; André van Renssen; Sander Verdonschot (WG, 2013)

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

Oja centers and centers of gravity. - Dan Chen 003; Olivier Devillers; John Iacono; Stefan Langerman; Pat Morin (Comput. Geom., 2013)

Approximating majority depth. - Dan Chen 003; Pat Morin (Comput. Geom., 2013)

Absolute approximation of Tukey depth: Theory and experiments. - Dan Chen 003; Pat Morin; Uli Wagner 001 (Comput. Geom., 2013)

Layered Separators in Minor-Closed Families with Applications. - Vida Dujmovic; Pat Morin; David R. Wood (CoRR, 2013)

The Fresh-Finger Property - John Howat; John Iacono; Pat Morin (CoRR, 2013)

Coverage with k-transmitters in the presence of obstacles. - Brad Ballinger; Nadia M. Benbernou; Prosenjit Bose; Mirela Damian; Erik D. Demaine; Vida Dujmovic; Robin Y. Flatland; Ferran Hurtado; John Iacono; Anna Lubiw; Pat Morin; Vera Sacristán Adinolfi; et al. (J. Comb. Optim., 2013)

Robust Geometric Spanners. - Prosenjit Bose; Vida Dujmovic; Pat Morin; Michiel H. M. Smid (SIAM J. Comput., 2013)

On the Average Number of Edges in Theta Graphs. - Pat Morin; Sander Verdonschot (ANALCO, 2014)

Searching by Panning and Zooming. - Prosenjit Bose; John Howat; Pat Morin (CCCG, 2014)

Crossings in Grid Drawings. - Vida Dujmovic; Pat Morin; Adam Sheffer (Electron. J. Comb., 2014)

Guest Editor's Introduction. - Pat Morin (Comput. Geom., 2014)

Top-Down Skiplists. - Luis Barba; Pat Morin (CoRR, 2014)

Towards Tight Bounds on Theta-Graphs. - Prosenjit Bose; Jean-Lou De Carufel; Pat Morin; André van Renssen; Sander Verdonschot (CoRR, 2014)

Visibility-monotonic polygon deflation. - Prosenjit Bose; Vida Dujmovic; Nima Hoda; Pat Morin (Contributions Discret. Math., 2015)

On Obstacle Numbers. - Vida Dujmovic; Pat Morin (Electron. J. Comb., 2015)

The θ5-graph is a spanner. - Prosenjit Bose; Pat Morin; André van Renssen; Sander Verdonschot (Comput. Geom., 2015)

Reprint of: Approximating majority depth. - Dan Chen 003; Pat Morin (Comput. Geom., 2015)

Compatible Connectivity Augmentation of Planar Disconnected Graphs. - Greg Aloupis; Luis Barba; Paz Carmi; Vida Dujmovic; Fabrizio Frati; Pat Morin (Discret. Comput. Geom., 2015)

Average Stretch Factor: How Low Does It Go? - Vida Dujmovic; Pat Morin; Michiel H. M. Smid (Discret. Comput. Geom., 2015)

Biased Predecessor Search. - Prosenjit Bose; Rolf Fagerberg; John Howat; Pat Morin (Algorithmica, 2016)

The Price of Order. - Prosenjit Bose; Pat Morin; André van Renssen (Int. J. Comput. Geom. Appl., 2016)

Towards tight bounds on theta-graphs: More is not always better. - Prosenjit Bose; Jean-Lou De Carufel; Pat Morin; André van Renssen; Sander Verdonschot (Theor. Comput. Sci., 2016)

EPG-representations with Small Grid-Size. - Therese Biedl; Martin Derka; Vida Dujmovic; Pat Morin (GD, 2017)

Encoding Arguments. - Pat Morin; Wolfgang Mulzer; Tommy Reddad (ACM Comput. Surv., 2017)

New Bounds for Facial Nonrepetitive Colouring. - Prosenjit Bose; Vida Dujmovic; Pat Morin; Lucas Rioux-Maldague (Graphs Comb., 2017)

Layered separators in minor-closed graph classes with applications. - Vida Dujmovic; Pat Morin; David R. Wood (J. Comb. Theory B, 2017)

Array Layouts for Comparison-Based Searching. - Paul-Virak Khuong; Pat Morin (ACM J. Exp. Algorithmics, 2017)

Anagram-Free Chromatic Number Is Not Pathwidth-Bounded. - Paz Carmi; Vida Dujmovic; Pat Morin (WG, 2018)

Spanning Trees in Multipartite Geometric Graphs. - Ahmad Biniaz; Prosenjit Bose; David Eppstein; Anil Maheshwari; Pat Morin; Michiel H. M. Smid (Algorithmica, 2018)

A note on interference in random networks. - Luc Devroye; Pat Morin (Comput. Geom., 2018)

Near-Optimal O(k)-Robust Geometric Spanners. - Prosenjit Bose; Paz Carmi; Vida Dujmovic; Pat Morin (CoRR, 2018)

Orthogonal Tree Decompositions of Graphs. - Vida Dujmovic; Gwenaël Joret; Pat Morin; Sergey Norin; David R. Wood (SIAM J. Discret. Math., 2018)

Corrigendum: Orthogonal Tree Decompositions of Graphs. - Vida Dujmovic; Gwenaël Joret; Pat Morin; Sergey Norin; David R. Wood (SIAM J. Discret. Math., 2018)

More Turán-Type Theorems for Triangles in Convex Point Sets. - Boris Aronov; Vida Dujmovic; Pat Morin; Aurélien Ooms; Luís Fernando Schultz Xavier da Silveira (Electron. J. Comb., 2019)

Queue Layouts of Graphs with Bounded Degree and Bounded Genus. - Vida Dujmovic; Pat Morin; David R. Wood (CoRR, 2019)

Encoding 3SUM. - Sergio Cabello; Jean Cardinal; John Iacono; Stefan Langerman; Pat Morin; Aurélien Ooms (CoRR, 2019)

The structure of k-planar graphs. - Vida Dujmovic; Pat Morin; David R. Wood (CoRR, 2019)

Notes on growing a tree in a graph. - Luc Devroye; Vida Dujmovic; Alan M. Frieze; Abbas Mehrabian; Pat Morin; Bruce A. Reed (Random Struct. Algorithms, 2019)

Asymptotically Optimal Vertex Ranking of Planar Graphs. - Prosenjit Bose; Vida Dujmovic; Mehrnoosh Javarsineh; Pat Morin (CoRR, 2020)

Sparse universal graphs for planarity. - Louis Esperet; Gwenaël Joret; Pat Morin (CoRR, 2020)

Planar Graphs Have Bounded Queue-Number. - Vida Dujmovic; Gwenaël Joret; Piotr Micek; Pat Morin; Torsten Ueckerdt; David R. Wood (J. ACM, 2020)

Minor-Closed Graph Classes with Bounded Layered Pathwidth. - Vida Dujmovic; David Eppstein; Gwenaël Joret; Pat Morin; David R. Wood (SIAM J. Discret. Math., 2020)

A Fast Algorithm for the Product Structure of Planar Graphs. - Pat Morin (Algorithmica, 2021)

2×n Grids have Unbounded Anagram-Free Chromatic Number. - Saman Bazarghani; Paz Carmi; Vida Dujmovic; Pat Morin (CoRR, 2021)

Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. - A. Karim Abu-Affash; Paz Carmi; Anil Maheshwari; Pat Morin; Michiel Smid; Shakhar Smorodinsky (Discret. Comput. Geom., 2021)

Every Collinear Set in a Planar Graph is Free. - Vida Dujmovic; Fabrizio Frati; Daniel Gonçalves 001; Pat Morin; Günter Rote (Discret. Comput. Geom., 2021)

Adjacency Labelling for Planar Graphs (and Beyond). - Vida Dujmovic; Louis Esperet; Cyril Gavoille; Gwenaël Joret; Piotr Micek; Pat Morin (J. ACM, 2021)

Two Results on Layered Pathwidth and Linear Layouts. - Vida Dujmovic; Pat Morin; Céline Yelle (J. Graph Algorithms Appl., 2021)

An Optimal Algorithm for Product Structure in Planar Graphs. - Prosenjit Bose; Pat Morin; Saeed Odak (SWAT, 2022)

Stack-Number is Not Bounded by Queue-Number. - Vida Dujmovic; David Eppstein; Robert Hickingbotham; Pat Morin; David R. Wood (Comb., 2022)

$2 times n$ Grids have Unbounded Anagram-Free Chromatic Number. - Saman Bazarghani; Paz Carmi; Vida Dujmovic; Pat Morin (Electron. J. Comb., 2022)

Linear versus centred chromatic numbers. - Prosenjit Bose; Vida Dujmovic; Hussein Houdrouge; Mehrnoosh Javarsineh; Pat Morin (CoRR, 2022)

Clustered 3-colouring graphs of bounded degree. - Vida Dujmovic; Louis Esperet; Pat Morin; Bartosz Walczak; David R. Wood (Comb. Probab. Comput., 2022)

Drawing Graphs as Spanners. - Oswin Aichholzer; Manuel Borrazzo; Prosenjit Bose; Jean Cardinal; Fabrizio Frati; Pat Morin; Birgit Vogtenhuber (Discret. Comput. Geom., 2022)

Separating layered treewidth and row treewidth. - Prosenjit Bose; Vida Dujmovic; Mehrnoosh Javarsineh; Pat Morin; David R. Wood (Discret. Math. Theor. Comput. Sci., 2022)

Proof of the Clustered Hadwiger Conjecture. - Vida Dujmovic; Louis Esperet; Pat Morin; David R. Wood (FOCS, 2023)

Min-k-planar Drawings of Graphs. - Carla Binucci; Aaron Büngener; Giuseppe Di Battista; Walter Didimo; Vida Dujmovic; Seok-Hee Hong 001; Michael Kaufmann 001; Giuseppe Liotta; Pat Morin; Alessandra Tappini (GD (1), 2023)

Nonplanar Graph Drawings with k Vertices per Face. - Carla Binucci; Giuseppe Di Battista; Walter Didimo; Seok-Hee Hong 001; Michael Kaufmann 001; Giuseppe Liotta; Pat Morin; Alessandra Tappini (WG, 2023)

Geodesic obstacle representation of graphs. - Prosenjit Bose; Paz Carmi; Vida Dujmovic; Saeed Mehrabi 001; Fabrizio Montecchiani; Pat Morin; Luís Fernando Schultz Xavier da Silveira (Comput. Geom., 2023)

Connected Dominating Sets in Triangulations. - Prosenjit Bose; Vida Dujmovic; Hussein Houdrouge; Pat Morin; Saeed Odak (CoRR, 2023)

Dual Circumference and Collinear Sets. - Vida Dujmovic; Pat Morin (Discret. Comput. Geom., 2023)

Graph product structure for non-minor-closed classes. - Vida Dujmovic; Pat Morin; David R. Wood (J. Comb. Theory B, 2023)

Stabbing Pairwise Intersecting Disks by Four Points. - Paz Carmi; Matthew J. Katz; Pat Morin (Discret. Comput. Geom., 2023)

Patricia's Bad Distributions. - Louigi Addario-Berry; Pat Morin; Ralph Neininger (AofA, 2024)

On k-Planar Graphs Without Short Cycles. - Michael A. Bekos; Prosenjit Bose; Aaron Büngener; Vida Dujmovic; Michael Hoffmann 001; Michael Kaufmann 001; Pat Morin; Saeed Odak; Alexandra Weinberger (GD, 2024)

Local Certification of Geometric Graph Classes. - Oscar Defrain; Louis Esperet; Aurélie Lagoutte; Pat Morin; Jean-Florent Raymond (MFCS, 2024)

The Grid-Minor Theorem Revisited. - Vida Dujmovic; Robert Hickingbotham; Jedrzej Hodor; Gwenaël Joret; Hoang La; Piotr Micek; Pat Morin; Clément Rambaud; David R. Wood (SODA, 2024)

Graphs Drawn With Some Vertices per Face: Density and Relationships. - Carla Binucci; Giuseppe Di Battista; Walter Didimo; Vida Dujmovic; Seok-Hee Hong 001; Michael Kaufmann 001; Giuseppe Liotta; Pat Morin; Alessandra Tappini (IEEE Access, 2024)

Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure. - Vida Dujmovic; Gwenaël Joret; Piotr Micek; Pat Morin; David R. Wood (Electron. J. Comb., 2024)

Free Sets in Planar Graphs: History and Applications. - Vida Dujmovic; Pat Morin (CoRR, 2024)

Vertex Ranking of Degenerate Graphs. - John Iacono; Piotr Micek; Pat Morin; Bruce A. Reed (CoRR, 2024)

On k-planar Graphs without Short Cycles. - Michael A. Bekos; Prosenjit Bose; Aaron Büngener; Vida Dujmovic; Michael Hoffmann 001; Michael Kaufmann 001; Pat Morin; Saeed Odak; Alexandra Weinberger (CoRR, 2024)

Erdős-Pósa property of cycles that are far apart. - Vida Dujmovic; Gwenaël Joret; Piotr Micek; Pat Morin (CoRR, 2024)

Min-k-planar Drawings of Graphs. - Carla Binucci; Aaron Büngener; Giuseppe Di Battista; Walter Didimo; Vida Dujmovic; Seok-Hee Hong 001; Michael Kaufmann 001; Giuseppe Liotta; Pat Morin; Alessandra Tappini (J. Graph Algorithms Appl., 2024)

Product Structure Extension of the Alon-Seymour-Thomas Theorem. - Marc Distel; Vida Dujmovic; David Eppstein; Robert Hickingbotham; Gwenaël Joret; Piotr Micek; Pat Morin; Michal T. Seweryn; David R. Wood (SIAM J. Discret. Math., 2024)

The Excluded Tree Minor Theorem Revisited. - Vida Dujmovic; Robert Hickingbotham; Gwenaël Joret; Piotr Micek; Pat Morin; David R. Wood (Comb. Probab. Comput., 2024)

Cops and Robbers for Graphs on Surfaces with Crossings. - Prosenjit Bose; Pat Morin; Karthik Murali 001 (MFCS, 2025)

Planar Graphs in Blowups of Fans. - Vida Dujmovic; Gwenaël Joret; Piotr Micek; Pat Morin; David R. Wood (SODA, 2025)

Grid Minors and Products. - Vida Dujmovic; Pat Morin; David R. Wood; David Worley (Electron. J. Comb., 2025)

Tight bound for the Erdős-Pósa property of tree minors. - Vida Dujmovic; Gwenaël Joret; Piotr Micek; Pat Morin (Comb. Probab. Comput., 2025)

Separation Number and Treewidth, Revisited. - Hussein Houdrouge; Babak Miraftab; Pat Morin (CoRR, 2025)

3-Colouring Planar Graphs. - Vida Dujmovic; Pat Morin; Sergey Norin; David R. Wood (CoRR, 2025)