Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID27. CCCG 2015: Kingston, Ontario, Canada
- Proceedings of the 27th Canadian Conference on Computational Geometry, CCCG 2015, Kingston, Ontario, Canada, August 10-12, 2015. Queen's University, Ontario, Canada 2015
Paul Erdos Memorial Lecture
- Bruce A. Reed:
Connectivity Preserving Iterative Compression.
Session 1A
- J. Mark Keil, Joseph S. B. Mitchell, Dinabandhu Pradhan, Martin Vatshelle:
An Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs. - Stephane Durocher, Robert Fraser:
Duality for Geometric Set Cover and Geometric Hitting Set Problems on Pseudodisks. - Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov:
Conflict-free Covering. - Mayank Goswami, Siming Li, Junwei Zhang, Emil Saucan, Xianfeng David Gu, Jie Gao:
Space Filling Curves for 3D Sensor Networks with Complex Topology.
Session 1B
- Willem Hagemann, Eike Möhlmann
:
Inscribing H-Polyhedra in Quadrics Using a Projective Generalization of Closed Sets. - Therese Biedl, Martin Derka:
1-string B1-VPG-representations of planar partial 3-trees and some subclasses. - Sepideh Aghamolaei, Majid Farhadi, Hamid Zarrabi-Zadeh:
Diversity Maximization via Composable Coresets. - Matthew Dippel, Ravi Sundaram:
An Upper Bound on Trilaterating Simple Polygons.
Session 2A
- Prosenjit Bose, Jean-Lou De Carufel, André van Renssen:
Constrained Empty-Rectangle Delaunay Graphs. - Prosenjit Bose, Sander Verdonschot:
Flips in Edge-Labelled Pseudo-Triangulations. - Giovanni Viglietta, Prosenjit Bose, Jean-Lou De Carufel, Michael Gene Dobbins, Heuna Kim:
The Shadows of a Cycle Cannot All Be Paths.
Session 2B
- Zahra Mirikharaji, Bradford G. Nickerson:
A Fault Tolerant Data Structure for Peer-to-Peer Range Query Processing. - J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan:
Range Counting with Distinct Constraints. - Aritra Banik, Matthew J. Katz, Marina Simakov:
Bottleneck Segment Matching.
Session 3A
- Laurie J. Heyer, Anna Lubiw, Debajyoti Mondal, Ulrike Stege, Sue Whitesides:
Reconfiguring a Chain of Cubes. - Oswin Aichholzer, Michael Biro, Erik D. Demaine, Martin L. Demaine, David Eppstein, Sándor P. Fekete, Adam Hesterberg, Irina Kostitsyna, Christiane Schmidt:
Folding Polyominoes into (Poly)Cubes. - Amirhossein Mozafari, Alireza Zarei:
Touring a Sequence of Line Segments in Polygonal Domain Fences.
Session 3B
- Nicholas J. Cavanna, Mahmoodreza Jahanseir, Don Sheehy:
A Geometric Perspective on Sparse Filtrations. - Shahin Kamali, Alejandro López-Ortiz, Zahed Rahmati:
Online Packing of Equilateral Triangles. - Mabel Iglesias Ham, Herbert Edelsbrunner, Vitaliy Kurlin:
Relaxed Disk Packing.
Session 4A
- Timothy M. Chan, Zahed Rahmati:
Approximating the Minimum Closest Pair Distance and Nearest Neighbor Distances of Linearly Moving Points. - Timothy M. Chan, Simon Pratt:
Time-Windowed Closest Pair. - Donald R. Sheehy:
An Output-Sensitive Algorithm for Computing Weighted α-Complexes. - Timothy M. Chan, Dimitrios Skrepetos:
Dynamic data structures for approximate Hausdorff distance in the word RAM.
Session 4B
- Aruni Choudhary, Michael Kerber:
Local Doubling Dimension of Point Sets. - Raimi Ayinde Rufai, Dana Richards:
A Streaming Algorithm for the Convex Hull. - Behnam Hatami, Hamid Zarrabi-Zadeh:
A Streaming Algorithm for 2-Center with Outliers in High Dimensions. - Michael Kerber, Sharath Raghvendra:
Approximation and Streaming Algorithms for Projective Clustering via Random Projections.
Invited Plenary Lecture
- Jonathan Richard Shewchuk:
Fun with Restricted Delaunay Triangulations.
Session 5A
- Shimin Li, Haitao Wang:
Algorithms for Minimizing the Movements of Spreading Points in Linear Domains. - Shankar Sastry:
Maximizing the Minimum Angle with the Insertion of Steiner Vertices. - Leonidas Palios:
An Output-Sensitive Algorithm for Computing the s-Kernel.
Session 5B
- Bahram Kouhestani, David Rappaport, Kai Salomaa:
On the Inverse Beacon Attraction Region of a Point. - Thomas C. Shermer:
A Combinatorial Bound for Beacon-based Routing in Orthogonal Polygons. - Stephane Durocher, Pak Ching Li, Saeed Mehrabi:
Guarding Orthogonal Terrains.
Open Problem Session
- Sue Whitesides:
Open Problems from CCCG 2014.
Ferran Hurtado Memorial Lecture
- Prosenjit Bose:
One of Ferran Hurtado's favorite topics - Flips.
Session 6A
- Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack:
Weighted Minimum Backward Frechet Distance. - Robin Y. Flatland, Alexandru Damian:
Squeeze-free Hamiltonian Paths in Grid Graphs. - A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur:
Strongly Connected Spanning Subgraph for Almost Symmetric Networks. - Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid, Paul Liu:
A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem. - Gokarna Sharma, Costas Busch, Supratik Mukhopadhyay:
Bounds on Mutual Visibility Algorithms.
Session 6B
- Harrison Gregg, Jody Leonard, Aaron Santiago, Aaron Williams:
Buttons & Scissors is NP-Complete. - Aviv Adler, Michael Biro, Erik D. Demaine, Mikhail Rudoy, Christiane Schmidt:
Computational complexity of numberless Shakashaka. - Ahmed Abdelkader, Ahmed Saeed, Khaled A. Harras, Amr Mohamed:
The Inapproximability of Illuminating Polygons by α-Floodlights. - Martin Fink, Subhash Suri:
Tradeoffs between Bends and Displacement in Anchored Graph Drawing.
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-22 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
