![](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 27 matches
- 2012
- Alberto Márquez, Pedro Ramos, Jorge Urrutia:
Computational Geometry - XIV Spanish Meeting on Computational Geometry, EGC 2011, Dedicated to Ferran Hurtado on the Occasion of His 60th Birthday, Alcalá de Henares, Spain, June 27-30, 2011, Revised Selected Papers. Lecture Notes in Computer Science 7579, Springer 2012, ISBN 978-3-642-34190-8 [contents] - 2011
- Manuel Abellanas, António Leslie Bajuelos, Santiago Canales, Mercè Claverol
, Gregorio Hernández-Peñalver
, Inês Matos:
Connecting Red Cells in a Bicolour Voronoi Diagram. EGC 2011: 210-219 - Oswin Aichholzer, Mario Cetina, Ruy Fabila Monroy, Jesús Leaños, Gelasio Salazar, Jorge Urrutia:
Convexifying Monotone Polygons while Maintaining Internal Visibility. EGC 2011: 98-108 - Oswin Aichholzer, Thomas Hackl, Birgit Vogtenhuber:
On 5-Gons and 5-Holes. EGC 2011: 1-13 - Jin Akiyama, Ikuro Sato, Hyunwoo Seong:
On Reversibility among Parallelohedra. EGC 2011: 14-28 - Carlos Alegría-Galicia, Tzolkin Garduño, Areli Rosas-Navarrete, Carlos Seara, Jorge Urrutia:
Rectilinear Convex Hull with Minimum Area. EGC 2011: 226-235 - Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, John Iacono
:
Meshes Preserving Minimum Feature Size. EGC 2011: 258-273 - Patrizio Angelini
, Giuseppe Di Battista
, Walter Didimo, Fabrizio Frati
, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta
, Anna Lubiw:
Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area. EGC 2011: 200-209 - Prosenjit Bose
, Sander Verdonschot:
A History of Flips in Combinatorial Triangulations. EGC 2011: 29-44 - José Cáceres, Carmen Cortés
, Clara Isabel Grima
, Masahiro Hachimori
, Alberto Márquez
, Raiji Mukae, Atsuhiro Nakamoto
, Seiya Negami
, Rafael Robles
, Jesus Valenzuela
:
Compact Grid Representation of Graphs. EGC 2011: 166-174 - Erik D. Demaine, Anna Lubiw:
A Generalization of the Source Unfolding of Convex Polyhedra. EGC 2011: 185-199 - José Miguel Díaz-Báñez
, Matias Korman, Pablo Pérez-Lantero, Inmaculada Ventura
:
Locating a Service Facility and a Rapid Transit Line. EGC 2011: 126-137 - José Miguel Díaz-Báñez
, Matias Korman, Pablo Pérez-Lantero, Inmaculada Ventura
:
The 1-Center and 1-Highway Problem. EGC 2011: 155-165 - José Miguel Díaz-Báñez
, Ruy Fabila Monroy, Pablo Pérez-Lantero:
On the Number of Radial Orderings of Colored Planar Point Sets. EGC 2011: 109-118 - Alfredo Garcia:
A Note on the Number of Empty Triangles. EGC 2011: 249-257 - Jin-ichi Itoh, Chie Nara, Costin Vîlcu:
Continuous Flattening of Convex Polyhedra. EGC 2011: 85-97 - Justin Iwerks, Joseph S. B. Mitchell:
Spiral Serpentine Polygonization of a Planar Point Set. EGC 2011: 146-154 - Mikio Kano, Kazuhiro Suzuki:
Geometric Graphs in the Plane Lattice. EGC 2011: 274-281 - Viola Mészáros:
Separated Matchings and Small Discrepancy Colorings. EGC 2011: 236-248 - Ruy Fabila Monroy, Clemens Huemer
:
Covering Islands in Plane Point Sets. EGC 2011: 220-225 - Ruy Fabila Monroy, David R. Wood
:
The Chromatic Number of the Convex Segment Disjointness Graph. EGC 2011: 79-84 - Joseph O'Rourke:
String-Wrapped Rotating Disks. EGC 2011: 65-78 - Elsa Omaña-Pulido, Eduardo Rivera-Campo:
Notes on the Twisted Graph. EGC 2011: 119-125 - János Pach, Rados Radoicic, Géza Tóth:
Tangled Thrackles. EGC 2011: 45-53 - Toshinori Sakai, Jorge Urrutia:
On the Heaviest Increasing or Decreasing Subsequence of a Permutation, and Paths and Matchings on Weighted Point Sets. EGC 2011: 175-184 - Diane L. Souvaine, Csaba D. Tóth, Andrew Winslow:
Simultaneously Flippable Edges in Triangulations. EGC 2011: 138-145 - Csaba D. Tóth, Godfried T. Toussaint, Andrew Winslow:
Open Guard Edges and Edge Guards in Simple Polygons. EGC 2011: 54-64
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-07-17 03:56 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