The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pat Morin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michel Barbeau, Evangelos Kranakis, Danny Krizanc, Pat Morin
    Improving Distance Based Geographic Location Techniques in Sensor Networks. [Citation Graph (0, 0)][DBLP]
    ADHOC-NOW, 2004, pp:197-210 [Conf]
  2. Hee-Kap Ahn, Prosenjit Bose, Jurek Czyzowicz, Nicolas Hanusse, Evangelos Kranakis, Pat Morin
    Flipping your Lid. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  3. Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint
    Unfolding polyhedral bands. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:60-63 [Conf]
  4. Prosenjit Bose, Joachim Gudmundsson, Pat Morin
    Ordered theta graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:17-21 [Conf]
  5. Harish Gopala, Pat Morin
    Algorithms for bivariate zonoid depth. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:132-135 [Conf]
  6. Pat Morin, David R. Wood
    Three-dimensional 1-bend graph drawings. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:40-43 [Conf]
  7. Prosenjit Bose, Pat Morin, Antoine Vigneron
    Packing Two Disks into a Polygonal Environment. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:142-149 [Conf]
  8. Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin
    Geodesic ham-sandwich cuts. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:1-9 [Conf]
  9. Prosenjit Bose, Pat Morin, Ivan Stojmenovic, Jorge Urrutia
    Routing with guaranteed delivery in ad hoc wireless networks. [Citation Graph (0, 0)][DBLP]
    DIAL-M, 1999, pp:48-55 [Conf]
  10. Stefan Langerman, Pat Morin
    Covering Things with Things. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:662-673 [Conf]
  11. Greg Aloupis, Prosenjit Bose, Pat Morin
    Reconfiguring Triangulations with Edge Flips and Point Moves. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:1-11 [Conf]
  12. Vida Dujmovic, Pat Morin, David R. Wood
    Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:42-53 [Conf]
  13. Anil Maheshwari, Pat Morin, Jörg-Rüdiger Sack
    Progressive TINs: Algorithms and Applications. [Citation Graph (0, 0)][DBLP]
    ACM-GIS, 1997, pp:24-29 [Conf]
  14. Prosenjit Bose, Pat Morin
    An Improved Algorithm for Subdivision Traversal without Extra Storage. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:444-455 [Conf]
  15. Prosenjit Bose, Pat Morin
    Testing the Quality of Manufactured Disks and Cylinders. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:129-138 [Conf]
  16. Prosenjit Bose, Pat Morin
    Online Routing in Triangulations. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:113-122 [Conf]
  17. 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. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:47-59 [Conf]
  18. Danny Krizanc, Pat Morin, Michiel H. M. Smid
    Range Mode and Range Median Queries on Lists and Trees. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:517-526 [Conf]
  19. Prosenjit Bose, Luc Devroye, Pat Morin
    Succinct Data Structures for Approximating Convex Functions with Applications. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:97-107 [Conf]
  20. Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint
    In-Place Planar Convex Hull Algorithms. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:494-507 [Conf]
  21. Pat Morin
    Coarse grained parallel computing on heterogeneous systems. [Citation Graph (0, 0)][DBLP]
    SAC, 1998, pp:628-634 [Conf]
  22. Prosenjit Bose, Danny Krizanc, Stefan Langerman, Pat Morin
    Asymmetric Communication Protocols via Hotlink Assignments. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:33-39 [Conf]
  23. Prosenjit Bose, Evangelos Kranakis, Pat Morin, Yihui Tang
    Bounds for Frequency Estimation of Packet Streams. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2003, pp:33-42 [Conf]
  24. Prosenjit Bose, Pat Morin
    Competitive Online Routing in Geometric Graphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:35-44 [Conf]
  25. Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood
    Simultaneous diagonal flips in plane triangulations. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:212-221 [Conf]
  26. Prosenjit Bose, Evangelos Kranakis, Pat Morin, Yihui Tang
    Approximate Range Mode and Range Median Queries. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:377-388 [Conf]
  27. Stefan Langerman, Pat Morin, Michael A. Soss
    Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:250-261 [Conf]
  28. Prosenjit Bose, Pat Morin
    Testing the Quality of Manufactured Balls. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:145-156 [Conf]
  29. Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison
    The Grid Placement Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:180-191 [Conf]
  30. 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. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:451-461 [Conf]
  31. Prosenjit Bose, Pat Morin
    Testing the Quality of Manufactured Disks and Balls. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:38, n:1, pp:161-177 [Journal]
  32. Prosenjit Bose, Pat Morin
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:42, n:1, pp:1-2 [Journal]
  33. Mark de Berg, Prosenjit Bose, Otfried Cheong, Pat Morin
    On simplifying dot maps. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:27, n:1, pp:43-62 [Journal]
  34. Prosenjit Bose, Joachim Gudmundsson, Pat Morin
    Ordered theta graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:28, n:1, pp:11-18 [Journal]
  35. Prosenjit Bose, Marc J. van Kreveld, Anil Maheshwari, Pat Morin, Jason Morrison
    Translating a regular grid over a point set. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:25, n:1-2, pp:21-34 [Journal]
  36. Prosenjit Bose, Anil Maheshwari, Pat Morin
    Fast approximations for sums of distances, clustering and the Fermat-Weber problem. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:24, n:3, pp:135-146 [Journal]
  37. Vida Dujmovic, Pat Morin, David R. Wood
    Layout of Graphs with Bounded Tree-Width [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  38. Danny Krizanc, Pat Morin, Michiel H. M. Smid
    Range Mode and Range Median Queries on Lists and Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  39. Pat Morin, Jason Morrison
    The geometry of carpentry and joinery. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:144, n:3, pp:374-380 [Journal]
  40. 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. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:4, pp:593-604 [Journal]
  41. Stefan Langerman, Pat Morin
    Covering Things with Things. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:4, pp:717-729 [Journal]
  42. 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. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:4, pp:283-296 [Journal]
  43. Prosenjit Bose, Pat Morin
    An Improved Algorithm for Subdivision Traversal without Extra Storage. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:4, pp:297-308 [Journal]
  44. Peter Braß, Laura Heinrich-Litan, Pat Morin
    Computing the Center of Area of a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2003, v:13, n:5, pp:439-445 [Journal]
  45. Jorge Alberto Calvo, Danny Krizanc, Pat Morin, Michael A. Soss, Godfried T. Toussaint
    Convexifying polygons with simple projections. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:80, n:2, pp:81-86 [Journal]
  46. Luc Devroye, Pat Morin
    Cuckoo hashing: Further analysis. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:4, pp:215-219 [Journal]
  47. Prosenjit Bose, Pat Morin, Antoine Vigneron
    Packing two disks into a polygonal environment. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2004, v:2, n:3, pp:373-380 [Journal]
  48. Pat Morin, David R. Wood
    Three-Dimensional 1-Bend Graph Drawings. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2004, v:8, n:2, pp:357-366 [Journal]
  49. Prosenjit Bose, Jurek Czyzowicz, Pat Morin, David R. Wood
    The Maximum Number of Edges in a Three-Dimensional Grid-Drawing. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2004, v:8, n:, pp:21-26 [Journal]
  50. Prosenjit Bose, Danny Krizanc, Stefan Langerman, Pat Morin
    Asymmetric Communication Protocols via Hotlink Assignments. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2003, v:36, n:6, pp:655-661 [Journal]
  51. Danny Krizanc, Pat Morin, Michiel H. M. Smid
    Range Mode and Range Median Queries on Lists and Trees. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2005, v:12, n:1, pp:1-17 [Journal]
  52. Prosenjit Bose, Pat Morin
    Online Routing in Triangulations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:4, pp:937-951 [Journal]
  53. Luc Devroye, Pat Morin, Alfredo Viola
    On Worst-Case Robin Hood Hashing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:4, pp:923-936 [Journal]
  54. Vida Dujmovic, Pat Morin, David R. Wood
    Layout of Graphs with Bounded Tree-Width. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:3, pp:553-579 [Journal]
  55. Prosenjit Bose, Pat Morin
    Competitive online routing in geometric graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:324, n:2-3, pp:273-288 [Journal]
  56. Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint
    Space-efficient planar convex hull algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:1, pp:25-40 [Journal]
  57. Prosenjit Bose, Pat Morin, Ivan Stojmenovic, Jorge Urrutia
    Routing with Guaranteed Delivery in Ad Hoc Wireless Networks. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 2001, v:7, n:6, pp:609-616 [Journal]
  58. Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood
    Simultaneous diagonal flips in plane triangulations. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2007, v:54, n:4, pp:307-330 [Journal]
  59. Prosenjit Bose, Pat Morin, Michiel H. M. Smid, Stefanie Wuhrer
    Rotationally Monotone Polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  60. Rossen Atanassov, Pat Morin, Stefanie Wuhrer
    Removing Outliers to Minimize Area and Perimeter. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  61. Greg Aloupis, Prosenjit Bose, Pat Morin
    Reconfiguring Triangulations with Edge Flips and Point Moves. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:4, pp:367-378 [Journal]
  62. Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Jan Vahrenhold
    Space-efficient geometric divide-and-conquer algorithms. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:37, n:3, pp:209-227 [Journal]
  63. Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint
    Edge-unfolding nested polyhedral bands. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2008, v:39, n:1, pp:30-42 [Journal]
  64. Harish Gopala, Pat Morin
    Algorithms for bivariate zonoid depth. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2008, v:39, n:1, pp:2-13 [Journal]
  65. Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer
    A Characterization of the Degree Sequences of 2-Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  66. Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Stefan Langerman, Pat Morin, David R. Wood
    A polynomial bound for untangling geometric planar graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  67. Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin
    Geodesic Ham-Sandwich Cuts. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:37, n:3, pp:325-339 [Journal]

  68. Oja medians and centers of gravity. [Citation Graph (, )][DBLP]


  69. Fast local searches and updates in bounded universes. [Citation Graph (, )][DBLP]


  70. Ghost chimneys. [Citation Graph (, )][DBLP]


  71. Planar visibility: testing and counting. [Citation Graph (, )][DBLP]


  72. Randomized Rendez-Vous with Limited Memory. [Citation Graph (, )][DBLP]


  73. Spanners of Complete k -Partite Geometric Graphs. [Citation Graph (, )][DBLP]


  74. Distribution-sensitive point location in convex subdivisions. [Citation Graph (, )][DBLP]


  75. Succinct geometric indexes supporting point location queries. [Citation Graph (, )][DBLP]


  76. Biased range trees. [Citation Graph (, )][DBLP]


  77. Improved Methods For Generating Quasi-gray Codes. [Citation Graph (, )][DBLP]


  78. Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing. [Citation Graph (, )][DBLP]


  79. Delaunay Triangulation of Imprecise Points Simplified and Extended. [Citation Graph (, )][DBLP]


  80. A Distribution-Sensitive Dictionary with Low Space Overhead. [Citation Graph (, )][DBLP]


  81. Clamshell Casting. [Citation Graph (, )][DBLP]


  82. An optimal randomized algorithm for d-variate zonoid depth. [Citation Graph (, )][DBLP]


  83. Rotationally monotone polygons. [Citation Graph (, )][DBLP]


  84. Simultaneous Diagonal Flips in Plane Triangulations [Citation Graph (, )][DBLP]


  85. Spanners of Complete $k$-Partite Geometric Graphs [Citation Graph (, )][DBLP]


  86. Succinct Geometric Indexes Supporting Point Location Queries [Citation Graph (, )][DBLP]


  87. Biased Range Trees [Citation Graph (, )][DBLP]


  88. Entropy, Triangulation, and Point Location in Planar Subdivisions [Citation Graph (, )][DBLP]


  89. Algorithms for Marketing-Mix Optimization [Citation Graph (, )][DBLP]


  90. On the Expected Maximum Degree of Gabriel and Yao Graphs [Citation Graph (, )][DBLP]


  91. Notes on large angle crossing graphs [Citation Graph (, )][DBLP]


  92. Memoryless Routing in Convex Subdivisions: Random Walks are Optimal [Citation Graph (, )][DBLP]


  93. Planar Visibility: Testing and Counting [Citation Graph (, )][DBLP]


  94. Point Location in Disconnected Planar Subdivisions [Citation Graph (, )][DBLP]


  95. Odds-On Trees [Citation Graph (, )][DBLP]


  96. A Tight Bound on the Maximum Interference of Random Sensors in the Highway Model [Citation Graph (, )][DBLP]


  97. Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D. [Citation Graph (, )][DBLP]


  98. A Polynomial Bound for Untangling Geometric Planar Graphs. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002