Остановите войну!
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 94 matches
- 2024
- Haitao Wang, Jie Xue:
Algorithms for Halfplane Coverage and Related Problems. SoCG 2024: 79:1-79:15 - Fabrizio Grandoni, Edin Husic, Mathieu Mari, Antoine Tinguely:
Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions. SoCG 2024: 61:1-61:16 - Zachary Abel, Hugo A. Akitaya, Scott Duke Kominers, Matias Korman, Frederick Stock:
A Universal In-Place Reconfiguration Algorithm for Sliding Cube-Shaped Robots in a Quadratic Number of Moves. SoCG 2024: 1:1-1:14 - Mikkel Abrahamsen, Sarita de Berg, Lucas Meijer, André Nusser, Leonidas Theocharous:
Clustering with Few Disks to Minimize the Sum of Radii. SoCG 2024: 2:1-2:15 - Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay:
On the Number of Digons in Arrangements of Pairwise Intersecting Circles. SoCG 2024: 3:1-3:14 - Pankaj K. Agarwal, Esther Ezra, Micha Sharir:
Semi-Algebraic Off-Line Range Searching and Biclique Partitions in the Plane. SoCG 2024: 4:1-4:15 - Manasseh Ahmed, Tsun-Ming Cheung, Hamed Hatami, Kusha Sareen:
Communication Complexity and Discrepancy of Halfplanes. SoCG 2024: 5:1-5:17 - Luca Castelli Aleardi, Olivier Devillers:
SCARST: Schnyder Compact and Regularity Sensitive Triangulation Data Structure. SoCG 2024: 32:1-32:19 - Ángel Javier Alonso, Michael Kerber, Primoz Skraba:
Probabilistic Analysis of Multiparameter Persistence Decompositions into Intervals. SoCG 2024: 6:1-6:19 - Shinwoo An, Eunjin Oh:
ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs. SoCG 2024: 7:1-7:15 - Boris Aronov, Abdul Basit, Indu Ramesh, Gianluca Tasinato, Uli Wagner:
Eight-Partitioning Points in 3D, and Efficiently Too. SoCG 2024: 8:1-8:15 - Boris Aronov, Mark de Berg, Leonidas Theocharous:
A Clique-Based Separator for Intersection Graphs of Geodesic Disks in ℝ². SoCG 2024: 9:1-9:15 - Boris Aronov, Tsuri Farhana, Matthew J. Katz, Indu Ramesh:
Discrete Fréchet Distance Oracles. SoCG 2024: 10:1-10:14 - Alkan Atak, Kevin Buchin, Mart Hagedoorn, Jona Heinrichs, Karsten Hogreve, Guangping Li, Patrick Pawelczyk:
Computing Maximum Polygonal Packings in Convex Polygons Using Best-Fit, Genetic Algorithms and ILPs (CG Challenge). SoCG 2024: 83:1-83:9 - Dominique Attali, Hana Dal Poz Kourimská, Christopher Fillmore, Ishika Ghosh, André Lieutier, Elizabeth Stephenson, Mathijs Wintraecken:
Tight Bounds for the Learning of Homotopy à la Niyogi, Smale, and Weinberger for Subsets of Euclidean Spaces and of Riemannian Manifolds. SoCG 2024: 11:1-11:19 - Dominique Attali, Hana Dal Poz Kourimská, Christopher Fillmore, Ishika Ghosh, André Lieutier, Elizabeth Stephenson, Mathijs Wintraecken:
The Ultimate Frontier: An Optimality Construction for Homotopy Inference (Media Exposition). SoCG 2024: 87:1-87:6 - Sayan Bandyapadhyay, Jie Xue:
An O(n log n)-Time Approximation Scheme for Geometric Many-To-Many Matching. SoCG 2024: 12:1-12:15 - Willow Barkan-Vered, Huck Bennett, Amir Nayyeri:
Topological k-Metrics. SoCG 2024: 13:1-13:13 - Brannon Basilio, Chaeryn Lee, Joseph Malionek:
Totally Geodesic Surfaces in Hyperbolic 3-Manifolds: Algorithms and Examples. SoCG 2024: 14:1-14:19 - Ulrich Bauer, Fabian Roll:
Wrapping Cycles in Delaunay Complexes: Bridging Persistent Homology and Discrete Morse Theory. SoCG 2024: 15:1-15:16 - Sarita de Berg, Tillmann Miltzow, Frank Staals:
Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain. SoCG 2024: 17:1-17:16 - Mark de Berg, Leonidas Theocharous:
A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon. SoCG 2024: 16:1-16:16 - Helena Bergold, Stefan Felsner, Meghana M. Reddy, Joachim Orthaber, Manfred Scheucher:
Plane Hamiltonian Cycles in Convex Drawings. SoCG 2024: 18:1-18:16 - Sujoy Bhore, Martin Nöllenburg, Csaba D. Tóth, Jules Wulms:
Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time. SoCG 2024: 19:1-19:16 - Václav Blazej, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, Johannes Zink:
Constrained and Ordered Level Planarity Parameterized by the Number of Levels. SoCG 2024: 20:1-20:16 - Jean-Daniel Boissonnat, Kunal Dutta, Soumik Dutta, Siddharth Pritam:
On Edge Collapse of Random Simplicial Complexes. SoCG 2024: 21:1-21:16 - Nicolas Bousquet, Lucas de Meyer, Théo Pierron, Alexandra Wesolek:
Reconfiguration of Plane Trees in Convex Geometric Graphs. SoCG 2024: 22:1-22:17 - Mathilde Bouvel, Valentin Féray, Xavier Goaoc, Florent Koechlin:
A Canonical Tree Decomposition for Chirotopes. SoCG 2024: 23:1-23:18 - Bruce Brewer, Gerth Stølting Brodal, Haitao Wang:
Dynamic Convex Hulls for Simple Paths. SoCG 2024: 24:1-24:15 - Karl Bringmann, Frank Staals, Karol Wegrzycki, Geert van Wordragen:
Fine-Grained Complexity of Earth Mover's Distance Under Translation. SoCG 2024: 25:1-25:17
skipping 64 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-07-02 06:39 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