@comment{{This file has been generated by bib2bib 1.99}}

@comment{{Command line: bib2bib -r -s year bibtexfiles/secollet-local.bib}}

@inproceedings{CCCHLR12a, author = {J. Cardinal and N. Cohen and S. Collette and M. Hoffmann and S. Langerman and G. Rote}, title = {Coloring Dynamic Point Sets on a Line}, booktitle = {Proceedings of the 28th European Workshop on Computational Geometry (EuroCG12)}, year = {2012} }

@inproceedings{CCIKLST11a, author = {J. Cardinal and S. Collette and H. Ito and M. Korman and S. Langerman and H. Sakaidani and P. Taslakian}, booktitle = {Proceedings of the 27th European Workshop on Computational Geometry ({EuroCG11})}, title = {Cannibal Animal Games: a new variant of Tic-Tac-Toe}, year = {2011}, note = {4 pages} }

@inproceedings{CCIKLST11b, author = {J. Cardinal and S. Collette and H. Ito and M. Korman and S. Langerman and H. Sakaidani and P. Taslakian}, booktitle = {Proceedings of the 4th Annual Meeting of AAAC ({AAAC11})}, title = {Cannibal Animal Games: a new variant of Tic-Tac-Toe}, year = {2011}, note = {2 pages} }

@inproceedings{ABCDDDDILM10a, author = {G. Aloupis and P. Bose and S. Collette and E. D. Demaine and M. L. Demaine and K. Douieb and V. Dujmovic and J. Iacono and S. Langerman and P. Morin}, booktitle = {Proceedings of the China-Japan Joint Conference on Computational Geometry, Graphs and Applications ({CGGA 2010})}, title = {Common Unfoldings of Polyominoes and Polycubes}, year = {2010}, note = {2 pages} }

@inproceedings{ABCLPW10a, author = {G. Aloupis and B. Ballinger and S. Collette and S. Langerman and A. Por and D. R. Wood}, booktitle = {Proceedings of the 26th European Workshop on Computational Geometry ({EuroCG10})}, title = {Blocking Coloured Point Sets}, year = {2010}, note = {4 pages} }

@inproceedings{BCHKLSS10a, abstract = {We consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the following combinatorial and geometric properties of these graphs: spanning ratio, diameter, chromatic number, and minimum number of layers necessary to partition the edges of the graphs so that no two edges of the same layer cross.}, author = {P. Bose and S. Collette and F. Hurtado and M. Korman and S. Langerman and V. Sacristan and M. Saumell}, title = {{Some Properties of Higher Order Delaunay and Gabriel Graphs}}, booktitle = {Proceedings of the Canadian Conference on Computational Geometry ({CCCG10})}, year = {2010}, note = {4 pages} }

@inproceedings{BCG09a, author = {V. Berten and S. Collette and J. Goossens}, title = {Feasibility Test for Multi-Phase Parallel Real-Time Jobs}, booktitle = {Proceedings of the Work-in-Progress session of the IEEE Real-Time Systems Symposium 2009}, year = {2009}, note = {4 pages} }

@inproceedings{ACCIKLSST09a, author = {G. Aloupis and J. Cardinal and S. Collette and S. Imahori and M. Korman and S. Langerman and O. Schwartz and S. Smorodinsky and P. Taslakian}, title = {Colorful Strips}, booktitle = {Proceedings of the 7th Japan Conference on Computational Geometry and Graphs (JCCGG09)}, year = {2009}, note = {2 pages} }

@inproceedings{ACCDDDFHHLSST09a, author = {G. Aloupis and J. Cardinal and S. Collette and E. D. Demaine and M. L. Demaine and M. Dulieu and R. Fabila-Monroy and V. Hart and F. Hurtado and S. Langerman and M. Saumell and C. Seara and P. Taslakian}, title = {Matching Points with Things}, booktitle = {Proceedings of the 7th Japan Conference on Computational Geometry and Graphs (JCCGG09)}, year = {2009}, note = {2 pages} }

