default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPat Morin
Person information
- affiliation: Carleton University, Ottawa, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j108]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin:
Tight bound for the Erdős-Pósa property of tree minors. Comb. Probab. Comput. 34(2): 321-325 (2025)- [c83]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood:
Planar Graphs in Blowups of Fans. SODA 2025: 3382-3391 - [i73]Hussein Houdrouge, Babak Miraftab, Pat Morin:
Separation Number and Treewidth, Revisited. CoRR abs/2503.17112 (2025) - 2024
- [j107]Carla Binucci
, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Graphs Drawn With Some Vertices per Face: Density and Relationships. IEEE Access 12: 68828-68846 (2024) - [j106]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood:
Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure. Electron. J. Comb. 31(2) (2024) - [j105]Vida Dujmovic, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood:
The Excluded Tree Minor Theorem Revisited. Comb. Probab. Comput. 33(1): 85-90 (2024) - [j104]Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Min-k-planar Drawings of Graphs. J. Graph Algorithms Appl. 28(2): 1-35 (2024) - [j103]Marc Distel, Vida Dujmovic, David Eppstein, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, Michal T. Seweryn, David R. Wood:
Product Structure Extension of the Alon-Seymour-Thomas Theorem. SIAM J. Discret. Math. 38(3): 2095-2107 (2024) - [j102]Vida Dujmovic, Gwenaël Joret, Pat Morin, Sergey Norin, David R. Wood:
Corrigendum: Orthogonal Tree-Decompositions of Graphs. SIAM J. Discret. Math. 38(4): 3220-3221 (2024) - [c82]Louigi Addario-Berry, Pat Morin, Ralph Neininger:
Patricia's Bad Distributions. AofA 2024: 25:1-25:8 - [c81]Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmovic, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, Alexandra Weinberger:
On k-Planar Graphs Without Short Cycles. GD 2024: 27:1-27:17 - [c80]Oscar Defrain, Louis Esperet, Aurélie Lagoutte, Pat Morin, Jean-Florent Raymond:
Local Certification of Geometric Graph Classes. MFCS 2024: 48:1-48:14 - [c79]Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood:
The Grid-Minor Theorem Revisited. SODA 2024: 1241-1245 - [i72]Vida Dujmovic, Pat Morin, David R. Wood, David Worley:
Grid Minors and Products. CoRR abs/2402.14181 (2024) - [i71]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin:
Tight bound for the Erdős-Pósa property of tree minors. CoRR abs/2403.06370 (2024) - [i70]Vida Dujmovic, Pat Morin:
Free Sets in Planar Graphs: History and Applications. CoRR abs/2403.17090 (2024) - [i69]John Iacono, Piotr Micek, Pat Morin, Bruce A. Reed:
Vertex Ranking of Degenerate Graphs. CoRR abs/2404.16340 (2024) - [i68]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood:
Planar graphs in blowups of fans. CoRR abs/2407.05936 (2024) - [i67]Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmovic, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, Alexandra Weinberger:
On k-planar Graphs without Short Cycles. CoRR abs/2408.16085 (2024) - [i66]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin:
Erdős-Pósa property of cycles that are far apart. CoRR abs/2412.13893 (2024) - 2023
- [j101]Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, Luís Fernando Schultz Xavier da Silveira:
Geodesic obstacle representation of graphs. Comput. Geom. 109: 101946 (2023) - [j100]Vida Dujmovic, Pat Morin:
Dual Circumference and Collinear Sets. Discret. Comput. Geom. 69(1): 26-50 (2023) - [j99]Paz Carmi, Matthew J. Katz, Pat Morin:
Stabbing Pairwise Intersecting Disks by Four Points. Discret. Comput. Geom. 70(4): 1751-1784 (2023) - [j98]Vida Dujmovic, Pat Morin, David R. Wood:
Graph product structure for non-minor-closed classes. J. Comb. Theory B 162: 34-67 (2023) - [c78]Vida Dujmovic, Louis Esperet, Pat Morin, David R. Wood:
Proof of the Clustered Hadwiger Conjecture. FOCS 2023: 1921-1930 - [c77]Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Min-k-planar Drawings of Graphs. GD (1) 2023: 39-52 - [c76]Carla Binucci, Giuseppe Di Battista, Walter Didimo, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Nonplanar Graph Drawings with k Vertices per Face. WG 2023: 86-100 - [e2]Pat Morin, Subhash Suri:
Algorithms and Data Structures - 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 - August 2, 2023, Proceedings. Lecture Notes in Computer Science 14079, Springer 2023, ISBN 978-3-031-38905-4 [contents] - [i65]Vida Dujmovic, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood:
The Excluded Tree Minor Theorem Revisited. CoRR abs/2303.14970 (2023) - [i64]Vida Dujmovic, Louis Esperet, Pat Morin, David R. Wood:
Proof of the Clustered Hadwiger Conjecture. CoRR abs/2306.06224 (2023) - [i63]Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood:
The grid-minor theorem revisited. CoRR abs/2307.02816 (2023) - [i62]Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Min-k-planar Drawings of Graphs. CoRR abs/2308.13401 (2023) - [i61]Oscar Defrain, Louis Esperet, Aurélie Lagoutte, Pat Morin, Jean-Florent Raymond:
Local certification of geometric graph classes. CoRR abs/2311.16953 (2023) - [i60]Prosenjit Bose, Vida Dujmovic, Hussein Houdrouge, Pat Morin, Saeed Odak:
Connected Dominating Sets in Triangulations. CoRR abs/2312.03399 (2023) - 2022
- [j97]Vida Dujmovic, David Eppstein, Robert Hickingbotham, Pat Morin, David R. Wood:
Stack-Number is Not Bounded by Queue-Number. Comb. 42(2): 151-164 (2022) - [j96]Saman Bazarghani, Paz Carmi, Vida Dujmovic, Pat Morin:
$2\times n$ Grids have Unbounded Anagram-Free Chromatic Number. Electron. J. Comb. 29(3) (2022) - [j95]Vida Dujmovic, Louis Esperet, Pat Morin, Bartosz Walczak, David R. Wood:
Clustered 3-colouring graphs of bounded degree. Comb. Probab. Comput. 31(1): 123-135 (2022) - [j94]Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, Birgit Vogtenhuber:
Drawing Graphs as Spanners. Discret. Comput. Geom. 68(3): 774-795 (2022) - [j93]Prosenjit Bose, Vida Dujmovic, Mehrnoosh Javarsineh, Pat Morin, David R. Wood:
Separating layered treewidth and row treewidth. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - [c75]Prosenjit Bose, Pat Morin, Saeed Odak:
An Optimal Algorithm for Product Structure in Planar Graphs. SWAT 2022: 19:1-19:14 - [i59]Prosenjit Bose, Pat Morin, Saeed Odak:
An Optimal Algorithm for Product Structure in Planar Graphs. CoRR abs/2202.08870 (2022) - [i58]Prosenjit Bose, Vida Dujmovic, Hussein Houdrouge, Mehrnoosh Javarsineh, Pat Morin:
Linear versus centred chromatic numbers. CoRR abs/2205.15096 (2022) - 2021
- [j92]Pat Morin:
A Fast Algorithm for the Product Structure of Planar Graphs. Algorithmica 83(5): 1544-1558 (2021) - [j91]Vida Dujmovic, Fabrizio Frati, Daniel Gonçalves, Pat Morin, Günter Rote:
Every Collinear Set in a Planar Graph is Free. Discret. Comput. Geom. 65(4): 999-1027 (2021) - [j90]A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel Smid, Shakhar Smorodinsky:
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. Discret. Comput. Geom. 66(4): 1401-1414 (2021) - [j89]Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin:
Adjacency Labelling for Planar Graphs (and Beyond). J. ACM 68(6): 42:1-42:33 (2021) - [j88]Vida Dujmovic, Pat Morin, Céline Yelle:
Two Results on Layered Pathwidth and Linear Layouts. J. Graph Algorithms Appl. 25(1): 43-57 (2021) - [i57]Prosenjit Bose, Vida Dujmovic, Mehrnoosh Javarsineh, Pat Morin, David R. Wood:
Separating layered treewidth and row treewidth. CoRR abs/2105.01230 (2021) - [i56]Saman Bazarghani, Paz Carmi, Vida Dujmovic, Pat Morin:
2×n Grids have Unbounded Anagram-Free Chromatic Number. CoRR abs/2105.01916 (2021) - 2020
- [j87]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood:
Planar Graphs Have Bounded Queue-Number. J. ACM 67(4): 22:1-22:38 (2020) - [j86]Vida Dujmovic, David Eppstein, Gwenaël Joret, Pat Morin, David R. Wood:
Minor-Closed Graph Classes with Bounded Layered Pathwidth. SIAM J. Discret. Math. 34(3): 1693-1709 (2020) - [c74]Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin:
Adjacency Labelling for Planar Graphs (and Beyond). FOCS 2020: 577-588 - [c73]Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, Birgit Vogtenhuber:
Drawing Graphs as Spanners. WG 2020: 310-324 - [i55]Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, Birgit Vogtenhuber:
Drawing Graphs as Spanners. CoRR abs/2002.05580 (2020) - [i54]Vida Dujmovic, Louis Esperet, Gwenaël Joret, Cyril Gavoille, Piotr Micek, Pat Morin:
Adjacency Labelling for Planar Graphs (and Beyond). CoRR abs/2003.04280 (2020) - [i53]Pat Morin:
A Fast Algorithm for the Product Structure of Planar Graphs. CoRR abs/2004.02530 (2020) - [i52]Vida Dujmovic, Pat Morin, Céline Yelle:
Two Results on Layered Pathwidth and Linear Layouts. CoRR abs/2004.03571 (2020) - [i51]Prosenjit Bose, Vida Dujmovic, Mehrnoosh Javarsineh, Pat Morin:
Asymptotically Optimal Vertex Ranking of Planar Graphs. CoRR abs/2007.06455 (2020) - [i50]Louis Esperet, Gwenaël Joret, Pat Morin:
Sparse universal graphs for planarity. CoRR abs/2010.05779 (2020) - [i49]Vida Dujmovic, David Eppstein, Robert Hickingbotham, Pat Morin, David R. Wood:
Stack-number is not bounded by queue-number. CoRR abs/2011.04195 (2020)
2010 – 2019
- 2019
- [j85]Boris Aronov, Vida Dujmovic, Pat Morin, Aurélien Ooms, Luís Fernando Schultz Xavier da Silveira:
More Turán-Type Theorems for Triangles in Convex Point Sets. Electron. J. Comb. 26(1): 1 (2019) - [j84]Luc Devroye, Vida Dujmovic, Alan M. Frieze, Abbas Mehrabian, Pat Morin, Bruce A. Reed:
Notes on growing a tree in a graph. Random Struct. Algorithms 55(2): 290-312 (2019) - [c72]Vida Dujmovic, Pat Morin:
Dual Circumference and Collinear Sets. SoCG 2019: 29:1-29:17 - [c71]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood:
Planar Graphs have Bounded Queue-Number. FOCS 2019: 862-875 - [c70]Vida Dujmovic, Fabrizio Frati, Daniel Gonçalves, Pat Morin, Günter Rote:
Every Collinear Set in a Planar Graph Is Free. SODA 2019: 1521-1538 - [i48]Vida Dujmovic, Pat Morin, David R. Wood:
Queue Layouts of Graphs with Bounded Degree and Bounded Genus. CoRR abs/1901.05594 (2019) - [i47]Sergio Cabello, Jean Cardinal, John Iacono, Stefan Langerman, Pat Morin, Aurélien Ooms:
Encoding 3SUM. CoRR abs/1903.02645 (2019) - [i46]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood:
Planar Graphs have Bounded Queue-Number. CoRR abs/1904.04791 (2019) - [i45]Vida Dujmovic, Pat Morin, David R. Wood:
The structure of k-planar graphs. CoRR abs/1907.05168 (2019) - 2018
- [j83]Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Spanning Trees in Multipartite Geometric Graphs. Algorithmica 80(11): 3177-3191 (2018) - [j82]Luc Devroye, Pat Morin:
A note on interference in random networks. Comput. Geom. 67: 2-10 (2018) - [j81]Vida Dujmovic, Gwenaël Joret, Pat Morin, Sergey Norin, David R. Wood:
Orthogonal Tree Decompositions of Graphs. SIAM J. Discret. Math. 32(2): 839-863 (2018) - [j80]Vida Dujmovic, Gwenaël Joret, Pat Morin, Sergey Norin, David R. Wood:
Corrigendum: Orthogonal Tree Decompositions of Graphs. SIAM J. Discret. Math. 32(4): 3003-3004 (2018) - [c69]A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid, Shakhar Smorodinsky:
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. SoCG 2018: 2:1-2:12 - [c68]Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, Luís Fernando Schultz Xavier da Silveira:
Geodesic Obstacle Representation of Graphs. ICALP 2018: 23:1-23:13 - [c67]Paz Carmi, Vida Dujmovic, Pat Morin:
Anagram-Free Chromatic Number Is Not Pathwidth-Bounded. WG 2018: 91-99 - [i44]Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, Luís Fernando Schultz Xavier da Silveira:
Geodesic Obstacle Representation of Graphs. CoRR abs/1803.03705 (2018) - [i43]Vida Dujmovic, David Eppstein, Gwenaël Joret, Pat Morin, David R. Wood:
Minor-closed graph classes with bounded layered pathwidth. CoRR abs/1810.08314 (2018) - [i42]Paz Carmi, Matthew J. Katz, Pat Morin:
Stabbing Pairwise Intersecting Disks by Four Points. CoRR abs/1812.06907 (2018) - [i41]Prosenjit Bose, Paz Carmi, Vida Dujmovic, Pat Morin:
Near-Optimal O(k)-Robust Geometric Spanners. CoRR abs/1812.09913 (2018) - 2017
- [j79]Pat Morin, Wolfgang Mulzer, Tommy Reddad:
Encoding Arguments. ACM Comput. Surv. 50(3): 46:1-46:36 (2017) - [j78]Prosenjit Bose, Vida Dujmovic, Pat Morin, Lucas Rioux-Maldague:
New Bounds for Facial Nonrepetitive Colouring. Graphs Comb. 33(4): 817-832 (2017) - [j77]Vida Dujmovic, Pat Morin, David R. Wood:
Layered separators in minor-closed graph classes with applications. J. Comb. Theory B 127: 111-147 (2017) - [j76]Paul-Virak Khuong, Pat Morin:
Array Layouts for Comparison-Based Searching. ACM J. Exp. Algorithmics 22 (2017) - [c66]Therese Biedl, Martin Derka, Vida Dujmovic, Pat Morin:
EPG-representations with Small Grid-Size. GD 2017: 184-196 - [i40]Boris Aronov, Vida Dujmovic, Pat Morin, Aurélien Ooms, Luís Fernando Schultz Xavier da Silveira:
More Turán-Type Theorems for Triangles in Convex Point Sets. CoRR abs/1706.10193 (2017) - [i39]Luc Devroye, Vida Dujmovic, Alan M. Frieze, Abbas Mehrabian, Pat Morin, Bruce A. Reed:
Notes on Growing a Tree in a Graph. CoRR abs/1707.00083 (2017) - [i38]Prosenjit Bose, Rolf Fagerberg, John Howat, Pat Morin:
Biased Predecessor Search. CoRR abs/1707.01182 (2017) - [i37]Therese Biedl, Martin Derka, Vida Dujmovic, Pat Morin:
EPG-representations with small grid-size. CoRR abs/1708.09749 (2017) - 2016
- [j75]Prosenjit Bose, Rolf Fagerberg, John Howat, Pat Morin:
Biased Predecessor Search. Algorithmica 76(4): 1097-1105 (2016) - [j74]Prosenjit Bose, Pat Morin, André van Renssen:
The Price of Order. Int. J. Comput. Geom. Appl. 26(3-4): 135-150 (2016) - [j73]Prosenjit Bose, Jean-Lou De Carufel, Pat Morin, André van Renssen, Sander Verdonschot:
Towards tight bounds on theta-graphs: More is not always better. Theor. Comput. Sci. 616: 70-93 (2016) - [c65]Prosenjit Bose, Vida Dujmovic, Pat Morin, Lucas Rioux-Maldague:
New Bounds for Facial Nonrepetitive Colouring. CCCG 2016: 295-302 - [i36]Prosenjit Bose, Pat Morin, André van Renssen:
The Price of Order. CoRR abs/1602.00399 (2016) - [i35]Pat Morin, Wolfgang Mulzer, Tommy Reddad:
Encoding Arguments. CoRR abs/1603.08777 (2016) - [i34]Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Spanning Trees in Multipartite Geometric Graphs. CoRR abs/1611.01661 (2016) - 2015
- [j72]Prosenjit Bose, Vida Dujmovic, Nima Hoda, Pat Morin:
Visibility-monotonic polygon deflation. Contributions Discret. Math. 10(1) (2015) - [j71]Vida Dujmovic, Pat Morin:
On Obstacle Numbers. Electron. J. Comb. 22(3): 3 (2015) - [j70]Prosenjit Bose, Pat Morin, André van Renssen, Sander Verdonschot:
The θ5-graph is a spanner. Comput. Geom. 48(2): 108-119 (2015) - [j69]Dan Chen, Pat Morin:
Reprint of: Approximating majority depth. Comput. Geom. 49: 2-7 (2015) - [j68]Vida Dujmovic, Pat Morin, Michiel H. M. Smid:
Average Stretch Factor: How Low Does It Go? Discret. Comput. Geom. 53(2): 296-326 (2015) - [j67]Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin:
Compatible Connectivity Augmentation of Planar Disconnected Graphs. Discret. Comput. Geom. 54(2): 459-480 (2015) - [c64]Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin:
Compatible Connectivity-Augmentation of Planar Disconnected Graphs. SODA 2015: 1602-1615 - [i33]Paul-Virak Khuong, Pat Morin:
Array Layouts for Comparison-Based Searching. CoRR abs/1509.05053 (2015) - 2014
- [j66]Vida Dujmovic, Pat Morin, Adam Sheffer:
Crossings in Grid Drawings. Electron. J. Comb. 21(1): 1 (2014) - [j65]Pat Morin:
Guest Editor's Introduction. Comput. Geom. 47(2): 295 (2014) - [c63]Pat Morin, Sander Verdonschot:
On the Average Number of Edges in Theta Graphs. ANALCO 2014: 121-132 - [c62]Prosenjit Bose, John Howat, Pat Morin:
Searching by Panning and Zooming. CCCG 2014 - [c61]Prosenjit Bose, Pat Morin, André van Renssen:
The Price of Order. ISAAC 2014: 313-325 - [c60]Prosenjit Bose, Rolf Fagerberg, John Howat, Pat Morin:
Biased Predecessor Search. LATIN 2014: 755-764 - [i32]Prosenjit Bose, Jean-Lou De Carufel, Pat Morin, André van Renssen, Sander Verdonschot:
Towards Tight Bounds on Theta-Graphs. CoRR abs/1404.6233 (2014) - [i31]Luis Barba, Pat Morin:
Top-Down Skiplists. CoRR abs/1407.7917 (2014) - [i30]Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin:
Compatible Connectivity-Augmentation of Planar Disconnected Graphs. CoRR abs/1408.2436 (2014) - 2013
- [j64]Dan Chen, Olivier Devillers, John Iacono, Stefan Langerman, Pat Morin:
Oja centers and centers of gravity. Comput. Geom. 46(2): 140-147 (2013) - [j63]Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat, Pat Morin:
Fast local searches and updates in bounded universes. Comput. Geom. 46(2): 181-189 (2013) - [j62]Dan Chen, Pat Morin, Uli Wagner:
Absolute approximation of Tukey depth: Theory and experiments. Comput. Geom. 46(5): 566-573 (2013) - [j61]Dan Chen, Pat Morin:
Approximating majority depth. Comput. Geom. 46(9): 1059-1064 (2013) - [j60]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, Diane L. Souvaine, Ryuhei Uehara:
Coverage with k-transmitters in the presence of obstacles. J. Comb. Optim. 25(2): 208-233 (2013) - [j59]Prosenjit Bose, Vida Dujmovic, Pat Morin, Michiel H. M. Smid:
Robust Geometric Spanners. SIAM J. Comput. 42(4): 1720-1736 (2013) - [c59]Prosenjit Bose, John Howat, Pat Morin:
A History of Distribution-Sensitive Data Structures. Space-Efficient Data Structures, Streams, and Algorithms 2013: 133-149 - [c58]Prosenjit Bose, Vida Dujmovic, Pat Morin, Michiel H. M. Smid:
Robust geometric spanners. SoCG 2013: 449-458 - [c57]Vida Dujmovic, Pat Morin, David R. Wood:
Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive Coloring. FOCS 2013: 280-289 - [c56]Prosenjit Bose, Pat Morin, André van Renssen, Sander Verdonschot:
The θ 5-Graph is a Spanner. WG 2013: 100-114 - [i29]Vida Dujmovic, Pat Morin, Adam Sheffer:
Crossings in Grid Drawings. CoRR abs/1301.0303 (2013) - [i28]John Howat, John Iacono, Pat Morin:
The Fresh-Finger Property. CoRR abs/1302.6914 (2013) - [i27]Pat Morin, Sander Verdonschot:
On the Average Number of Edges in Theta Graphs. CoRR abs/1304.3402 (2013) - [i26]Vida Dujmovic, Pat Morin, Michiel H. M. Smid:
Average Stretch Factor: How Low Does It Go? CoRR abs/1305.4170 (2013) - [i25]Vida Dujmovic, Pat Morin, David R. Wood:
Layered Separators in Minor-Closed Families with Applications. CoRR abs/1306.1595 (2013) - [i24]Vida Dujmovic, Pat Morin:
On Obstacle Numbers. CoRR abs/1308.4321 (2013) - 2012
- [j58]Vida Dujmovic, John Howat, Pat Morin:
Biased Range Trees. Algorithmica 62(1-2): 21-37 (2012) - [j57]Dan Chen, Luc Devroye, Vida Dujmovic, Pat Morin:
Memoryless routing in convex subdivisions: Random walks are optimal. Comput. Geom. 45(4): 178-185 (2012) - [j56]David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Pat Morin, Ryuhei Uehara:
Ghost chimneys. Int. J. Comput. Geom. Appl. 22(3): 207-214 (2012) - [j55]Prosenjit Bose, John Howat, Pat Morin:
A distribution-sensitive dictionary with low space overhead. J. Discrete Algorithms 10: 140-145 (2012) - [j54]Prosenjit Bose, Karim Douïeb, Pat Morin:
Skip lift: A probabilistic alternative to red-black trees. J. Discrete Algorithms 14: 13-20 (2012) - [j53]Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin:
Succinct geometric indexes supporting point location queries. ACM Trans. Algorithms 8(2): 10:1-10:26 (2012) - [j52]Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin:
Entropy, triangulation, and point location in planar subdivisions. ACM Trans. Algorithms 8(3): 29:1-29:18 (2012) - [c55]Prosenjit Bose, Vida Dujmovic, Nima Hoda, Pat Morin:
Visibility Monotonic Polygon Deflation. CCCG 2012: 11-16 - [c54]Luc Devroye, Pat Morin:
A Note on Interference in Random Networks. CCCG 2012: 193-198 - [c53]Dan Chen, Pat Morin:
Approximating Majority Depth. CCCG 2012: 229-234 - [c52]Prosenjit Bose, Jean-Lou De Carufel, Pat Morin, André van Renssen, Sander Verdonschot:
Optimal Bounds on Theta-Graphs: More is not Always Better. CCCG 2012: 291-296 - [i23]Luc Devroye, Pat Morin:
A Note on Interference in Random Point Sets. CoRR abs/1202.5945 (2012) - [i22]Prosenjit Bose, Vida Dujmovic, Pat Morin, Michiel H. M. Smid:
Robust Geometric Spanners. CoRR abs/1204.4679 (2012) - [i21]Dan Chen, Pat Morin:
Approximating Majority Depth. CoRR abs/1205.1524 (2012) - [i20]Prosenjit Bose, Vida Dujmovic, Nima Hoda, Pat Morin:
Visibility-Monotonic Polygon Deflation. CoRR abs/1206.1982 (2012) - [i19]Prosenjit Bose, Pat Morin, André van Renssen, Sander Verdonschot:
The theta-5-graph is a spanner. CoRR abs/1212.0570 (2012) - 2011
- [j51]Joachim Gudmundsson, Pat Morin, Michiel H. M. Smid:
Algorithms for Marketing-Mix Optimization. Algorithmica 60(4): 1004-1016 (2011) - [j50]Kevin Buchin, Maarten Löffler, Pat Morin, Wolfgang Mulzer:
Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended. Algorithmica 61(3): 674-693 (2011) - [j49]Vida Dujmovic, Joachim Gudmundsson, Pat Morin, Thomas Wolle:
Notes on Large Angle Crossing Graphs. Chic. J. Theor. Comput. Sci. 2011 (2011) - [j48]Evangelos Kranakis, Danny Krizanc, Pat Morin:
Randomized rendezvous with limited memory. ACM Trans. Algorithms 7(3): 34:1-34:12 (2011) - [c51]Dan Chen, Pat Morin:
Algorithms for Bivariate Majority Depth. CCCG 2011 - 2010
- [j47]Prosenjit Bose, Sébastien Collette, Stefan Langerman, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Sigma-local graphs. J. Discrete Algorithms 8(1): 15-23 (2010) - [c50]Vida Dujmovic, Joachim Gudmundsson, Pat Morin, Thomas Wolle:
Notes on Large Angle Crossing Graphs. CATS 2010: 19-24 - [c49]David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Pat Morin, Ryuhei Uehara:
Ghost chimneys. CCCG 2010: 63-66 - [c48]Dan Chen, Olivier Devillers, John Iacono, Stefan Langerman, Pat Morin:
Oja medians and centers of gravity. CCCG 2010: 147-150 - [c47]Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat, Pat Morin:
Fast local searches and updates in bounded universes. CCCG 2010: 261-264 - [c46]Greg Aloupis, Prosenjit Bose, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Karim Douïeb, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin:
Common Unfoldings of Polyominoes and Polycubes. CGGA 2010: 44-54 - [c45]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, Diane L. Souvaine, Ryuhei Uehara:
Coverage with k-Transmitters in the Presence of Obstacles. COCOA (2) 2010: 1-15 - [c44]Joachim Gudmundsson, Pat Morin:
Planar visibility: testing and counting. SCG 2010: 77-86 - [c43]Prosenjit Bose, Karim Douïeb, Pat Morin:
Skip Lift: A Probabilistic Alternative to Red-Black Trees. IWOCA 2010: 226-237 - [c42]Prosenjit Bose, Paz Carmi, Dana Jansens, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Improved Methods For Generating Quasi-gray Codes. SWAT 2010: 224-235 - [i18]Joachim Gudmundsson, Pat Morin:
Planar Visibility: Testing and Counting. CoRR abs/1001.2734 (2010) - [i17]Prosenjit Bose, Luc Devroye, Karim Douïeb, Vida Dujmovic, James King, Pat Morin:
Point Location in Disconnected Planar Subdivisions. CoRR abs/1001.2763 (2010) - [i16]Prosenjit Bose, Luc Devroye, Karim Douïeb, Vida Dujmovic, James King, Pat Morin:
Odds-On Trees. CoRR abs/1002.1092 (2010) - [i15]Evangelos Kranakis, Danny Krizanc, Pat Morin, Lata Narayanan, Ladislav Stacho:
A Tight Bound on the Maximum Interference of Random Sensors in the Highway Model. CoRR abs/1007.2120 (2010) - [i14]Dana Jansens, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Improved Methods For Generating Quasi-Gray Codes. CoRR abs/1010.0905 (2010)
2000 – 2009
- 2009
- [j46]Prosenjit Bose, Pat Morin, Michiel H. M. Smid, Stefanie Wuhrer:
Clamshell Casting. Algorithmica 55(4): 666-702 (2009) - [j45]Prosenjit Bose, Pat Morin, Michiel H. M. Smid, Stefanie Wuhrer:
Rotationally monotone polygons. Comput. Geom. 42(5): 471-483 (2009) - [j44]Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Pat Morin:
Connectivity-preserving transformations of binary images. Comput. Vis. Image Underst. 113(10): 1027-1038 (2009) - [j43]Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Stefan Langerman, Pat Morin, David R. Wood:
A Polynomial Bound for Untangling Geometric Planar Graphs. Discret. Comput. Geom. 42(4): 570-585 (2009) - [j42]Jeff Erickson, Ferran Hurtado, Pat Morin:
Centerpoint Theorems for Wedges. Discret. Math. Theor. Comput. Sci. 11(1): 45-54 (2009) - [j41]Rossen Atanassov, Prosenjit Bose, Mathieu Couture, Anil Maheshwari, Pat Morin, Michel Paquette, Michiel H. M. Smid, Stefanie Wuhrer:
Algorithms for optimal outlier removal. J. Discrete Algorithms 7(2): 239-248 (2009) - [j40]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Spanners of Complete k-Partite Geometric Graphs. SIAM J. Comput. 38(5): 1803-1820 (2009) - [c41]Vida Dujmovic, John Howat, Pat Morin:
Biased range trees. SODA 2009: 486-495 - [c40]Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin:
Succinct geometric indexes supporting point location queries. SODA 2009: 635-644 - [c39]Prosenjit Bose, Meng He, Anil Maheshwari, Pat Morin:
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing. WADS 2009: 98-109 - [c38]Prosenjit Bose, John Howat, Pat Morin:
A Distribution-Sensitive Dictionary with Low Space Overhead. WADS 2009: 110-118 - [c37]Kevin Buchin, Maarten Löffler, Pat Morin, Wolfgang Mulzer:
Delaunay Triangulation of Imprecise Points Simplified and Extended. WADS 2009: 131-143 - [i13]Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin:
Entropy, Triangulation, and Point Location in Planar Subdivisions. CoRR abs/0901.1908 (2009) - [i12]Joachim Gudmundsson, Pat Morin, Michiel H. M. Smid:
Algorithms for Marketing-Mix Optimization. CoRR abs/0903.0308 (2009) - [i11]Luc Devroye, Joachim Gudmundsson, Pat Morin:
On the Expected Maximum Degree of Gabriel and Yao Graphs. CoRR abs/0905.3584 (2009) - [i10]Vida Dujmovic, Joachim Gudmundsson, Pat Morin, Thomas Wolle:
Notes on large angle crossing graphs. CoRR abs/0908.3545 (2009) - [i9]Dan Chen, Luc Devroye, Vida Dujmovic, Pat Morin:
Memoryless Routing in Convex Subdivisions: Random Walks are Optimal. CoRR abs/0911.2484 (2009) - 2008
- [j39]Paz Carmi, Vida Dujmovic, Pat Morin, David R. Wood:
Distinct Distances in Graph Drawings. Electron. J. Comb. 15(1) (2008) - [j38]Harish Gopala, Pat Morin:
Algorithms for bivariate zonoid depth. Comput. Geom. 39(1): 2-13 (2008) - [j37]Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint:
Edge-unfolding nested polyhedral bands. Comput. Geom. 39(1): 30-42 (2008) - [j36]Pat Morin:
An optimal randomized algorithm for d-variate zonoid depth. Comput. Geom. 39(3): 229-235 (2008) - [j35]Pankaj K. Agarwal, Rolf Klein, Christian Knauer, Stefan Langerman, Pat Morin, Micha Sharir, Michael A. Soss:
Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D. Discret. Comput. Geom. 39(1-3): 17-37 (2008) - [j34]Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Pat Morin, Stefan Langerman, David R. Wood:
A Polynomial Bound for Untangling Geometric Planar Graphs. Electron. Notes Discret. Math. 31: 213-218 (2008) - [j33]Prosenjit Bose, Hua Guo, Evangelos Kranakis, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Yihui Tang:
On the false-positive rate of Bloom filters. Inf. Process. Lett. 108(4): 210-213 (2008) - [j32]Erik D. Demaine, Jeff Erickson, Danny Krizanc, Henk Meijer, Pat Morin, Mark H. Overmars, Sue Whitesides:
Realizing partitions respecting full and partial order information. J. Discrete Algorithms 6(1): 51-58 (2008) - [j31]Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer:
A Characterization of the degree sequences of 2-trees. J. Graph Theory 58(3): 191-209 (2008) - [j30]David Bremner, Dan Chen, John Iacono, Stefan Langerman, Pat Morin:
Output-sensitive algorithms for Tukey depth and related problems. Stat. Comput. 18(3): 259-266 (2008) - [c36]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Spanners of Complete k -Partite Geometric Graphs. LATIN 2008: 170-181 - [c35]Evangelos Kranakis, Danny Krizanc, Pat Morin:
Randomized Rendez-Vous with Limited Memory. LATIN 2008: 605-616 - [c34]Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin:
Distribution-sensitive point location in convex subdivisions. SODA 2008: 912-921 - [i8]Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin:
Succinct Geometric Indexes Supporting Point Location Queries. CoRR abs/0805.4147 (2008) - [i7]Vida Dujmovic, John Howat, Pat Morin:
Biased Range Trees. CoRR abs/0806.2707 (2008) - 2007
- [j29]Greg Aloupis, Prosenjit Bose, Pat Morin:
Reconfiguring Triangulations with Edge Flips and Point Moves. Algorithmica 47(4): 367-378 (2007) - [j28]Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Jan Vahrenhold:
Space-efficient geometric divide-and-conquer algorithms. Comput. Geom. 37(3): 209-227 (2007) - [j27]Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin:
Geodesic Ham-Sandwich Cuts. Discret. Comput. Geom. 37(3): 325-339 (2007) - [j26]Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood:
Simultaneous diagonal flips in plane triangulations. J. Graph Theory 54(4): 307-330 (2007) - [c33]Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer:
A Characterization of the Degree Sequences of 2-trees. ANALCO 2007: 232-241 - [i6]Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Stefan Langerman, Pat Morin, David R. Wood:
A polynomial bound for untangling geometric planar graphs. CoRR abs/0710.1641 (2007) - [i5]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Spanners of Complete $k$-Partite Geometric Graphs. CoRR abs/0712.0554 (2007) - 2006
- [c32]Rossen Atanassov, Pat Morin, Stefanie Wuhrer:
Removing Outliers to Minimize Area and Perimeter. CCCG 2006 - [c31]Prosenjit Bose, Pat Morin, Michiel H. M. Smid, Stefanie Wuhrer:
Rotationally Monotone Polygons. CCCG 2006 - [c30]Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood:
Simultaneous diagonal flips in plane triangulations. SODA 2006: 212-221 - [i4]Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer:
A Characterization of the Degree Sequences of 2-Trees. CoRR abs/cs/0605011 (2006) - 2005
- [j25]Prosenjit Bose, Pat Morin:
Guest Editors' Foreword. Algorithmica 42(1): 1-2 (2005) - [j24]David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint:
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. Discret. Comput. Geom. 33(4): 593-604 (2005) - [j23]Stefan Langerman, Pat Morin:
Covering Things with Things. Discret. Comput. Geom. 33(4): 717-729 (2005) - [j22]Danny Krizanc, Pat Morin, Michiel H. M. Smid:
Range Mode and Range Median Queries on Lists and Trees. Nord. J. Comput. 12(1): 1-17 (2005) - [j21]Vida Dujmovic, Pat Morin, David R. Wood:
Layout of Graphs with Bounded Tree-Width. SIAM J. Comput. 34(3): 553-579 (2005) - [c29]Prosenjit Bose, Evangelos Kranakis, Pat Morin, Yihui Tang:
Approximate Range Mode and Range Median Queries. STACS 2005: 377-388 - [i3]Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood:
Simultaneous Diagonal Flips in Plane Triangulations. CoRR abs/math/0509478 (2005) - 2004
- [j20]Prosenjit Bose, Pat Morin:
Testing the Quality of Manufactured Disks and Balls. Algorithmica 38(1): 161-177 (2004) - [j19]Mark de Berg, Prosenjit Bose, Otfried Cheong, Pat Morin:
On simplifying dot maps. Comput. Geom. 27(1): 43-62 (2004) - [j18]Prosenjit Bose, Joachim Gudmundsson, Pat Morin:
Ordered theta graphs. Comput. Geom. 28(1): 11-18 (2004) - [j17]Pat Morin, Jason Morrison:
The geometry of carpentry and joinery. Discret. Appl. Math. 144(3): 374-380 (2004) - [j16]Prosenjit Bose, Pat Morin, Antoine Vigneron:
Packing two disks into a polygonal environment. J. Discrete Algorithms 2(3): 373-380 (2004) - [j15]Prosenjit Bose, Jurek Czyzowicz, Pat Morin, David R. Wood:
The Maximum Number of Edges in a Three-Dimensional Grid-Drawing. J. Graph Algorithms Appl. 8: 21-26 (2004) - [j14]Pat Morin, David R. Wood:
Three-Dimensional 1-Bend Graph Drawings. J. Graph Algorithms Appl. 8(3): 357-366 (2004) - [j13]Luc Devroye, Pat Morin, Alfredo Viola:
On Worst-Case Robin Hood Hashing. SIAM J. Comput. 33(4): 923-936 (2004) - [j12]Prosenjit Bose, Pat Morin:
Online Routing in Triangulations. SIAM J. Comput. 33(4): 937-951 (2004) - [j11]Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint:
Space-efficient planar convex hull algorithms. Theor. Comput. Sci. 321(1): 25-40 (2004) - [j10]Prosenjit Bose, Pat Morin:
Competitive online routing in geometric graphs. Theor. Comput. Sci. 324(2-3): 273-288 (2004) - [c28]Michel Barbeau, Evangelos Kranakis, Danny Krizanc, Pat Morin:
Improving Distance Based Geographic Location Techniques in Sensor Networks. ADHOC-NOW 2004: 197-210 - [c27]Pat Morin, David R. Wood:
Three-dimensional 1-bend graph drawings. CCCG 2004: 40-43 - [c26]Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint:
Unfolding polyhedral bands. CCCG 2004: 60-63 - [c25]Harish Gopala, Pat Morin:
Algorithms for bivariate zonoid depth. CCCG 2004: 132-135 - [c24]Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin:
Geodesic ham-sandwich cuts. SCG 2004: 1-9 - [c23]Greg Aloupis, Prosenjit Bose, Pat Morin:
Reconfiguring Triangulations with Edge Flips and Point Moves. GD 2004: 1-11 - [r1]Pat Morin:
Hash Tables. Handbook of Data Structures and Applications 2004 - [i2]Vida Dujmovic, Pat Morin, David R. Wood:
Layout of Graphs with Bounded Tree-Width. CoRR cs.DM/0406024 (2004) - 2003
- [j9]Prosenjit Bose, Anil Maheshwari, Pat Morin:
Fast approximations for sums of distances, clustering and the Fermat-Weber problem. Comput. Geom. 24(3): 135-146 (2003) - [j8]Prosenjit Bose, Marc J. van Kreveld, Anil Maheshwari, Pat Morin, Jason Morrison:
Translating a regular grid over a point set. Comput. Geom. 25(1-2): 21-34 (2003) - [j7]Peter Braß, Laura Heinrich-Litan, Pat Morin:
Computing the Center of Area of a Convex Polygon. Int. J. Comput. Geom. Appl. 13(5): 439-445 (2003) - [j6]Luc Devroye, Pat Morin:
Cuckoo hashing: Further analysis. Inf. Process. Lett. 86(4): 215-219 (2003) - [j5]Prosenjit Bose, Danny Krizanc, Stefan Langerman, Pat Morin:
Asymmetric Communication Protocols via Hotlink Assignments. Theory Comput. Syst. 36(6): 655-661 (2003) - [c22]Danny Krizanc, Pat Morin, Michiel H. M. Smid:
Range Mode and Range Median Queries on Lists and Trees. ISAAC 2003: 517-526 - [c21]Prosenjit Bose, Evangelos Kranakis, Pat Morin, Yihui Tang:
Bounds for Frequency Estimation of Packet Streams. SIROCCO 2003: 33-42 - [c20]David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint:
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. WADS 2003: 451-461 - [i1]Danny Krizanc, Pat Morin, Michiel H. M. Smid:
Range Mode and Range Median Queries on Lists and Trees. CoRR cs.DS/0307034 (2003) - 2002
- [j4]Prosenjit Bose, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, Alejandro López-Ortiz, Pat Morin, J. Ian Munro:
Online Routing in Convex Subdivisions. Int. J. Comput. Geom. Appl. 12(4): 283-296 (2002) - [j3]Prosenjit Bose, Pat Morin:
An Improved Algorithm for Subdivision Traversal without Extra Storage. Int. J. Comput. Geom. Appl. 12(4): 297-308 (2002) - [c19]Prosenjit Bose, Joachim Gudmundsson, Pat Morin:
Ordered theta graphs. CCCG 2002: 17-21 - [c18]Stefan Langerman, Pat Morin:
Covering Things with Things. ESA 2002: 662-673 - [c17]Vida Dujmovic, Pat Morin, David R. Wood:
Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs. GD 2002: 42-53 - [c16]Prosenjit Bose, Luc Devroye, Pat Morin:
Succinct Data Structures for Approximating Convex Functions with Applications. JCDCG 2002: 97-107 - [c15]Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint:
In-Place Planar Convex Hull Algorithms. LATIN 2002: 494-507 - [c14]Prosenjit Bose, Danny Krizanc, Stefan Langerman, Pat Morin:
Asymmetric Communication Protocols via Hotlink Assignments. SIROCCO 2002: 33-39 - [c13]Stefan Langerman, Pat Morin, Michael A. Soss:
Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles. STACS 2002: 250-261 - [e1]Prosenjit Bose, Pat Morin:
Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings. Lecture Notes in Computer Science 2518, Springer 2002, ISBN 3-540-00142-5 [contents] - 2001
- [j2]Jorge Alberto Calvo, Danny Krizanc, Pat Morin, Michael A. Soss, Godfried T. Toussaint:
Convexifying polygons with simple projections. Inf. Process. Lett. 80(2): 81-86 (2001) - [j1]Prosenjit Bose, Pat Morin, Ivan Stojmenovic, Jorge Urrutia:
Routing with Guaranteed Delivery in Ad Hoc Wireless Networks. Wirel. Networks 7(6): 609-616 (2001) - [c12]Prosenjit Bose, Pat Morin, Antoine Vigneron:
Packing Two Disks into a Polygonal Environment. COCOON 2001: 142-149 - [c11]Prosenjit Bose, Pat Morin:
Competitive Online Routing in Geometric Graphs. SIROCCO 2001: 35-44 - [c10]Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison:
The Grid Placement Problem. WADS 2001: 180-191 - 2000
- [c9]Hee-Kap Ahn, Prosenjit Bose, Jurek Czyzowicz, Nicolas Hanusse, Evangelos Kranakis, Pat Morin:
Flipping your Lid. CCCG 2000 - [c8]Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, J. Ian Munro, Alejandro López-Ortiz:
Online Routing in Convex Subdivisions. ISAAC 2000: 47-59 - [c7]Prosenjit Bose, Pat Morin:
An Improved Algorithm for Subdivision Traversal without Extra Storage. ISAAC 2000: 444-455
1990 – 1999
- 1999
- [c6]Prosenjit Bose, Pat Morin, Ivan Stojmenovic, Jorge Urrutia:
Routing with guaranteed delivery in ad hoc wireless networks. DIAL-M 1999: 48-55 - [c5]Prosenjit Bose, Pat Morin:
Online Routing in Triangulations. ISAAC 1999: 113-122 - [c4]Prosenjit Bose, Pat Morin:
Testing the Quality of Manufactured Balls. WADS 1999: 145-156 - 1998
- [c3]Prosenjit Bose, Pat Morin:
Testing the Quality of Manufactured Disks and Cylinders. ISAAC 1998: 129-138 - [c2]Pat Morin:
Coarse grained parallel computing on heterogeneous systems. SAC 1998: 628-634 - 1997
- [c1]Anil Maheshwari, Pat Morin, Jörg-Rüdiger Sack:
Progressive TINs: Algorithms and Applications. ACM-GIS 1997: 24-29
Coauthor Index
[c81] [i67] [j101] [i60] [j94] [j93] [c75] [i59] [i58] [i57] [c73] [i55] [i51] [j83] [c68] [i44] [i41] [j78] [i38] [j75] [j74] [j73] [c65] [i36] [i34] [j72] [j70] [c62] [c61] [c60] [i32] [j63] [j60] [j59] [c59] [c58] [c56] [j55] [j54] [j53] [c55] [c52] [i22] [i20] [i19] [j47] [c47] [c46] [c45] [c43] [c42] [i17] [i16] [i14] [j46] [j45] [j44] [j43] [j41] [j40] [c40] [c39] [c38] [j34] [j33] [j31] [c36] [i8] [j29] [j28] [j27] [j26] [c33] [i6] [i5] [c31] [c30] [i4] [j25] [c29] [i3] [j20] [j19] [j18] [j16] [j15] [j12] [j10] [c24] [c23] [j9] [j8] [j5] [c21] [j4] [j3] [c19] [c16] [c14] [e1] [j1] [c12] [c11] [c10] [c9] [c8] [c7] [c6] [c5] [c4] [c3]
[j108] [c83] [j107] [j106] [j105] [j104] [j103] [j102] [c81] [c79] [i72] [i71] [i70] [i68] [i67] [i66] [j101] [j100] [j98] [c78] [c77] [i65] [i64] [i63] [i62] [i60] [j97] [j96] [j95] [j93] [i58] [j91] [j89] [j88] [i57] [i56] [j87] [j86] [c74] [i54] [i52] [i51] [i49] [j85] [j84] [c72] [c71] [c70] [i48] [i46] [i45] [j81] [j80] [c68] [c67] [i44] [i43] [i41] [j78] [j77] [c66] [i40] [i39] [i37] [c65] [j72] [j71] [j68] [j67] [c64] [j66] [i30] [j63] [j60] [j59] [c58] [c57] [i29] [i26] [i25] [i24] [j58] [j57] [j56] [j52] [c55] [i22] [i20] [j49] [c50] [c49] [c47] [c46] [c45] [i17] [i16] [j44] [j43] [c41] [i13] [i10] [i9] [j39] [j34] [j31] [c34] [i7] [c33] [i6] [i4] [j21] [i2] [c17]
Michiel H. M. Smid
aka: Michiel Smid
aka: Michiel Smid
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-03 01:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
