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 79 matches
- 2018
- Eunjin Oh, Hee-Kap Ahn:
Approximate Range Queries for Clustering. SoCG 2018: 62:1-62:14 - Eunjin Oh, Hee-Kap Ahn:
Point Location in Dynamic Planar Subdivisions. SoCG 2018: 63:1-63:14 - Haitao Wang, Jingru Zhang:
An O(n log n)-Time Algorithm for the k-Center Problem in Trees. SoCG 2018: 72:1-72:15 - Tanmay Inamdar, Kasturi R. Varadarajan:
On Partial Covering For Geometric Set Systems. SoCG 2018: 47:1-47:14 - Ahmed Abdelkader, Chandrajit L. Bajaj, Mohamed S. Ebeida, Ahmed H. Mahmoud, Scott A. Mitchell, John D. Owens, Ahmad A. Rushdi:
Sampling Conditions for Conforming Voronoi Meshing by the VoroCrust Algorithm. SoCG 2018: 1:1-1:16 - Ahmed Abdelkader, Chandrajit L. Bajaj, Mohamed S. Ebeida, Ahmed H. Mahmoud, Scott A. Mitchell, John D. Owens, Ahmad A. Rushdi:
VoroCrust Illustrated: Theory and Challenges (Multimedia Exposition). SoCG 2018: 77:1-77:4 - A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid, Shakhar Smorodinsky:
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. SoCG 2018: 2:1-2:12 - Michal Adamaszek, Henry Adams, Ellen Gasparovic, Maria Gommel, Emilie Purvine, Radmila Sazdanovic, Bei Wang, Yusu Wang, Lori Ziegelmeier:
Vietoris-Rips and Cech Complexes of Metric Gluings. SoCG 2018: 3:1-3:15 - Pankaj K. Agarwal, Lars Arge, Frank Staals:
Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon. SoCG 2018: 4:1-4:14 - Ryo Ashida, Kotaro Nakagawa:
O~(n{1/3})-Space Algorithm for the Grid Graph Reachability Problem. SoCG 2018: 5:1-5:13 - Sang Won Bae, Sergio Cabello, Otfried Cheong, Yoonsung Choi, Fabian Stehn, Sang Duk Yoon:
The Reverse Kakeya Problem. SoCG 2018: 6:1-6:13 - Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan:
Capacitated Covering Problems in Geometric Spaces. SoCG 2018: 7:1-7:15 - Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Matthias Konitzny, Lillian Lin, Christian Scheffer:
Coordinated Motion Planning: The Video (Multimedia Exposition). SoCG 2018: 74:1-74:6 - Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid:
Faster Algorithms for some Optimization Problems on Collinear Points. SoCG 2018: 8:1-8:14 - Håvard Bakke Bjerkevik, Magnus Bakke Botnan:
Computational Complexity of the Interleaving Distance. SoCG 2018: 13:1-13:15 - Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh, Mathijs Wintraecken:
Local Criteria for Triangulation of Manifolds. SoCG 2018: 9:1-9:14 - Jean-Daniel Boissonnat, André Lieutier, Mathijs Wintraecken:
The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces. SoCG 2018: 10:1-10:14 - Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora:
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. SoCG 2018: 12:1-12:15 - Édouard Bonnet, Panos Giannopoulos:
Orthogonal Terrain Guarding is NP-complete. SoCG 2018: 11:1-11:15 - Adam Brown, Bei Wang:
Sheaf-Theoretic Stratification Learning. SoCG 2018: 14:1-14:14 - Mickaël Buchet, Emerson G. Escolar:
Realizations of Indecomposable Persistence Modules of Arbitrarily Large Dimension. SoCG 2018: 15:1-15:13 - Kevin Buchin, Jeff M. Phillips, Pingfan Tang:
Approximating the Distribution of the Median and other Robust Estimators on Uncertain Data. SoCG 2018: 16:1-16:14 - Boris Bukh, Xavier Goaoc, Alfredo Hubard, Matthew Trager:
Consistent Sets of Lines with no Colorful Incidence. SoCG 2018: 17:1-17:14 - Benjamin A. Burton:
The HOMFLY-PT Polynomial is Fixed-Parameter Tractable. SoCG 2018: 18:1-18:14 - Ludovic Calès, Apostolos Chalkis, Ioannis Z. Emiris, Vissarion Fisikopoulos:
Practical Volume Computation of Structured Convex Bodies, and an Application to Modeling Portfolio Dependencies and Financial Crises. SoCG 2018: 19:1-19:15 - Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms:
Subquadratic Encodings for Point Configurations. SoCG 2018: 20:1-20:14 - Timothy Carpenter, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Anastasios Sidiropoulos:
Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces. SoCG 2018: 21:1-21:14 - Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, Yann Vaxès:
Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. SoCG 2018: 22:1-22:15 - Timothy M. Chan:
Tree Drawings Revisited. SoCG 2018: 23:1-23:15 - Timothy M. Chan, Dimitrios Skrepetos:
Approximate Shortest Paths and Distance Oracles in Weighted Unit-Disk Graphs. SoCG 2018: 24:1-24:13
skipping 49 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-09-13 01:58 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