Остановите войну!
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 827 matches
- 2023
- Abderrazzak Benroummane:
Some Results on Semi-Symmetric Spaces. Int. J. Comput. Geom. Appl. 33(3&4): 65-84 (2023) - Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal:
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set. Int. J. Comput. Geom. Appl. 33(1&2): 25-41 (2023) - Travis Gagie, Mozhgan Saeidi, Allan Sapucaia:
Ruler Wrapping. Int. J. Comput. Geom. Appl. 33(1&2): 3-12 (2023) - Wing-Kai Hon, Chung-Shou Liao, Meng-Tsung Tsai:
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 33(1&2): 1-2 (2023) - Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy:
Maximum Bipartite Subgraphs of Geometric Intersection Graphs. Int. J. Comput. Geom. Appl. 33(3&4): 133-157 (2023) - Sergey Korotov, Jon Eivind Vatne:
On Dihedral Angle Sums of Prisms and Hexahedra. Int. J. Comput. Geom. Appl. 33(3&4): 85-95 (2023) - Kuo-Kai Lee, Wing-Kai Hon, Chung-Shou Liao, Kunihiko Sadakane, Meng-Tsung Tsai:
Fully Dynamic No-Back-Edge-Traversal Forest via 2D-Range Queries. Int. J. Comput. Geom. Appl. 33(1&2): 43-54 (2023) - Shin-Ichi Nakano:
The Coverage Problem by Aligned Disks. Int. J. Comput. Geom. Appl. 33(1&2): 13-23 (2023) - Kazuma Tateiri:
Efficient Exact Enumeration of Single-Source Geodesics on a Non-Convex Polyhedron. Int. J. Comput. Geom. Appl. 33(3&4): 97-132 (2023) - Chao Yang:
Tiling the Plane with a Set of Ten Polyominoes. Int. J. Comput. Geom. Appl. 33(3&4): 55-64 (2023) - 2022
- Henry Adams, Sophia Coldren, Sean Willmot:
The Persistent Homology of Cyclic Graphs. Int. J. Comput. Geom. Appl. 32(1&2): 1-37 (2022) - Sukanya Bhattacharjee, R. Inkulu:
Vertex Fault-Tolerant Geometric Spanners for Weighted Points. Int. J. Comput. Geom. Appl. 32(3&4): 175-199 (2022) - Brittany Terese Fasy, Rafal Komendarczyk, Sushovan Majhi, Carola Wenk:
On the Reconstruction of Geodesic Subspaces of ℝN. Int. J. Comput. Geom. Appl. 32(1&2): 91-117 (2022) - Vincent Guigues:
Algorithms and a Library for the Exact Computation of the Cumulative Distribution Function of the Euclidean Distance Between a Point and a Random Variable Uniformly Distributed in Disks, Balls, or Polygones and Application to Probabilistic Seismic Hazard Analysis. Int. J. Comput. Geom. Appl. 32(3&4): 119-174 (2022) - Jiawei Huang, Ruizhe Qin, Fan Yang, Hu Ding:
Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers. Int. J. Comput. Geom. Appl. 32(3&4): 201-225 (2022) - Victor Milenkovic, Elisha Sacks:
Efficient Predicate Evaluation Using Randomized Degeneracy Detection. Int. J. Comput. Geom. Appl. 32(1&2): 39-54 (2022) - Christopher G. Provatidis:
Non-Rational and Rational Transfinite Interpolation Using Bernstein Polynomials. Int. J. Comput. Geom. Appl. 32(1&2): 55-89 (2022) - 2021
- Debangshu Banerjee, R. Inkulu:
Vertex Guarding for Dynamic Orthogonal Art Galleries. Int. J. Comput. Geom. Appl. 31(2-3): 123-140 (2021) - Václav Blazj, Jirí Fiala, Giuseppe Liotta:
On Edge-Length Ratios of Partial 2-Trees. Int. J. Comput. Geom. Appl. 31(2-3): 141-162 (2021) - Rivka Gitik, Leo Joskowicz:
Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties. Int. J. Comput. Geom. Appl. 31(2-3): 75-121 (2021) - Prashant Gupta, Yiran Guo, Narasimha Boddeti, Bala Krishnamoorthy:
SFCDecomp: Multicriteria Optimized Tool Path Planning in 3D Printing using Space-Filling Curve Based Domain Decomposition. Int. J. Comput. Geom. Appl. 31(4): 193-220 (2021) - Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen:
What Graphs are 2-Dot Product Graphs? Int. J. Comput. Geom. Appl. 31(1): 1-16 (2021) - Sergey Korotov, Lars Fredrik Lund, Jon Eivind Vatne:
Improved Maximum Angle Estimate for Longest-Edge Bisection. Int. J. Comput. Geom. Appl. 31(4): 183-192 (2021) - Hédi Nabli:
Truchet Tiles and Combinatorial Arabesque. Int. J. Comput. Geom. Appl. 31(1): 17-37 (2021) - Alexander Stoimenow:
Exchangeability and Non-Conjugacy of Braid Representatives. Int. J. Comput. Geom. Appl. 31(1): 39-73 (2021) - Kazuma Tateiri, Toru Ohmoto:
An Extended MMP Algorithm: Wavefront and Cut-Locus on a Convex Polyhedron. Int. J. Comput. Geom. Appl. 31(4): 221-247 (2021) - Haohao Wang, Ron Goldman:
Ruled Surfaces of Revolution with Moving Axes and Angles. Int. J. Comput. Geom. Appl. 31(2-3): 163-181 (2021) - 2020
- Haitao Wang, Yiming Zhao:
A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space. Int. J. Comput. Geom. Appl. 30(3&4): 167-182 (2020) - Prosenjit Bose, Stephane Durocher, Debajyoti Mondal, Maxime Peabody, Matthew Skala, Mohammad Abdul Wahid:
Local Routing in Convex Subdivisions. Int. J. Comput. Geom. Appl. 30(1): 1-17 (2020) - Binayak Dutta, Sasanka Roy:
Approximate Shortest Paths in Polygons with Violations. Int. J. Comput. Geom. Appl. 30(1): 79-95 (2020)
skipping 797 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-08-26 05: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