Остановите войну!
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 2,228 matches
- 2023
- Arindam Khan, Aditya Lonkar, Saladi Rahul, Aditya Subramanian, Andreas Wiese:
Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set. SoCG 2023: 46:1-46:17 - Michael Hoffmann, Meghana M. Reddy:
The Number of Edges in Maximal 2-Planar Graphs. SoCG 2023: 39:1-39:15 - Rahul Jain, Marco Ricci, Jonathan Rollin, André Schulz:
On the Geometric Thickness of 2-Degenerate Graphs. SoCG 2023: 44:1-44:15 - Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow:
Geometric Embeddability of Complexes Is ∃ℝ-Complete. SoCG 2023: 1:1-1:19 - Mikkel Abrahamsen, William Bille Meyling, André Nusser:
Constructing Concise Convex Covers via Clique Covers (CG Challenge). SoCG 2023: 66:1-66:9 - Mikkel Abrahamsen, Bartosz Walczak:
Distinguishing Classes of Intersection Graphs of Homothets or Similarities of Two Convex Disks. SoCG 2023: 2:1-2:16 - Peyman Afshani, Pingan Cheng:
Lower Bounds for Intersection Reporting Among Flat Objects. SoCG 2023: 3:1-3:16 - Pankaj K. Agarwal, Esther Ezra:
Line Intersection Searching Amid Unit Balls in 3-Space. SoCG 2023: 5:1-5:14 - Pankaj K. Agarwal, Sariel Har-Peled:
Computing Instance-Optimal Kernels in Two Dimensions. SoCG 2023: 4:1-4:15 - Oswin Aichholzer, Man-Kwun Chiu, Hung P. Hoang, Michael Hoffmann, Jan Kyncl, Yannic Maus, Birgit Vogtenhuber, Alexandra Weinberger:
Drawings of Complete Multipartite Graphs up to Triangle Flips. SoCG 2023: 6:1-6:16 - Ángel Javier Alonso, Michael Kerber:
Decomposition of Zero-Dimensional Persistence Modules via Rooted Subsets. SoCG 2023: 7:1-7:16 - Gergely Ambrus, Martin Balko, Nóra Frankl, Attila Jung, Márton Naszódi:
On Helly Numbers of Exponential Lattices. SoCG 2023: 8:1-8:16 - Sunil Arya, David M. Mount:
Optimal Volume-Sensitive Bounds for Polytope Approximation. SoCG 2023: 9:1-9:16 - J. Andreas Bærentzen, Rasmus Emil Christensen, Emil Toftegaard Gæde, Eva Rotenberg:
Multilevel Skeletonization Using Local Separators. SoCG 2023: 13:1-13:18 - Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar:
Coresets for Clustering in Geometric Intersection Graphs. SoCG 2023: 10:1-10:16 - Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue:
Minimum-Membership Geometric Set Cover, Revisited. SoCG 2023: 11:1-11:14 - Sayan Bandyapadhyay, William Lochet, Saket Saurabh:
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii. SoCG 2023: 12:1-12:14 - Ulrich Bauer, Fabian Lenzen, Michael Lesnick:
Efficient Two-Parameter Persistence Computation via Cohomology. SoCG 2023: 15:1-15:17 - Ulrich Bauer, Maximilian Schmahl:
Efficient Computation of Image Persistence. SoCG 2023: 14:1-14:14 - Sarita de Berg, Marc J. van Kreveld, Frank Staals:
The Complexity of Geodesic Spanners. SoCG 2023: 16:1-16:16 - Richard Berger, Vincent Ha, David Kratz, Michael Lin, Jeremy Moyer, Christopher J. Tralie:
Godzilla Onions: A Skit and Applet to Explain Euclidean Half-Plane Fractional Cascading (Media Exposition). SoCG 2023: 62:1-62:3 - Helena Bergold, Stefan Felsner, Manfred Scheucher:
An Extension Theorem for Signotopes. SoCG 2023: 17:1-17:14 - Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg:
Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable. SoCG 2023: 18:1-18:16 - Ahmad Biniaz:
Improved Bounds for Covering Paths and Trees in the Plane. SoCG 2023: 19:1-19:15 - Mickaël Buchet, Bianca B. Dornelas, Michael Kerber:
Sparse Higher Order Čech Filtrations. SoCG 2023: 20:1-20:17 - Benjamin A. Burton, Alexander He:
Finding Large Counterexamples by Selectively Exploring the Pachner Graph. SoCG 2023: 21:1-21:16 - Alexandra Camero, Ileana Streinu:
Interactive 2D Periodic Graphs (Media Exposition). SoCG 2023: 63:1-63:4 - Jean Cardinal, Micha Sharir:
Improved Algebraic Degeneracy Testing. SoCG 2023: 22:1-22:16 - Timothy M. Chan:
Minimum L_∞ Hausdorff Distance of Point Sets Under Translation: Generalizing Klee's Measure Problem. SoCG 2023: 24:1-24:13 - Timothy M. Chan, Zhengcheng Huang:
Constant-Hop Spanners for More Geometric Intersection Graphs, with Even Smaller Size. SoCG 2023: 23:1-23:16
skipping 2,198 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-05 07:15 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