Остановите войну!
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 68 matches
- 2019
- Haitao Wang:
A Divide-and-Conquer Algorithm for Two-Point L_1 Shortest Path Queries in Polygonal Domains. SoCG 2019: 59:1-59:14 - Jeff Erickson, Yipu Wang:
Topologically Trivial Closed Walks in Directed Surface Graphs. SoCG 2019: 34:1-34:17 - Haitao Wang, Jie Xue:
Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. SoCG 2019: 60:1-60:13 - Peyman Afshani:
A New Lower Bound for Semigroup Orthogonal Range Searching. SoCG 2019: 3:1-3:14 - Peyman Afshani, Jeff M. Phillips:
Independent Range Sampling, Revisited Again. SoCG 2019: 4:1-4:13 - Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Joshua Zahl:
An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications. SoCG 2019: 5:1-5:14 - Pankaj K. Agarwal, Ravid Cohen, Dan Halperin, Wolfgang Mulzer:
Maintaining the Union of Unit Discs Under Insertions with Near-Optimal Overhead. SoCG 2019: 26:1-26:15 - Pankaj K. Agarwal, Hsien-Chih Chang, Allen Xiao:
Efficient Algorithms for Geometric Partial Matching. SoCG 2019: 6:1-6:14 - Akanksha Agrawal, Grzegorz Guspiel, Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi:
Connecting the Dots (with Minimum Crossings). SoCG 2019: 7:1-7:17 - Dror Aiger, Haim Kaplan, Efi Kokiopoulou, Micha Sharir, Bernhard Zeisl:
General Techniques for Approximate Incidences and Their Application to the Camera Posing Problem. SoCG 2019: 8:1-8:14 - Hugo A. Akitaya, Matias Korman, Mikhail Rudoy, Diane L. Souvaine, Csaba D. Tóth:
Circumscribing Polygons and Polygonizations for Disjoint Line Segments. SoCG 2019: 9:1-9:17 - Hirokazu Anai, Frédéric Chazal, Marc Glisse, Yuichi Ike, Hiroya Inakoshi, Raphaël Tinarrage, Yuhei Umeda:
DTM-Based Filtrations. SoCG 2019: 58:1-58:15 - Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Vincenzo Roselli:
Morphing Contact Representations of Graphs. SoCG 2019: 10:1-10:16 - Dominique Attali, André Lieutier, David Salinas:
When Convexity Helps Collapsing Complexes. SoCG 2019: 11:1-11:15 - Luis Barba:
Optimal Algorithm for Geodesic Farthest-Point Voronoi Diagrams. SoCG 2019: 12:1-12:14 - Gill Barequet, Gil Ben-Shachar:
Properties of Minimal-Perimeter Polyominoes (Multimedia Exposition). SoCG 2019: 64:1-64:4 - Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Sebastian Morr, Christian Scheffer:
Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition). SoCG 2019: 63:1-63:6 - Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, Maurizio Patrignani:
Upward Book Embeddings of st-Graphs. SoCG 2019: 13:1-13:22 - Jean-Daniel Boissonnat, Siddharth Pritam:
Computing Persistent Homology of Flag Complexes via Strong Collapses. SoCG 2019: 55:1-55:15 - Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera:
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12. SoCG 2019: 14:1-14:15 - Vladimir Braverman, Moses Charikar, William Kuszmaul, David P. Woodruff, Lin F. Yang:
The One-Way Communication Complexity of Dynamic Time Warping Distance. SoCG 2019: 16:1-16:15 - Karl Bringmann, Bhaskar Ray Chaudhury:
Polyline Simplification has Cubic Complexity. SoCG 2019: 18:1-18:16 - Karl Bringmann, Marvin Künnemann, André Nusser:
Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance. SoCG 2019: 17:1-17:21 - Kevin Buchin, Sariel Har-Peled, Dániel Oláh:
A Spanner for the Day After. SoCG 2019: 19:1-19:15 - Sergio Cabello, Timothy M. Chan:
Computing Shapley Values in the Plane. SoCG 2019: 20:1-20:19 - Mathieu Carrière, Ulrich Bauer:
On the Metric Distortion of Embedding Persistence Diagrams into Separable Hilbert Spaces. SoCG 2019: 21:1-21:15 - Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, Sander Verdonschot:
Convex Polygons in Cartesian Products. SoCG 2019: 22:1-22:17 - Timothy M. Chan:
Dynamic Geometric Data Structures via Shallow Cuttings. SoCG 2019: 24:1-24:13 - Timothy M. Chan, Sariel Har-Peled:
Smallest k-Enclosing Rectangle Revisited. SoCG 2019: 23:1-23:15 - Hsien-Chih Chang, Marcos Cossarini, Jeff Erickson:
Lower Bounds for Electrical Reduction on Surfaces. SoCG 2019: 25:1-25:16
skipping 38 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-05-12 10:52 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