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 29 matches
- 2000
- Jin Akiyama, Mikio Kano, Masatsugu Urabe:
Discrete and Computational Geometry, Japanese Conference, JCDCG'98, Tokyo, Japan, December 9-12, 1998, Revised Papers. Lecture Notes in Computer Science 1763, Springer 2000, ISBN 3-540-67181-1 [contents] - 1998
- Jin Akiyama, Atsushi Kaneko, Mikio Kano, Gisaku Nakamura, Eduardo Rivera-Campo, Shin-ichi Tokunaga, Jorge Urrutia:
Radial Perfect Partitions of Convex Sets in the Plane. JCDCG 1998: 1-13 - Jin Akiyama, Gisaku Nakamura:
Dudeney Dissection of Polygons. JCDCG 1998: 14-29 - Tetsuo Asano:
Effective Use of Geometric Properties for Clustering. JCDCG 1998: 30-46 - David Avis:
Living with lrs. JCDCG 1998: 47-56 - David Avis, Kiyoshi Hosono, Masatsugu Urabe:
On the Existence of a Point Subset with 4 or 5 Interior Points. JCDCG 1998: 57-64 - Ala Eddine Barouni, Ali Jaoua, Nejib Zaguia:
Planar Drawing Algorithms of Survivable Telecommunication Networks. JCDCG 1998: 65-80 - Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari:
Polygon Cutting: Revisited. JCDCG 1998: 81-92 - Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Anil Maheshwari:
Algorithms for Packing Two Circles in a Convex Polygon. JCDCG 1998: 93-103 - Erik D. Demaine, Martin L. Demaine, Anna Lubiw:
Folding and Cutting Paper. JCDCG 1998: 104-118 - Hisamoto Hiyoshi, Kokichi Sugihara:
An Interpolant Based on Line Segment Voronoi Diagrams. JCDCG 1998: 119-128 - Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama:
2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces. JCDCG 1998: 129-157 - Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama:
NP-Completeness of Stage Illumination Problems. JCDCG 1998: 158-165 - Atsushi Kaneko:
On the Maximum Degree of Bipartite Embeddings of Trees in the Plane. JCDCG 1998: 166-171 - Evangelos Kranakis, Danny Krizanc, Jorge Urrutia:
Efficient Regular Polygon Dissections. JCDCG 1998: 172-187 - Hiroshi Maehara, Ai Oshiro:
On Soddy's Hexlet and a Linked 4-Pair. JCDCG 1998: 188-193 - Tomomi Matsui:
Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs. JCDCG 1998: 194-200 - Nobuaki Mutoh, Gisaku Nakamura:
Visibility of Disks on the Lattice Points. JCDCG 1998: 201-206 - Takayuki Nagai, Seigo Yasutome, Nobuki Tokura:
Convex Hull Problem with Imprecise Input. JCDCG 1998: 207-219 - Tomoki Nakamigawa:
One-Dimensional Tilings with Congruent Copies of a 3-Point Set. JCDCG 1998: 220-234 - Manuela Neagu:
Polygonal Approximations for Curved Problems: An Application to Arrangements. JCDCG 1998: 235-249 - Frank Nielsen:
Grouping and Querying: A Paradigm to Get Output-Sensitive Algorithms. JCDCG 1998: 250-257 - Joseph O'Rourke:
Folding and Unfolding in Computational Geometry. JCDCG 1998: 258-266 - János Pach:
Crossing Numbers. JCDCG 1998: 267-273 - Eduardo Rivera-Campo:
A Note on the Existence of Plane Spanning Trees of Geometric Graphs. JCDCG 1998: 274-277 - Toshinori Sakai:
Embeddings of Equilateral Polygons in Unit Lattices. JCDCG 1998: 278-289 - Dominique Schmitt, Jean-Claude Spehner:
Order-k Voronoi Diagrams, k-Sections, and k-Sets. JCDCG 1998: 290-304 - Kokichi Sugihara:
"Impossible Objects" Are Not Necessarily Impossible - Mathematical Study on Optical Illusion. JCDCG 1998: 305-316 - Xuehou Tan:
An Efficient Solution to the Corridor Search Problem. JCDCG 1998: 317-331
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-10-13 20:01 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