Остановите войну!
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 52 matches
- 2012
- Fatemeh Abbasinejad, Pushkar Joshi, Nina Amenta:
Surface patches from unorganized space curves. SCG 2012: 417-418 - Amirali Abdullah, John Moeller, Suresh Venkatasubramanian:
Approximate bregman near neighbors in sublinear time: beyond the triangle inequality. SCG 2012: 31-40 - Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Pedro Ramos, Gelasio Salazar:
The 2-page crossing number of Kn. SCG 2012: 397-404 - Michal Adamaszek, Juraj Stacho:
Algorithmic complexity of finding cross-cycles in flag complexes. SCG 2012: 51-60 - Abhijin Adiga, L. Sunil Chandran:
Representing a cubic graph as the intersection graph of axis-parallel boxes in three dimensions. SCG 2012: 387-396 - Peyman Afshani:
Improved pointer machine and I/O lower bounds for simplex range reporting and related problems. SCG 2012: 339-346 - Peyman Afshani, Lars Arge, Kasper Green Larsen:
Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model. SCG 2012: 323-332 - Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt:
Computing cartograms with optimal complexity. SCG 2012: 21-30 - Victor Alvarez, Karl Bringmann, Radu Curticapean, Saurabh Ray:
Counting crossing-free structures. SCG 2012: 61-68 - Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Optimal area-sensitive bounds for polytope approximation. SCG 2012: 363-372 - Dror Atariah, Günter Rote:
Configuration space visualization. SCG 2012: 415-416 - Ashwinkumar Badanidiyuru, Robert Kleinberg, Hooyeon Lee:
Approximating low-dimensional coverage problems. SCG 2012: 161-170 - Therese Biedl, Martin Vatshelle:
The point-set embeddability problem for plane graphs. SCG 2012: 41-50 - Christopher J. Bishop:
Mappings and meshes. SCG 2012: 199-200 - Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh:
Stability of Delaunay-type structures for manifolds: [extended abstract]. SCG 2012: 229-238 - Nicolas Bonifas, Marco Di Summa, Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier:
On sub-determinants and the diameter of polyhedra. SCG 2012: 357-362 - Ciprian Borcea, Ileana Streinu, Shin-ichi Tanigawa:
Periodic body-and-bar frameworks. SCG 2012: 347-356 - John Christopher Bowers, Ileana Streinu:
Lang's universal molecule algorithm. SCG 2012: 419-420 - Joseph M. Burdis, Irina A. Kogan:
Object-image correspondence for curves under central and parallel projections. SCG 2012: 373-382 - Guillermo D. Cañas, Steven J. Gortler:
Duals of orphan-free anisotropic voronoi diagrams are embedded meshes. SCG 2012: 219-228 - Timothy M. Chan:
Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set. SCG 2012: 293-302 - Siu-Wing Cheng, Jiongxin Jin, Man-Kit Lau:
A fast and simple surface reconstruction algorithm. SCG 2012: 69-78 - Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri:
Self-improving algorithms for coordinate-wise maxima. SCG 2012: 277-286 - Anne Driemel, Sariel Har-Peled, Benjamin Raichel:
On the expected complexity of voronoi diagrams on terrains. SCG 2012: 101-110 - Herbert Edelsbrunner, Brittany Terese Fasy, Günter Rote:
Add isotropic Gaussian kernels at own risk: more and more resilient modes in higher dimensions. SCG 2012: 91-100 - Herbert Edelsbrunner, Michael Kerber:
Alexander duality for functions: the persistent behavior of land and water and shore. SCG 2012: 249-258 - Marek Eliás, Jirí Matousek:
Higher-order Erdos-Szekeres theorems. SCG 2012: 81-90 - Ioannis Z. Emiris, Vissarion Fisikopoulos, Christos Konaxis, Luis Mariano Peñaranda:
An output-sensitive algorithm for computing projections of resultant polytopes. SCG 2012: 179-188 - Alina Ene, Sariel Har-Peled, Benjamin Raichel:
Geometric packing under non-uniform constraints. SCG 2012: 11-20 - Jeff Erickson, Amir Nayyeri:
Tracing compressed curves in triangulated surfaces. SCG 2012: 131-140
skipping 22 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-20 06:00 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