Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 42 matches
- 2019
- Matt Gibson, Erik Krohn, Bengt J. Nilsson, Matthew Rayford, Pawel Zylinski:
A Note on Guarding Staircase Polygons. CCCG 2019: 105-109 - Sepideh Aghamolaei, Mohammad Ghodsi, Seyyedhamid Miri:
A MapReduce Algorithm for Metric Anonymity Problems. CCCG 2019: 117-123 - Oswin Aichholzer, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Maarten Löffler, Zuzana Masárová, Klara Mundilova, Christiane Schmidt:
Folding Polyominoes with Holes into a Cube. CCCG 2019: 164-170 - Hugo Alves Akitaya, Leonie Ryvkin, Csaba D. Tóth:
Rock Climber Distance: Frogs versus Dogs. CCCG 2019: 210-217 - Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher:
Watchtower for k-crossing Visibility. CCCG 2019: 203-209 - Sayan Bandyapadhyay, Saeed Mehrabi:
Constrained Orthogonal Segment Stabbing. CCCG 2019: 195-202 - Aritra Banik, Bhaswar B. Bhattacharya, Sujoy Bhore, Leonardo Martínez-Sandoval:
Geometric Systems of Unbiased Representatives. CCCG 2019: 38-43 - Mark de Berg:
ETH-Tight Algorithms for Geometric Network Problems Using Geometric Separators. CCCG 2019: 225 - Therese Biedl, Pavle Bulatovic, Veronika Irvine, Anna Lubiw, Owen D. Merkel, Anurag Murty Naredla:
Reconstructing a Polyhedron between Polygons in Parallel Slices. CCCG 2019: 139-145 - Therese Biedl, Ahmad Biniaz, Anna Lubiw:
Minimum Ply Covering of Points with Disks and Squares. CCCG 2019: 226-235 - Ahmad Biniaz, Prosenjit Bose, Jean Cardinal, Michael S. Payne:
Three-Coloring Three-Dimensional Uniform Hypergraphs. CCCG 2019: 23-28 - Prosenjit Bose, Pilar Cano, Rodrigo I. Silveira:
Ane invariant triangulations. CCCG 2019: 250-256 - Prosenjit Bose, Thomas C. Shermer:
Attraction-convexity and Normal Visibility. CCCG 2019: 110-116 - Kevin Buchin, Pedro Machado Manhães de Castro, Olivier Devillers, Menelaos Karavelas:
Hardness results on Voronoi, Laguerre and Apollonius diagrams. CCCG 2019: 99-104 - Alyxander Burns, Peter Klemperer, Jaemarie Solyst, Audrey St. John:
Redundant Persistent Acyclic Formations for Vision-Based Control of Distributed Multi-Agent Formations. CCCG 2019: 29-37 - Jean Cardinal, Ruy Fabila Monroy, Carlos Hidalgo-Toscano:
Chirotopes of Random Points in Space are Realizable on a Small Integer Grid. CCCG 2019: 44-48 - Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard:
Peeling Digital Potatoes. CCCG 2019: 124-132 - Ovidiu Daescu, Ka Yaw Teo:
Computing Feasible Trajectories for an Articulated Probe in Three Dimensions. CCCG 2019: 59-70 - Arun Kumar Das, Sandip Das, Joydeep Mukherjee:
Largest Triangle inside a Terrain. CCCG 2019: 133-138 - Martin L. Demaine, Robert A. Hearn, Jason S. Ku, Ryuhei Uehara:
Rectangular Unfoldings of Polycubes. CCCG 2019: 159-163 - Vida Dujmovic:
Graph Drawing via Layered Partitions. CCCG 2019: 1 - Soroush Ebadian, Hamid Zarrabi-Zadeh:
A Simple Randomized Algorithm for All Nearest Neighbors. CCCG 2019: 94-98 - David Eppstein:
Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings. CCCG 2019: 17-22 - Morten Eskildsen, Matias Frank Jensen, Sebastian Kolby, Jesper Steensgaard:
Maintaining a Centerpoint in the Plane with Amortized Optimal Logarithmic Insertions. CCCG 2019: 2-8 - Alejandro Flores-Velazco, David M. Mount:
Guarantees on Nearest-Neighbor Condensation heuristics. CCCG 2019: 87-93 - Bin Fu, Robert T. Schweller, Tim Wylie:
Discrete Planar Map Matching. CCCG 2019: 218-224 - Daniel Gibney, Sharma V. Thankachan, Arnab Ganguly, Rahul Shah:
I/O Optimal Data Structures for Categorical Range Skyline Queries. CCCG 2019: 9-16 - Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka:
Ecient Segment Folding is Hard. CCCG 2019: 177-183 - Guoxin Hu, Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno:
Simple Fold and Cut Problem for Line Segments. CCCG 2019: 153-158 - Tanmay Inamdar:
Local Search for Geometric Partial Covering Problems. CCCG 2019: 242-249
skipping 12 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-04-25 17:54 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint