2009 |
87 | EE | Vida Dujmovic,
John Howat,
Pat Morin:
Biased range trees.
SODA 2009: 486-495 |
86 | EE | Prosenjit Bose,
Eric Y. Chen,
Meng He,
Anil Maheshwari,
Pat Morin:
Succinct geometric indexes supporting point location queries.
SODA 2009: 635-644 |
85 | EE | Sébastien Collette,
Vida Dujmovic,
John Iacono,
Stefan Langerman,
Pat Morin:
Entropy, Triangulation, and Point Location in Planar Subdivisions
CoRR abs/0901.1908: (2009) |
84 | EE | Joachim Gudmundsson,
Pat Morin,
Michiel H. M. Smid:
Algorithms for Marketing-Mix Optimization
CoRR abs/0903.0308: (2009) |
83 | EE | 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) |
2008 |
82 | EE | 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 |
81 | EE | Evangelos Kranakis,
Danny Krizanc,
Pat Morin:
Randomized Rendez-Vous with Limited Memory.
LATIN 2008: 605-616 |
80 | EE | Sébastien Collette,
Vida Dujmovic,
John Iacono,
Stefan Langerman,
Pat Morin:
Distribution-sensitive point location in convex subdivisions.
SODA 2008: 912-921 |
79 | EE | Prosenjit Bose,
Eric Y. Chen,
Meng He,
Anil Maheshwari,
Pat Morin:
Succinct Geometric Indexes Supporting Point Location Queries
CoRR abs/0805.4147: (2008) |
78 | EE | Vida Dujmovic,
John Howat,
Pat Morin:
Biased Range Trees
CoRR abs/0806.2707: (2008) |
77 | EE | Harish Gopala,
Pat Morin:
Algorithms for bivariate zonoid depth.
Comput. Geom. 39(1): 2-13 (2008) |
76 | EE | 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) |
75 | EE | Pat Morin:
An optimal randomized algorithm for d-variate zonoid depth.
Comput. Geom. 39(3): 229-235 (2008) |
74 | EE | 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.
Discrete & Computational Geometry 39(1-3): 17-37 (2008) |
73 | EE | Prosenjit Bose,
Vida Dujmovic,
Ferran Hurtado,
Pat Morin,
Stefan Langerman,
David R. Wood:
A Polynomial Bound for Untangling Geometric Planar Graphs.
Electronic Notes in Discrete Mathematics 31: 213-218 (2008) |
72 | EE | 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) |
71 | EE | 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) |
70 | EE | Prosenjit Bose,
Vida Dujmovic,
Danny Krizanc,
Stefan Langerman,
Pat Morin,
David R. Wood,
Stefanie Wuhrer:
A Characterization of the degree sequences of 2-trees.
Journal of Graph Theory 58(3): 191-209 (2008) |
69 | EE | David Bremner,
Dan Chen,
John Iacono,
Stefan Langerman,
Pat Morin:
Output-sensitive algorithms for Tukey depth and related problems.
Statistics and Computing 18(3): 259-266 (2008) |
2007 |
68 | EE | Greg Aloupis,
Prosenjit Bose,
Pat Morin:
Reconfiguring Triangulations with Edge Flips and Point Moves.
Algorithmica 47(4): 367-378 (2007) |
67 | EE | 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) |
66 | EE | 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) |
65 | EE | 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) |
64 | EE | Prosenjit Bose,
Erik D. Demaine,
Ferran Hurtado,
John Iacono,
Stefan Langerman,
Pat Morin:
Geodesic Ham-Sandwich Cuts.
Discrete & Computational Geometry 37(3): 325-339 (2007) |
63 | EE | Prosenjit Bose,
Jurek Czyzowicz,
Zhicheng Gao,
Pat Morin,
David R. Wood:
Simultaneous diagonal flips in plane triangulations.
Journal of Graph Theory 54(4): 307-330 (2007) |
2006 |
62 | EE | Rossen Atanassov,
Pat Morin,
Stefanie Wuhrer:
Removing Outliers to Minimize Area and Perimeter.
CCCG 2006 |
61 | EE | Prosenjit Bose,
Pat Morin,
Michiel H. M. Smid,
Stefanie Wuhrer:
Rotationally Monotone Polygons.
CCCG 2006 |
60 | EE | Prosenjit Bose,
Jurek Czyzowicz,
Zhicheng Gao,
Pat Morin,
David R. Wood:
Simultaneous diagonal flips in plane triangulations.
SODA 2006: 212-221 |
59 | EE | 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 |
58 | EE | Prosenjit Bose,
Evangelos Kranakis,
Pat Morin,
Yihui Tang:
Approximate Range Mode and Range Median Queries.
STACS 2005: 377-388 |
57 | EE | Prosenjit Bose,
Pat Morin:
Guest Editors' Foreword.
Algorithmica 42(1): 1-2 (2005) |
56 | EE | Prosenjit Bose,
Jurek Czyzowicz,
Zhicheng Gao,
Pat Morin,
David R. Wood:
Simultaneous Diagonal Flips in Plane Triangulations
CoRR abs/math/0509478: (2005) |
55 | EE | 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.
Discrete & Computational Geometry 33(4): 593-604 (2005) |
54 | EE | Stefan Langerman,
Pat Morin:
Covering Things with Things.
Discrete & Computational Geometry 33(4): 717-729 (2005) |
53 | | 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) |
52 | EE | Vida Dujmovic,
Pat Morin,
David R. Wood:
Layout of Graphs with Bounded Tree-Width.
SIAM J. Comput. 34(3): 553-579 (2005) |
2004 |
51 | EE | Michel Barbeau,
Evangelos Kranakis,
Danny Krizanc,
Pat Morin:
Improving Distance Based Geographic Location Techniques in Sensor Networks.
ADHOC-NOW 2004: 197-210 |
50 | EE | Harish Gopala,
Pat Morin:
Algorithms for bivariate zonoid depth.
CCCG 2004: 132-135 |
49 | EE | Pat Morin,
David R. Wood:
Three-dimensional 1-bend graph drawings.
CCCG 2004: 40-43 |
48 | EE | Greg Aloupis,
Erik D. Demaine,
Stefan Langerman,
Pat Morin,
Joseph O'Rourke,
Ileana Streinu,
Godfried T. Toussaint:
Unfolding polyhedral bands.
CCCG 2004: 60-63 |
47 | EE | Greg Aloupis,
Prosenjit Bose,
Pat Morin:
Reconfiguring Triangulations with Edge Flips and Point Moves.
Graph Drawing 2004: 1-11 |
46 | EE | Prosenjit Bose,
Erik D. Demaine,
Ferran Hurtado,
John Iacono,
Stefan Langerman,
Pat Morin:
Geodesic ham-sandwich cuts.
Symposium on Computational Geometry 2004: 1-9 |
45 | EE | Vida Dujmovic,
Pat Morin,
David R. Wood:
Layout of Graphs with Bounded Tree-Width
CoRR cs.DM/0406024: (2004) |
44 | EE | Mark de Berg,
Prosenjit Bose,
Otfried Cheong,
Pat Morin:
On simplifying dot maps.
Comput. Geom. 27(1): 43-62 (2004) |
43 | EE | Prosenjit Bose,
Joachim Gudmundsson,
Pat Morin:
Ordered theta graphs.
Comput. Geom. 28(1): 11-18 (2004) |
42 | EE | Pat Morin,
Jason Morrison:
The geometry of carpentry and joinery.
Discrete Applied Mathematics 144(3): 374-380 (2004) |
41 | EE | Prosenjit Bose,
Pat Morin,
Antoine Vigneron:
Packing two disks into a polygonal environment.
J. Discrete Algorithms 2(3): 373-380 (2004) |
40 | EE | 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) |
39 | EE | Pat Morin,
David R. Wood:
Three-Dimensional 1-Bend Graph Drawings.
J. Graph Algorithms Appl. 8(2): 357-366 (2004) |
38 | EE | Luc Devroye,
Pat Morin,
Alfredo Viola:
On Worst-Case Robin Hood Hashing.
SIAM J. Comput. 33(4): 923-936 (2004) |
37 | EE | Prosenjit Bose,
Pat Morin:
Online Routing in Triangulations.
SIAM J. Comput. 33(4): 937-951 (2004) |
36 | EE | 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) |
35 | EE | Prosenjit Bose,
Pat Morin:
Competitive online routing in geometric graphs.
Theor. Comput. Sci. 324(2-3): 273-288 (2004) |
2003 |
34 | EE | Danny Krizanc,
Pat Morin,
Michiel H. M. Smid:
Range Mode and Range Median Queries on Lists and Trees.
ISAAC 2003: 517-526 |
33 | | Prosenjit Bose,
Evangelos Kranakis,
Pat Morin,
Yihui Tang:
Bounds for Frequency Estimation of Packet Streams.
SIROCCO 2003: 33-42 |
32 | EE | 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 |
31 | EE | Prosenjit Bose,
Pat Morin:
Testing the Quality of Manufactured Disks and Balls.
Algorithmica 38(1): 161-177 (2003) |
30 | EE | Danny Krizanc,
Pat Morin,
Michiel H. M. Smid:
Range Mode and Range Median Queries on Lists and Trees
CoRR cs.DS/0307034: (2003) |
29 | | 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) |
28 | | 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) |
27 | EE | Luc Devroye,
Pat Morin:
Cuckoo hashing: Further analysis.
Inf. Process. Lett. 86(4): 215-219 (2003) |
26 | EE | Peter Braß,
Laura Heinrich-Litan,
Pat Morin:
Computing the Center of Area of a Convex Polygon.
Int. J. Comput. Geometry Appl. 13(5): 439-445 (2003) |
25 | EE | Prosenjit Bose,
Danny Krizanc,
Stefan Langerman,
Pat Morin:
Asymmetric Communication Protocols via Hotlink Assignments.
Theory Comput. Syst. 36(6): 655-661 (2003) |
2002 |
24 | | Prosenjit Bose,
Pat Morin:
Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings
Springer 2002 |
23 | EE | Prosenjit Bose,
Joachim Gudmundsson,
Pat Morin:
Ordered theta graphs.
CCCG 2002: 17-21 |
22 | EE | Stefan Langerman,
Pat Morin:
Covering Things with Things.
ESA 2002: 662-673 |
21 | EE | Vida Dujmovic,
Pat Morin,
David R. Wood:
Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs.
Graph Drawing 2002: 42-53 |
20 | EE | Prosenjit Bose,
Luc Devroye,
Pat Morin:
Succinct Data Structures for Approximating Convex Functions with Applications.
JCDCG 2002: 97-107 |
19 | EE | Hervé Brönnimann,
John Iacono,
Jyrki Katajainen,
Pat Morin,
Jason Morrison,
Godfried T. Toussaint:
In-Place Planar Convex Hull Algorithms.
LATIN 2002: 494-507 |
18 | | Prosenjit Bose,
Danny Krizanc,
Stefan Langerman,
Pat Morin:
Asymmetric Communication Protocols via Hotlink Assignments.
SIROCCO 2002: 33-39 |
17 | EE | Stefan Langerman,
Pat Morin,
Michael A. Soss:
Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles.
STACS 2002: 250-261 |
16 | EE | 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. Geometry Appl. 12(4): 283-296 (2002) |
15 | EE | Prosenjit Bose,
Pat Morin:
An Improved Algorithm for Subdivision Traversal without Extra Storage.
Int. J. Comput. Geometry Appl. 12(4): 297-308 (2002) |
2001 |
14 | EE | Prosenjit Bose,
Pat Morin,
Antoine Vigneron:
Packing Two Disks into a Polygonal Environment.
COCOON 2001: 142-149 |
13 | | Prosenjit Bose,
Pat Morin:
Competitive Online Routing in Geometric Graphs.
SIROCCO 2001: 35-44 |
12 | EE | Prosenjit Bose,
Anil Maheshwari,
Pat Morin,
Jason Morrison:
The Grid Placement Problem.
WADS 2001: 180-191 |
11 | EE | 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) |
10 | | Prosenjit Bose,
Pat Morin,
Ivan Stojmenovic,
Jorge Urrutia:
Routing with Guaranteed Delivery in Ad Hoc Wireless Networks.
Wireless Networks 7(6): 609-616 (2001) |
2000 |
9 | EE | Hee-Kap Ahn,
Prosenjit Bose,
Jurek Czyzowicz,
Nicolas Hanusse,
Evangelos Kranakis,
Pat Morin:
Flipping your Lid.
CCCG 2000 |
8 | EE | Prosenjit Bose,
Pat Morin:
An Improved Algorithm for Subdivision Traversal without Extra Storage.
ISAAC 2000: 444-455 |
7 | EE | 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 |
1999 |
6 | EE | Prosenjit Bose,
Pat Morin,
Ivan Stojmenovic,
Jorge Urrutia:
Routing with guaranteed delivery in ad hoc wireless networks.
DIAL-M 1999: 48-55 |
5 | EE | Prosenjit Bose,
Pat Morin:
Online Routing in Triangulations.
ISAAC 1999: 113-122 |
4 | EE | Prosenjit Bose,
Pat Morin:
Testing the Quality of Manufactured Balls.
WADS 1999: 145-156 |
1998 |
3 | EE | Prosenjit Bose,
Pat Morin:
Testing the Quality of Manufactured Disks and Cylinders.
ISAAC 1998: 129-138 |
2 | EE | Pat Morin:
Coarse grained parallel computing on heterogeneous systems.
SAC 1998: 628-634 |
1997 |
1 | EE | Anil Maheshwari,
Pat Morin,
Jörg-Rüdiger Sack:
Progressive TINs: Algorithms and Applications.
ACM-GIS 1997: 24-29 |