@inproceedings{BCCDPTZ09a, abstract = {We study a new family of geometric graphs that interpolate between the Delaunay triangulation and the Gabriel graph. These graphs share many properties with $\beta$-skeletons for $\beta \in [0,1]$ (such as sublinear spanning ratio) with the added benefit of planarity (and consequently linear size and local routability).}, author = {P. Bose and J. Cardinal and S. Collette and E. D. Demaine and B. Palop and P. Taslakian and N. Zeh}, title = {{Relaxed Gabriel Graphs}}, booktitle = {Proceedings of the Canadian Conference on Computational Geometry ({CCCG09})}, year = {2009}, note = {4 pages} }

@inproceedings{ABBCDHKLPW09c, abstract = { We prove the following generalised empty pentagon theorem: for every integer \ell \geq 2, every sufficiently large set of points in the plane contains \ell collinear points or an empty pentagon. As an application, we settle the next open case of the Big Line or Big Clique Conjecture of K\'ara, P\'or, and Wood [Discrete Comput. Geom. 34(3):497--506, 2005].}, author = {Z. Abel and B. Ballinger and P. Bose and S. Collette and V. Dujmovi\'c and F. Hurtado and S. D. Kominers and S. Langerman and A. P\'or and D. R. Wood}, title = {Every Large Point Set contains Many Collinear Points or an Empty Pentagon}, booktitle = {Proceedings of the Canadian Conference on Computational Geometry ({CCCG09})}, year = {2009}, note = {4 pages} }

@inproceedings{ACCHLO08a, author = {G. Aloupis and J. Cardinal and S. Collette and F. Hurtado and S. Langerman and J. O'Rourke}, booktitle = {Proceedings of the Canadian Conference on Computational Geometry ({CCCG08})}, note = {7 pages}, title = {Draining a Polygon - or - Rolling a Ball out of a Polygon}, year = {2008} }

@inproceedings{ACCLS08a, author = {G. Aloupis and J. Cardinal and S. Collette and S. Langerman and S. Smorodinsky}, booktitle = {Proceedings of the 24th European Workshop on Computational Geometry ({EuroCG08})}, title = {Coloring Geometric Range Spaces}, year = {2008}, note = {4 pages} }

@inproceedings{ACDDFLORSW07, author = {G. Aloupis and S. Collette and M. Damian and E. D. Demaine and R. Flatland and S. Langerman and J. O'Rourke and S. Ramaswami and V. Sacristan and S. Wuhrer}, booktitle = {Proceedings of the XII Encuentros de Geometr{\'\i}a Computacional (EGC'07)}, note = {8 pages}, title = {Linear Reconfiguration of Cube-Style Modular Robots}, year = {2007} }

@inproceedings{CCHLP07b, author = {J. Cardinal and S. Collette and F. Hurtado and S. Langerman and B. Palop}, booktitle = {Proceedings of the XII Encuentros de Geometr{\'\i}a Computacional (EGC'07)}, note = {8 pages}, title = {Moving Walkways, Escalators, and Elevators}, year = {2007} }

@inproceedings{CDILM07c, author = {S. Collette and V. Dujmovi\'c and J. Iacono and S. Langerman and P. Morin}, booktitle = {Proceedings of the 17th Fall Workshop on Computational and Combinatorial Geometry}, title = {Distribution-sensitive point location in convex subdivisions}, year = {2007}, note = {2 pages} }

@inproceedings{CCHLP07, abstract = {We study a simple geometric model of transportation facility that consists of two points between which the travel speed is high. This elementary definition can model shuttle services, tunnels, bridges, teleportation devices, escalators or moving walkways. The travel time between a pair of points is defined as a time distance, in such a way that a customer uses the transportation facility only if it is helpful. We give algorithms for finding the optimal location of such a transportation facility, where optimality is defined with respect to the maximum travel time between two points in a given set.}, author = {J. Cardinal and S. Collette and F. Hurtado and S. Langerman and B. Palop}, booktitle = {Proceedings of the Kyoto International Conference on Computational Geometry and Graph Theory (KyotoCGGT2007)}, note = {2 pages}, title = {Moving Walkways, Escalators, and Elevators}, pdf = {http://arxiv.org/abs/0705.0635}, year = {2007} }

@inproceedings{ACCLI06, abstract = {In this paper, we analyze the time complexity of finding regular polygons in a set of n points. We use two different approaches to find regular polygons, depending on their number of edges. Those with o(n^0.068) edges are found by sweeping a line through the set of points, while the larger polygons are found by random sampling. We can find with high probability all the polygons in O(n^(2.068+epsilon)) expected time for every positive epsilon. This compares well to the O(n^(2.136+epsilon)) deterministic algorithm of Brass. Our method can also be used to find incomplete regular polygons, where up to a constant fraction of the vertices are missing.}, author = {G. Aloupis and J. Cardinal and S. Collette and J. Iacono and S. Langerman}, booktitle = {Proceedings of the 22nd European Workshop on Computational Geometry ({EuroCG06})}, note = {4 pages}, title = {Where to build a temple, and where to dig to find one}, year = {2006} }

@inproceedings{CCL05b, abstract = {The region counting distances, introduced by Demaine, Iacono and Langerman, associate to any pair of points $p,q$ the number of items of a dataset $S$ contained in a region $R(p,q)$ surrounding $p,q$. We define region counting disks and circles, and study the complexity of these objects. In particular, we prove that for some wide class of regions $R(p,q)$, the complexity of a region counting circle of radius $k$ is either at least as large as the complexity of the $k$-level in an arrangement of lines, or is linear in $|S|$. We give a complete characterization of regions falling into one of these two cases. Algorithms to compute $\epsilon$-approximations of region counting distances and approximations of region counting circles are presented.}, author = {J. Cardinal and S. Collette and S. Langerman}, booktitle = {Proceedings of the Canadian Conference on Computational Geometry ({CCCG05})}, note = {4 pages}, pages = {278--281}, title = {Region Counting Circles}, year = {2005} }

@inproceedings{CCL05a, abstract = {A new family of proximity graphs, called Region Counting Graphs (RCG) is presented. The RCG for a finite set of points in the plane uses the notion of region counting distance introduced by Demaine et al. to characterize the proximity between two points p and q: the edge pq is in the RCG if and only if there is less than or exactly k vertices in a given geometric neighborhood defined by a region. These graphs generalize many common proximity graphs, such as k-nearest neighbor graphs, Beta-skeletons or Theta-graphs. This paper concentrates on RCGs that are invariant under translations, rotations and uniform scaling. For k=0, we give conditions on regions R that define an RCG to ensure a number of properties including planarity, connectivity, triangle freeness, cycle freeness, bipartiteness, and bounded degree. These conditions take form of what we call tight regions: maximal or minimal regions that a region R must contain or be contained in to satisfy a given monotone property. }, author = {J. Cardinal and S. Collette and S. Langerman}, booktitle = {Proceedings of the 21st European Workshop on Computational Geometry ({EuroCG05})}, note = {4 pages}, title = {Region Counting Graphs}, year = {2005} }

@inproceedings{CCL04, abstract = {We introduce a new property for geometric graphs: the local diameter. This property is based on the use of the region counting distances introduced by Demaine, Iacono and Langerman as a generalization of the rank difference. We use it as a characterization of the local density of the vertices. We study the properties of those distances, and show that there is a strong relation between region counting distances and speed distances. We define the local diameter as the upper bound on the length of the shortest path between any pair of vertices, expressed as a function of the number of vertices in their neighborhood. We determine the local diameter of several well-studied graphs such as the Ordered Theta-graph and the Skip List Spanner. We also analyze the impact of the local diameter for different applications, such as path and point queries on geometric graphs.}, author = {J. Cardinal and S. Collette and S. Langerman}, booktitle = {Proceedings of the Canadian Conference on Computational Geometry ({CCCG04})}, note = {4 pages}, title = {Local Properties of Geometric Graphs}, year = {2004} }

@comment{{This file has been generated by bib2bib 1.99}}

@comment{{Command line: bib2bib -r -s year bibtexfiles/secollet-local-future.bib}}