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 26 matches
- 2024
- Oswin Aichholzer, Anna Brötzner:
Bicolored Order Types. Comput. Geom. Topol. 3(2): 3:1-3:17 (2024) - Oswin Aichholzer, Joachim Orthaber, Birgit Vogtenhuber:
Towards Crossing-Free Hamiltonian Cycles in Simple Drawings of Complete Graphs. Comput. Geom. Topol. 3(2): 5:1-5:30 (2024) - Jacobus Conradi, Anne Driemel, Benedikt Kolbe:
(1+ε)-ANN Data Structure for Curves via Subspaces of Bounded Doubling Dimension. Comput. Geom. Topol. 3(2): 6:1-6:22 (2024) - Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Eike Niehs:
Edge Sparsification for Geometric Tour Problems. Comput. Geom. Topol. 3(1): 1:1-1:23 (2024) - Minh Tuan Ha, Paul Jungeblut, Torsten Ueckerdt, Pawel Zylinski:
Primal-Dual Cops and Robber. Comput. Geom. Topol. 3(2): 4:1-4:12 (2024) - Patrick Schnider, Simon Weber:
On the Complexity of Recognizing Nerves of Convex Sets. Comput. Geom. Topol. 3(2): 2:1-2:8 (2024) - 2023
- Hugo A. Akitaya, Maarten Löffler, Giovanni Viglietta:
Pushing Blocks by Sweeping Lines. Comput. Geom. Topol. 2(1): 6:1-6:28 (2023) - Boris Aronov, Abdul Basit, Mark de Berg, Joachim Gudmundsson:
Partitioning Axis-Parallel Lines in 3D. Comput. Geom. Topol. 2(1): 9:1-9:20 (2023) - Mark de Berg:
A Note on Reachability and Distance Oracles for Transmission Graphs. Comput. Geom. Topol. 2(1): 4:1-4:15 (2023) - Nicolas Bousquet, Valentin Gledel, Jonathan Narboni, Théo Pierron:
A Note on the Flip Distance between Non-crossing Spanning Trees. Comput. Geom. Topol. 2(1): 8:1-8:7 (2023) - Franz J. Brandenburg:
On Optimal Beyond-Planar Graphs. Comput. Geom. Topol. 2(1): 3:1-3:15 (2023) - Frederik Brüning, Hugo A. Akitaya, Erin W. Chambers, Anne Driemel:
Subtrajectory Clustering: Finding Set Covers for Set Systems of Subcurves. Comput. Geom. Topol. 2(1): 1:1-1:48 (2023) - Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff:
Morphing Planar Graph Drawings Through 3D. Comput. Geom. Topol. 2(1): 5:1-5:18 (2023) - Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff:
Planar L-Drawings of Directed Graphs. Comput. Geom. Topol. 2(1): 7:1-7:15 (2023) - Loïc Dubois:
A Bound for Delaunay Flip Algorithms on Flat Tori. Comput. Geom. Topol. 2(2): 6:1-6:13 (2023) - David Eppstein:
Locked and Unlocked Smooth Embeddings of Surfaces. Comput. Geom. Topol. 2(2): 5:1-5:20 (2023) - Anna Lubiw, Graeme Stroud:
Computing Realistic Terrains from Imprecise Elevations. Comput. Geom. Topol. 2(2): 3:1-3:18 (2023) - Manfred Scheucher:
A SAT Attack on Erdős-Szekeres Numbers in Rd and the Empty Hexagon Theorem. Comput. Geom. Topol. 2(1): 2:1-2:13 (2023) - Mario Szegedy, Jingjin Yu:
An Initial Study of Budgeted Steiner Networks. Comput. Geom. Topol. 2(2): 4:1-4:13 (2023) - Giovanni Viglietta:
A Theory of Spherical Diagrams. Comput. Geom. Topol. 2(2): 2:1-2:24 (2023) - 2022
- Ahmad Biniaz, Anil Maheshwari, Michiel Smid:
Approximating Bottleneck Spanning Trees on Partitioned Tuples of Points. Comput. Geom. Topol. 1(1): 3:1-3:18 (2022) - Justin Dallant, Patrick Schnider:
Efficiently Stabbing Convex Polygons and Variants of the Hadwiger-Debrunner (p, q)-Theorem. Comput. Geom. Topol. 1(1): 5:1-5:27 (2022) - Pantea Haghighatkhah, Wouter Meulemans, Bettina Speckmann, Jérôme Urhausen, Kevin Verbeek:
Obstructing Classification via Projection. Comput. Geom. Topol. 1(1): 2:1-2:21 (2022) - Kristóf Huszár:
On the Pathwidth of Hyperbolic 3-Manifolds. Comput. Geom. Topol. 1(1): 1:1-1:19 (2022) - Patrick Schnider:
The Complexity of Sharing a Pizza. Comput. Geom. Topol. 1(1): 4:1-4:19 (2022) - Éric Colin de Verdière, Thomas Magnard, Bojan Mohar:
Embedding Graphs into Two-Dimensional Simplicial Complexes. Comput. Geom. Topol. 1(1): 6:1-6:23 (2022)
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-11-20 14:15 CET 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