- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j62 |      | Dan Chen, Olivier Devillers, John Iacono, Stefan Langerman, Pat Morin: Oja centers and centers of gravity. Comput. Geom. 46(2): 140-147 (2013) |
| j61 | | 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) |
| j60 | | Dan Chen, Pat Morin, Uli Wagner: Absolute approximation of Tukey depth: Theory and experiments. Comput. Geom. 46(5): 566-573 (2013) |
| j59 | | Brad Ballinger, Nadia 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) |
| i26 | | |
| i25 | | |
| i24 | | Pat Morin, Sander Verdonschot: On the Average Number of Edges in Theta Graphs. CoRR abs/1304.3402 (2013) |
| 2012 | ||
| j58 | | |
| 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. Geometry 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 Transactions on Algorithms 8(2): 10 (2012) |
| j52 | | Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin: Entropy, triangulation, and point location in planar subdivisions. ACM Transactions on Algorithms 8(3): 29 (2012) |
| c55 | | Prosenjit Bose, Vida Dujmovic, Nima Hoda, Pat Morin: Visibility Monotonic Polygon Deflation. CCCG 2012: 11-16 |
| c54 | | |
| c53 | | |
| 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 | | |
| i22 | | Prosenjit Bose, Vida Dujmovic, Pat Morin, Michiel H. M. Smid: Robust Geometric Spanners. CoRR abs/1204.4679 (2012) |
| i21 | | |
| 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. Chicago J. Theor. Comput. Sci. 2011 (2011) |
| j48 | | Evangelos Kranakis, Danny Krizanc, Pat Morin: Randomized rendezvous with limited memory. ACM Transactions on Algorithms 7(3): 34 (2011) |
| c51 | | |
| 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 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. Symposium on Computational Geometry 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 | | |
| 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) |
| 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. Computer Vision and Image Understanding 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. Discrete & Computational Geometry 42(4): 570-585 (2009) |
| j42 | | Jeff Erickson, Ferran Hurtado, Pat Morin: Centerpoint Theorems for Wedges. Discrete Mathematics & Theoretical Computer Science 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 | | |
| 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. Electr. J. Comb. 15(1) (2008) |
| j38 | | |
| 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. Discrete & Computational Geometry 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. Electronic Notes in Discrete Mathematics 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. Journal of 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. Statistics and Computing 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 | | |
| 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. Discrete & Computational Geometry 37(3): 325-339 (2007) |
| j26 | | 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) |
| 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 | | |
| 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. Discrete & Computational Geometry 33(4): 593-604 (2005) |
| j23 | | Stefan Langerman, Pat Morin: Covering Things with Things. Discrete & Computational Geometry 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 | | Mark de Berg, Prosenjit Bose, Otfried Cheong, Pat Morin: On simplifying dot maps. Comput. Geom. 27(1): 43-62 (2004) |
| j19 | | Prosenjit Bose, Joachim Gudmundsson, Pat Morin: Ordered theta graphs. Comput. Geom. 28(1): 11-18 (2004) |
| j18 | | Pat Morin, Jason Morrison: The geometry of carpentry and joinery. Discrete Applied Mathematics 144(3): 374-380 (2004) |
| j17 | | Prosenjit Bose, Pat Morin, Antoine Vigneron: Packing two disks into a polygonal environment. J. Discrete Algorithms 2(3): 373-380 (2004) |
| j16 | | 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) |
| j15 | | Pat Morin, David R. Wood: Three-Dimensional 1-Bend Graph Drawings. J. Graph Algorithms Appl. 8(2): 357-366 (2004) |
| j14 | | Luc Devroye, Pat Morin, Alfredo Viola: On Worst-Case Robin Hood Hashing. SIAM J. Comput. 33(4): 923-936 (2004) |
| j13 | | |
| j12 | | 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) |
| j11 | | 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 | | |
| 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 | | |
| c24 | | Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin: Geodesic ham-sandwich cuts. Symposium on Computational Geometry 2004: 1-9 |
| c23 | | Greg Aloupis, Prosenjit Bose, Pat Morin: Reconfiguring Triangulations with Edge Flips and Point Moves. Graph Drawing 2004: 1-11 |
| i2 | | Vida Dujmovic, Pat Morin, David R. Wood: Layout of Graphs with Bounded Tree-Width. CoRR cs.DM/0406024 (2004) |
| 2003 | ||
| j10 | | Prosenjit Bose, Pat Morin: Testing the Quality of Manufactured Disks and Balls. Algorithmica 38(1): 161-177 (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. Geometry Appl. 13(5): 439-445 (2003) |
| j6 | | |
| 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. Geometry Appl. 12(4): 283-296 (2002) |
| j3 | | Prosenjit Bose, Pat Morin: An Improved Algorithm for Subdivision Traversal without Extra Storage. Int. J. Comput. Geometry Appl. 12(4): 297-308 (2002) |
| c19 | | |
| c18 | | |
| c17 | | Vida Dujmovic, Pat Morin, David R. Wood: Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs. Graph Drawing 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 (Eds.): 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 |
| 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. Wireless 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 | | |
| 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 |
| 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 | | |
| c4 | | |
| 1998 | ||
| c3 | | Prosenjit Bose, Pat Morin: Testing the Quality of Manufactured Disks and Cylinders. ISAAC 1998: 129-138 |
| c2 | | |
| 1997 | ||
| c1 | | Anil Maheshwari, Pat Morin, Jörg-Rüdiger Sack: Progressive TINs: Algorithms and Applications. ACM-GIS 1997: 24-29 |
Data released under the ODC-BY 1.0 license — See also our legal information page