![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 30 matches
- 2003
- Jin Akiyama, Mikio Kano:
Discrete and Computational Geometry, Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers. Lecture Notes in Computer Science 2866, Springer 2003, ISBN 3-540-20776-7 [contents] - 2002
- Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia, Jorge Urrutia:
Playing with Triangulations. JCDCG 2002: 22-37 - Jin Akiyama, Hiroshi Fukuda, Gisaku Nakamura:
Universal Measuring Devices with Rectangular Base. JCDCG 2002: 1-8 - Jin Akiyama, Rika Mochizuki, Nobuaki Mutoh, Gisaku Nakamura:
Maximin Distance for n Points in a Unit Square or a Unit Circle. JCDCG 2002: 9-13 - Jin Akiyama, Gisaku Nakamura:
Congruent Dudeney Dissections of Polygons: All the Hinge Points on Vertices of the Polygon. JCDCG 2002: 14-21 - Rebecca Alexander, Heather Dyson, Joseph O'Rourke:
The Foldings of a Square to Convex Polyhedra. JCDCG 2002: 38-50 - David Avis:
On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities. JCDCG 2002: 51-59 - Sergei Bespamyatnikh:
On Partitioning a Cake. JCDCG 2002: 60-71 - Sergei Bespamyatnikh, David G. Kirkpatrick:
Constrained Equitable 3-Cuttings. JCDCG 2002: 72-83 - Binay K. Bhattacharya, Asish Mukhopadhyay:
On the Minimum Perimeter Triangle Enclosing a Convex Polygon. JCDCG 2002: 84-96 - Prosenjit Bose, Luc Devroye, Pat Morin
:
Succinct Data Structures for Approximating Convex Functions with Applications. JCDCG 2002: 97-107 - Jinhee Chun, Kunihiko Sadakane
, Takeshi Tokuyama
:
Efficient Algorithms for Constructing a Pyramid from a Terrain. JCDCG 2002: 108-117 - Antoine Deza, Komei Fukuda, Tomohiko Mizutani, Cong Vo:
On the Face Lattice of the Metric Polytope. JCDCG 2002: 118-128 - Ren Ding, Kiyoshi Hosono, Masatsugu Urabe, Changqing Xu:
Partitioning a Planar Point Set into Empty Convex Polygons. JCDCG 2002: 129-134 - Herbert Edelsbrunner, Alper Üngör:
Relaxed Scheduling in Dynamic Skin Triangulation. JCDCG 2002: 135-151 - Thomas Fevens:
A Note on Point Subsets with a Specified Number of Interior Points. JCDCG 2002: 152-158 - Greg N. Frederickson:
Piano-Hinged Dissections: Now Let's Fold! JCDCG 2002: 159-171 - Mordecai J. Golin
, Stefan Langerman, William L. Steiger:
The Convex Hull for Random Lines in the Plane. JCDCG 2002: 172-175 - Hiro Ito, Hiroshi Nagamochi:
Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon. JCDCG 2002: 176-181 - Yoshiyuki Kusakari:
On Reconfiguring Radial Trees. JCDCG 2002: 182-191 - Yoichi Maeda:
Viewing Cube and Its Visual Angles. JCDCG 2002: 192-199 - Yoichi Maeda, Hiroshi Maehara:
Observing an Angle from Various Viewpoints. JCDCG 2002: 200-203 - Nobuaki Mutoh:
The Polyhedra of Maximal Volume Inscribed in the Unit Sphere and of Minimal Volume Circumscribed about the Unit Sphere. JCDCG 2002: 204-214 - Chie Nara, Toshinori Sakai, Jorge Urrutia:
Maximal Number of Edges in Geometric Graphs without Convex Polygons. JCDCG 2002: 215-220 - János Pach, Rados Radoicic, Géza Tóth:
Relaxing Planarity for Topological Graphs. JCDCG 2002: 221-232 - Rom Pinchasi:
On the Size of a Radial Set. JCDCG 2002: 233-245 - David Rappaport:
Tight Bounds for Visibility Matching of f-Equal Width Objects. JCDCG 2002: 246-250 - Toshinori Sakai:
Long Paths through Specified Vertices in 3-Connected Graphs. JCDCG 2002: 251-260 - Kazuhiro Suzuki:
On the Number of Intersections of Three Monochromatic Trees in the Plane. JCDCG 2002: 261-272 - Godfried T. Toussaint:
Open Problems in Geometric Methods for Instance-Based Learning. JCDCG 2002: 273-283
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-20 13:41 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