- Computer-Aided Design & Applications, Vol. 4, Nos. 1-4, 2007, pp xxx-yyy Algorithms for Designing Clamshell Molds
- On some combinatorial problems in metric spaces of bounded doubling dimension
- Approximate Distance Oracles for Geometric Spanners JOACHIM GUDMUNDSSON
- Spanning trees with O(1) average stretch Michiel Smid
- The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension
- On a family of strong geometric spanners that admit local routing strategies
- An (n log n) lower bound for computing the sum of even-ranked elements
- I/O-Efficient Shortest Path Queries in Geometric Anil Maheshwari1
- Low-Interference Networks in Metric Spaces of Bounded Doubling Dimension
- Plane Geometric Spanners Joachim Gudmundsson, National ICT Australia Ltd, www.gudmundsson.biz
- Distance-preserving approximations of polygonal paths
- Geometric Spanners for Weighted Point Sets Mohammad Ali Abam1
- ON PLANE GEOMETRIC SPANNERS: A SURVEY AND OPEN PROBLEMS Prosenjit Bose Michiel Smid
- Computing the greedy spanner in near-quadratic time Prosenjit Bose
- CCCG 2010, Winnipeg MB, August 911, 2010 Approximating Range-Aggregate Queries using Coresets
- Dilation-Optimal Edge Deletion in Polygonal Cycles Hee-Kap Ahn
- On the Dilation Spectrum of Paths, Cycles, Christian Knauer
- Delaunay and Diamond Triangulations Contain Spanners of Bounded Degree
- Rotationally Monotone Polygons Stefanie Wuhrer, Prosenjit Bose, Pat Morin, Michiel Smid
- On spanners of geometric graphs Joachim Gudmundsson
- Data Structures for Range-Aggregate Extent Queries6 Prosenjit Guptaa,1
- On Generalized Diamond Spanners Prosenjit Bose Aaron Lee Michiel Smid
- Space-Efficient Geometric Divide-and-Conquer Algorithms
- Small Manhattan Networks and Algorithmic Applications for the Earth Mover's Distance
- Indicator Random Variables in Traffic Analysis and the Birthday Problem Phillip G. Bradford
- 09-09-22 8:40 PMGmail -[SPAM ++++++++] Inviting Michiel Smid for paper submission Page 1 of 1https://mail.google.com/mail/?ui=2&ik=5d8ce64f61&view=pt&search=inbox&msg=123e42b0f788ea58
- ALGORITHMS FOR MARKETING-MIX OPTIMIZATION1 Joachim Gudmundsson Pat Morin Michiel Smid2
- Approximating the average stretch factor of geometric paths, cycles, trees, and plane
- On the Stretch Factor of Convex Delaunay Graphs Prosenjit Bose
- Spanners of Complete k-Partite Geometric Graphs Prosenjit Bose
- Communication-Efficient Construction of the Plane Localized Delaunay Graph
- Surface Topography Quantification by Integral and Feature-related Parameters
- Geometric Spanners With Small Chromatic Number Prosenjit Bose1
- On the Power of the Semi-Separated Pair Decomposition
- May 23, 2007 9:38 WSPC/Guidelines rev-nonint-ijcga International Journal of Computational Geometry & Applications
- Lecture Notes Introduction to Theory of Computation
- An optimal algorithm for computing angle-constrained spanners
- Applications of Geometric Spanner Networks Joachim Gudmundsson, National ICT Australia Ltd, www.gudmundsson.biz
- Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams
- 2002The Royal Microscopical Society Journal of Microscopy,Vol. 207, Pt 3 September 2002, pp. 169179
- List of Publications Michiel Smid
- Geometric Spanners Joachim Gudmundsson, National ICT Australia Ltd, www.gudmundsson.biz/
- A Linear-Space Algorithm for Distance Preserving Graph Tetsuo Asano1
- Improved Methods For Generating Quasi-Gray Prosenjit Bose,1
- Clamshell Casting Prosenjit Bose, Pat Morin, Michiel Smid, Stefanie Wuhrer
- An In-Place Min-Max Priority Search Tree Anil Maheshwari
- CCCG 2011, Toronto ON, August 1012, 2011 An In-Place Priority Search Tree
- CCCG 2011, Toronto ON, August 1012, 2011 Approximation Algorithms for a Triangle Enclosure Problem
- TECHNISCHE HOGESCHOOL EINDHOVEN EINDHOVEN UNIVERSITY OF TECHNOLOGY
- COMP 2805 --Assignment 3 Due: November 17, before 23:59 pm, in the course drop box in Herzberg 3115.
- COMP 1805 --Solutions Assignment 1 Question 1: On the first page of your assignment, write
- COMP 2805 --Solutions Assignment 3 Question 1: Give context-free grammars that generate the following languages. For each
- COMP 2805 --Assignment 1 Due: October 6, before 23:59 pm, in the course drop box in Herzberg 3115.
- Let P be a set of n points and let L be a set of m lines in the plane. (Recall that in a set, any two elements are distinct.) We are interested in the
- COMP 1805 --Solutions Assignment 3 Question 1: On the first page of your assignment, write
- COMP 1805 --Assignment 1 Due: October 6, before 23:59 pm, in the course drop box in Herzberg 3115.
- COMP 5008 --Assignment 2 Due: Wednesday, October 26, in class.
- COMP 1805 Discrete Structures November 13, 2011
- COMP 1805 --Assignment 2 Due: October 20, before 23:59 pm, in the course drop box in Herzberg 3115.
- COMP 1805 --Assignment 4 Due: December 1, before 23:59 pm, in the course drop box in Herzberg 3115.
- COMP 5008 --Assignment 3 Due: Wednesday, November 16, in class.
- COMP 2805 --Solutions Assignment 1 Question 1: For each of the following languages, construct a DFA that accepts the language.
- COMP 2805 --Solutions Assignment 2 Question 1: Give regular expressions describing the following languages. In all cases, the
- COMP 1805 Discrete Structures Octover 17, 2010
- COMP 2805 --Assignment 4 Due: December 1, before 23:59 pm, in the course drop box in Herzberg 3115.
- COMP 1805 Discrete Structures November 13, 2011
- COMP 5008 --Assignment 1 Due: Wednesday, October 5, in class.
- COMP 1805 --Solutions Assignment 4 Question 1: On the first page of your assignment, write
- COMP 1805 Discrete Structures September 26, 2011
- COMP 1805 Discrete Structures September 19, 2011
- COMP 2805 --Solutions Assignment 4 Question 1: Construct a Turing machine with one tape, that gets as input an integer x 0,
- COMP 1805 Discrete Structures Octover 17, 2010
- COMP 1805 Discrete Structures November 7, 2011
- COMP 2805 --Assignment 2 Due: October 20, before 23:59 pm, in the course drop box in Herzberg 3115.
- COMP 1805 Discrete Structures October 24, 2011
- COMP 1805 --Assignment 3 Due: November 17, before 23:59 pm, in the course drop box in Herzberg 3115.
- COMP 1805 Discrete Structures September 26, 2011
- COMP 1805 --Solutions Assignment 2 Question 1: On the first page of your assignment, write
- COMP 1805 Discrete Structures November 28, 2011
- Two-Dimensional Range Diameter Queries Pooya Davoodi1
- EuroCG 2012, Assisi, Italy, March 1921, 2012 Unsolvability of the Weighted Region Shortest Path Problem
