Остановите войну!
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
- 2023
- Nancy Abdallah, Hal Schenck:
Nets in $\mathbb {P}2$ and Alexander Duality. Discret. Comput. Geom. 70(4): 1840-1861 (2023) - Ranendu Adhikary, Kaustav Bose, Satwik Mukherjee, Bodhayan Roy:
Complexity of Maximum Cut on Interval Graphs. Discret. Comput. Geom. 70(2): 307-322 (2023) - Jerome Alex, Karsten Große-Brauckmann:
Periodic Steiner Networks Minimizing Length. Discret. Comput. Geom. 70(4): 1145-1168 (2023) - Víctor Hugo Almendra-Hernández, Gergely Ambrus, Matthew Kendall:
Quantitative Helly-Type Theorems via Sparse Approximation. Discret. Comput. Geom. 70(4): 1707-1714 (2023) - Paolo Amore, Tenoch Morales:
Efficient Algorithms for the Dense Packing of Congruent Circles Inside a Square. Discret. Comput. Geom. 70(1): 249-267 (2023) - Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Vincenzo Roselli:
Morphing Triangle Contact Representations of Triangulations. Discret. Comput. Geom. 70(3): 991-1024 (2023) - C. J. Argue, Anupam Gupta, Marco Molinaro:
Lipschitz Selectors May Not Yield Competitive Algorithms for Convex Body Chasing. Discret. Comput. Geom. 70(3): 773-789 (2023) - Lukas Barth, Benjamin Niedermann, Ignaz Rutter, Matthias Wolf:
A Topology-Shape-Metrics Framework for Ortho-Radial Graph Drawing. Discret. Comput. Geom. 70(4): 1292-1355 (2023) - Helena Bergold, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner:
Topological Drawings Meet Classical Theorems from Convex Geometry. Discret. Comput. Geom. 70(3): 1121-1143 (2023) - Christian Bingane:
Tight Bounds on the Maximal Area of Small Polygons: Improved Mossinghoff Polygons. Discret. Comput. Geom. 70(1): 236-248 (2023) - Christopher J. Bishop:
Uniformly Acute Triangulations of PSLGs. Discret. Comput. Geom. 70(3): 1090-1120 (2023) - Christopher J. Bishop:
Uniformly Acute Triangulations of Polygons. Discret. Comput. Geom. 70(4): 1571-1592 (2023) - Alexander E. Black, Jesús A. De Loera:
Monotone Paths on Cross-Polytopes. Discret. Comput. Geom. 70(4): 1245-1265 (2023) - Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, Michiel Smid:
Improved Routing on the Delaunay Triangulation. Discret. Comput. Geom. 70(3): 495-549 (2023) - Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer:
Maximum Matchings in Geometric Intersection Graphs. Discret. Comput. Geom. 70(3): 550-579 (2023) - Florestan Brunck:
Iterated Medial Triangle Subdivision in Surfaces of Constant Curvature. Discret. Comput. Geom. 70(3): 1059-1089 (2023) - David Bryant, Katharina T. Huber, Vincent Moulton, Paul F. Tupper:
Diversities and the Generalized Circumradius. Discret. Comput. Geom. 70(4): 1862-1883 (2023) - Taylor Brysiewicz, Holger Eble, Lukas Kühne:
Computing Characteristic Polynomials of Hyperplane Arrangements with Symmetries. Discret. Comput. Geom. 70(4): 1356-1377 (2023) - Kevin Buchin, Éric Colin de Verdière:
Guest Editors' Foreword. Discret. Comput. Geom. 70(2): 305-306 (2023) - Christian Buchta:
The Duality of the Volumes and the Numbers of Vertices of Random Polytopes. Discret. Comput. Geom. 70(3): 951-959 (2023) - Paz Carmi, Matthew J. Katz, Pat Morin:
Stabbing Pairwise Intersecting Disks by Four Points. Discret. Comput. Geom. 70(4): 1751-1784 (2023) - Debsoumya Chakraborti, Jaehoon Kim, Jinha Kim, Minki Kim, Hong Liu:
Fractional Helly Theorem for Cartesian Products of Convex Sets. Discret. Comput. Geom. 70(4): 1632-1651 (2023) - Erin Wolf Chambers, Francis Lazarus, Arnaud de Mesmay, Salman Parsa:
Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries. Discret. Comput. Geom. 70(2): 323-354 (2023) - Timothy M. Chan:
Faster Algorithms for Largest Empty Rectangles and Boxes. Discret. Comput. Geom. 70(2): 355-375 (2023) - David Cohen-Steiner, André Lieutier, Julien Vuillamy:
Delaunay and Regular Triangulations as Lexicographic Optimal Chains. Discret. Comput. Geom. 70(1): 1-50 (2023) - David Conlon, Jeck Lim:
Fixing a Hole. Discret. Comput. Geom. 70(4): 1551-1570 (2023) - René Corbet, Michael Kerber, Michael Lesnick, Georg Osang:
Computing the Multicover Bifiltration. Discret. Comput. Geom. 70(2): 376-405 (2023) - Gabe Cunningham, Daniel Pellicer:
Finite 3-Orbit Polyhedra in Ordinary Space I. Discret. Comput. Geom. 70(4): 1785-1819 (2023) - Rafael S. González D'León, Christopher R. H. Hanusa, Alejandro H. Morales, Martha Yip:
Column-Convex Matrices, G-Cyclic Orders, and Flow Polytopes. Discret. Comput. Geom. 70(4): 1593-1631 (2023) - James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak:
Grounded L-Graphs Are Polynomially χ-Bounded. Discret. Comput. Geom. 70(4): 1523-1550 (2023)
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-06-12 10:59 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