Остановите войну!
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 69 matches
- 2017
- Eunjin Oh, Hee-Kap Ahn:
Dynamic Geodesic Convex Hulls in Dynamic Simple Polygons. SoCG 2017: 51:1-51:15 - Eunjin Oh, Hee-Kap Ahn:
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon. SoCG 2017: 52:1-52:15 - Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow:
Irrational Guards are Sometimes Needed. SoCG 2017: 3:1-3:15 - Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi:
Minimum Perimeter-Sum Partitions in the Plane. SoCG 2017: 4:1-4:15 - Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi:
Range-Clustering Queries. SoCG 2017: 5:1-5:16 - Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen:
Best Laid Plans of Lions and Men. SoCG 2017: 6:1-6:16 - Pankaj K. Agarwal, Kyle Fox, Debmalya Panigrahi, Kasturi R. Varadarajan, Allen Xiao:
Faster Algorithms for the Geometric Transportation Problem. SoCG 2017: 7:1-7:16 - Oswin Aichholzer, Martin Balko, Thomas Hackl, Jan Kyncl, Irene Parada, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber:
A Superlinear Lower Bound on the Number of 5-Holes. SoCG 2017: 8:1-8:16 - Patrizio Angelini, Michael A. Bekos, Giuseppe Liotta, Fabrizio Montecchiani:
A Universal Slope Set for 1-Bend Planar Drawings. SoCG 2017: 9:1-9:16 - Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Near-Optimal epsilon-Kernel Construction and Related Problems. SoCG 2017: 10:1-10:15 - Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi:
Exact Algorithms for Terrain Guarding. SoCG 2017: 11:1-11:15 - Martin Balko, Josef Cibulka, Pavel Valtr:
Covering Lattice Points by Subspaces and Counting Point-Hyperplane Incidences. SoCG 2017: 12:1-12:16 - Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon:
Subquadratic Algorithms for Algebraic Generalizations of 3SUM. SoCG 2017: 13:1-13:15 - Lukas Barth, Benjamin Niedermann, Ignaz Rutter, Matthias Wolf:
Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings. SoCG 2017: 14:1-14:16 - Abdul Basit, Zeev Dvir, Shubhangi Saraf, Charles Wolf:
On the Number of Ordinary Lines Determined by Sets in Complex Space. SoCG 2017: 15:1-15:15 - Aaron T. Becker, Mustapha Debboun, Sándor P. Fekete, Dominik Krupke, An Nguyen:
Zapping Zika with a Mosquito-Managing Drone: Computing Optimal Flight Patterns with Minimum Turn Cost (Multimedia Contribution). SoCG 2017: 62:1-62:5 - Sander Beekhuis, Kevin Buchin, Thom Castermans, Thom Hurks, Willem Sonke:
Ruler of the Plane - Games of Geometry (Multimedia Contribution). SoCG 2017: 63:1-63:5 - Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou:
On Optimal 2- and 3-Planar Graphs. SoCG 2017: 16:1-16:16 - Daniel Binham, Pedro Machado Manhães de Castro, Antoine Vigneron:
Reachability in a Planar Subdivision with Direction Constraints. SoCG 2017: 17:1-17:15 - Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Pawel Rzazewski:
Fine-Grained Complexity of Coloring Unit Disks and Balls. SoCG 2017: 18:1-18:16 - Jean-Daniel Boissonnat, Mael Rouxel-Labbé, Mathijs Wintraecken:
Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams. SoCG 2017: 19:1-19:16 - Édouard Bonnet, Tillmann Miltzow:
An Approximation Algorithm for the Art Gallery Problem. SoCG 2017: 20:1-20:15 - Prosenjit Bose, Irina Kostitsyna, Stefan Langerman:
Self-Approaching Paths in Simple Polygons. SoCG 2017: 21:1-21:15 - Karl Bringmann, Sergio Cabello, Michael T. M. Emmerich:
Maximum Volume Subset Selection for Anchored Boxes. SoCG 2017: 22:1-22:15 - Mickaël Buchet, Tamal K. Dey, Jiayuan Wang, Yusu Wang:
Declutter and Resample: Towards Parameter Free Denoising. SoCG 2017: 23:1-23:16 - Kevin Buchin, Jinhee Chun, Maarten Löffler, Aleksandar Markovic, Wouter Meulemans, Yoshio Okamoto, Taichi Shiitada:
Folding Free-Space Diagrams: Computing the Fréchet Distance between 1-Dimensional Curves (Multimedia Contribution). SoCG 2017: 64:1-64:5 - Mathieu Carrière, Steve Oudot:
Local Equivalence and Intrinsic Metrics between Reeb Graphs. SoCG 2017: 25:1-25:15 - Timothy M. Chan:
Applications of Chebyshev Polynomials to Low-Dimensional Computational Geometry. SoCG 2017: 26:1-26:15 - Timothy M. Chan:
Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back. SoCG 2017: 27:1-27:15 - Timothy M. Chan, Konstantinos Tsakalidis:
Dynamic Orthogonal Range Searching on the RAM, Revisited. SoCG 2017: 28:1-28:13
skipping 39 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-06-03 21:14 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