- DISTINCT DISTANCES IN GRAPH DRAWINGS Vida Dujmovic
- Online Routing in Geometric Graphs Patrick Ryan Morin
- Connectivity-preserving transformations of binary images q,qq Prosenjit Bose a
- Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 0, no. 0, pp. 0--0 (2005)
- CUCKOO HASHING: FURTHER ANALYSIS Luc Devroye and Pat Morin
- SpaceE#cient Geometric DivideandConquer Algorithms #
- Online Routing in Convex Subdivisions Prosenjit Bose
- Algorithms for Optimal Outlier Removal 1 Rossen Atanassov, Prosenjit Bose, Mathieu Couture,
- Bounds for Frequency Estimation of Packet Carleton University, Canada
- July 23, 2003 21:48 WSPC/Guidelines center International Journal of Computational Geometry & Applications
- Computing the Detour and Spanning Ratio of Paths, Trees and Cycles in 2D and 3D y
- Wireless Networks 0 (2001) ?{? 1 Routing with Guaranteed Delivery
- Bounds for Frequency Estimation of Packet Carleton University, Canada
- Sigma-Local Graphs Prosenjit Bose 1
- CCCG 2006, Kingston, Ontario, August 1416, 2006 Removing Outliers to Minimize Area and Perimeter
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- ASYMMETRIC COMMUNICATION PROTOCOLS VIA HOTLINK ASSIGNMENTS Prosenjit Bose y Danny Krizanc z Stefan Langerman x Pat Morin y
- SpaceE#cient Planar Convex Hull Algorithms 1
- Computing the Detour and Spanning Ratio of Paths, Trees and Cycles in 2D and 3D
- ONLINE ROUTING IN TRIANGULATIONS PROSENJIT BOSE AND PAT MORIN
- ABSOLUTE APPROXIMATION OF TUKEY DEPTH:1 THEORY AND EXPERIMENTS2
- Pathwidth and ThreeDimensional StraightLine Grid Drawings of Graphs ?
- The Geometry of Carpentry and Joinery # Pat Morin and Jason Morrison
- On Simplifying Dot Maps # Mark de Berg a , Prosenjit Bose b , Otfried Cheong a , and
- ENTROPY, TRIANGULATION, AND POINT LOCATION IN PLANAR SUBDIVISIONS
- Covering Points with Lines Stefan Langerman
- COVERING THINGS WITH THINGS Stefan Langermany
- COVERING THINGS WITH THINGS Stefan Langerman y
- SUCCINCT DATA STRUCTURES FOR APPROXIMATING CONVEX FUNCTIONS, WITH APPLICATIONS +
- Journal of Graph Algorithms and Applications http://www.cs.brown.edu/publications/jgaa/
- GEODESIC HAM-SANDWICH CUTS Prosenjit Bose
- Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees and Cycles
- Space-Efficient Geometric Divide-and-Conquer Algorithms
- Testing the Quality of Manufactured Disks and Balls Prosenjit Bose and Pat Morin
- ON WORST CASE ROBINHOOD HASHING Luc Devroye, Pat Morin
- Approximate Range Mode and Range Median Prosenjit Bose, Evangelos Kranakis, Pat Morin, and Yihui Tang
- A Framework for Multiresolution Modelling \Lambda Anil Maheshwari Pat Morin JorgRudiger Sack
- Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees and Cycles ?
- Packing Two Disks into a Polygonal Environment
- ON THE FALSEPOSITIVE RATE OF BLOOM FILTERS # Prosenjit Bose Hua Guo Evangelos Kranakis Anil Maheshwari Pat Morin
- DISTRIBUTION-SENSITIVE POINT LOCATION IN CONVEX SUBDIVISIONS Sebastien Collette
- GEODESIC HAMSANDWICH CUTS # Prosenjit Bose + Erik D. Demaine # Ferran Hurtado John Iacono Stefan Langerman #
- Online Routing in Convex Subdivisions Prosenjit Bose y Andrej Brodnik z Svante Carlsson x
- Two Topics in Applied Algorithmics Patrick R. Morin
- LAYOUT OF GRAPHS WITH BOUNDED TREE-WIDTH VIDA DUJMOVIC , PAT MORIN , AND DAVID R. WOOD
- On Simplifying Dot Maps Mark de Berg a
- PUTTING YOUR DICTIONARY ON A DIET School of Computer Science, Carleton University
- CoarseGrained Parallel Computing on Heterogeneous Systems \Lambda
- Progressive TINs: Algorithms and Applications \Lambda Anil Maheshwari Pat Morin JorgRudiger Sack
- Simultaneous Diagonal Flips in Plane
- FLIPPING YOUR LID Hee-Kap Ahn,1
- Space-Efficient Planar Convex Hull Algorithms 1
- Randomized Rendez-Vous with Limited Memory EVANGELOS KRANAKIS
- Competitive Online Routing in Geometric Prosenjit Bose and Pat Morin
- Provably Secure and Efficient Block Ciphers School of Computer Science
- PUTTING YOUR DICTIONARY ON A DIET School of Computer Science, Carleton University
- Ordered Theta Graphs # Prosenjit Bose a , Joachim Gudmundsson b and Pat Morin a
- ONLINE ROUTING IN TRIANGULATIONS # PROSENJIT BOSE + AND PAT MORIN +
- CENTERPOINT THEOREMS FOR WEDGES Jeff Erickson Ferran Hurtado Pat Morin
- Convexifying Polygons with Simple Projections Jorge Alberto Calvo Danny Krizanc y Pat Morin z
- International Journal of Foundations of Computer Science c World Scientific Publishing Company
- Spanners of Complete k-Partite Geometric Graphs
- ALGORITHMS FOR MARKETING-MIX OPTIMIZATION Joachim Gudmundsson Pat Morin Michiel Smid
- Ordered Theta Graphs Prosenjit Bose a
- Realizing Partitions Respecting Full and Partial Order Information
- Rotational Clamshell Casting In Two Dimensions Prosenjit Bose, Pat Morin, Michiel Smid, Stefanie Wuhrer
- Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 0, no. 0, pp. 00 (2005)
- Covering Points with Lines Stefan Langerman Pat Morin y
- Testing the Quality of Manufactured Disks and Balls # Prosenjit Bose and Pat Morin
- Progressive TINs: Algorithms and Applications \Lambda Anil Maheshwari Pat Morin JorgRudiger Sack
- Succinct Data Structures for Approximating Convex Functions with Applications #
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
- Nordic Journal of Computing RANGE MODE AND RANGE MEDIAN QUERIES ON
- Coarse Grained Parallel Computing on Heterogeneous Systems
- A Distribution-Sensitive Dictionary with Low Space Overhead
- Nordic Journal of Computing RANGE MODE AND RANGE MEDIAN QUERIES ON
- ARTICLE IN PRESS JDA:185 Please cite this article as: E.D. Demaine et al., Realizing partitions respecting full and partial order information, Journal of Discrete Algorithms
- Fast Approximations for Sums of Distances, Clustering and the Fermat-Weber Problem 1
- A Generalized Winternitz Theorem Prosenjit Bose
- Translating a Regular Grid over a Point Set Prosenjit Bose y Marc van Kreveld z Anil Maheshwari y
- Simple Polygons with an Infinite Sequence of Deflations
- ON WORST CASE ROBIN-HOOD HASHING Luc Devroye, Pat Morin
- Packing Two Disks into a Polygonal Environment
- Rotational Clamshell Casting In Three Dimensions Prosenjit Bose, Pat Morin, Michiel Smid, Stefanie Wuhrer
- A Characterization of the Degree Sequences of
- ON THE FALSE-POSITIVE RATE OF BLOOM FILTERS Prosenjit Bose Hua Guo Evangelos Kranakis Anil Maheshwari Pat Morin
- Output-Sensitive Algorithms for Tukey Depth and Related Problems
- AN OPTIMAL RANDOMIZED ALGORITHM FOR d-VARIATE ZONOID DEPTH School of Computer Science
- This article was published in an Elsevier journal. The attached copy is furnished to the author for non-commercial research and
- Journal of Graph Algorithms and Applications http://www.cs.brown.edu/publications/jgaa/
- The Geometry of Carpentry and Joinery Pat Morin and Jason Morrison
- ASYMMETRIC COMMUNICATION PROTOCOLS VIA HOTLINK ASSIGNMENTS Prosenjit Bose
- July 23, 2003 21:48 WSPC/Guidelines center International Journal of Computational Geometry & Applications
- Translating a Regular Grid over a Point Set Prosenjit Bose
- Coverage with Transmitters in the Presence of Brad Ballinger1
- Skip Lifts: A Probabilistic Alternative to Red-Black Trees
- Pathwidth and Three-Dimensional Straight-Line Grid Drawings of Graphs
- CCCG 2010, Winnipeg MB, August 911, 2010 Ghost Chimneys
- CCCG 2010, Winnipeg MB, August 911, 2010 Oja Medians and Centers of Gravity
- CCCG 2010, Winnipeg MB, August 911, 2010 Fast Local Searches and Updates in Bounded Universes
- Succinct Data Structures for Approximating Convex Functions with Applications
- SUCCINCT DATA STRUCTURES FOR APPROXIMATING CONVEX FUNCTIONS, WITH APPLICATIONS
- Entropy, Triangulation, and Point Location in Planar Subdivisions SEBASTIEN COLLETTE, Universite Libre de Bruxelles
- A Generalized Winternitz Theorem Prosenjit Bose, Paz Carmi, Ferran Hurtado and Pat Morin
- Memoryless Routing in Convex Subdivisions: Random Walks are Optimal
- Oja Centers and Centers of Gravity$ School of Computer Science, Carleton University
