default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJesús García-López
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j12]Jesús García-López, Florin Manea, Victor Mitrana
:
Prefix-suffix duplication. J. Comput. Syst. Sci. 80(7): 1254-1265 (2014)- 2013
- [j11]Jesús García-López, Carlos M. Nicolás:
Planar Point Sets With Large Minimum Convex Decompositions. Graphs Comb. 29(5): 1347-1353 (2013)
2000 – 2009
- 2009
- [j10]Oswin Aichholzer, Jesús García-López, David Orden, Pedro Ramos:
New results on lower bounds for the number of (<=k)-facets. Eur. J. Comb. 30(7): 1568-1574 (2009) - [j9]Manuel Abellanas, Prosenjit Bose, Jesús García-López, Ferran Hurtado, Carlos M. Nicolás, Pedro Ramos:
On Structural and Graph Theoretic Properties of Higher Order Delaunay Graphs. Int. J. Comput. Geom. Appl. 19(6): 595-615 (2009) - 2007
- [j8]Oswin Aichholzer, Jesús García-López, David Orden, Pedro Ramos:
New Lower Bounds for the Number of (<=k)-Edges and the Rectilinear Crossing Number of Kn. Discret. Comput. Geom. 38(1): 1-14 (2007) - [j7]Oswin Aichholzer, Jesús García-López, David Orden, Pedro Ramos:
New results on lower bounds for the number of (k)-facets: (extended abstract). Electron. Notes Discret. Math. 29: 189-193 (2007) - 2005
- [i1]Manuel Abellanas, Prosenjit Bose, Jesús García-López, Ferran Hurtado, Mariano Nicolás, Pedro A. Ramos:
On properties of higher-order Delaunay graphs with applications. EuroCG 2005: 119-122 - 2000
- [j6]Jesus Garcia-Lopez, Pedro A. Ramos:
A Unified Approach to Conic Visibility. Algorithmica 28(3): 307-322 (2000)
1990 – 1999
- 1999
- [j5]Manuel Abellanas, Jesus Garcia-Lopez, Gregorio Hernández-Peñalver, Marc Noy, Pedro A. Ramos:
Bipartite Embeddings of Trees in the Plane. Discret. Appl. Math. 93(2-3): 141-148 (1999) - 1998
- [j4]Jesus Garcia-Lopez, Pedro A. Ramos, Jack Snoeyink:
Fitting a Set of Points by a Circle. Discret. Comput. Geom. 20(3): 389-402 (1998) - [c6]Jesus Garcia-Lopez, Pedro A. Ramos:
Shortest paths and visibility inside triangulated curved polygons with applications to conic visibility. CCCG 1998 - 1997
- [j3]Boudewijn Asberg, Gregoria Blanco, Prosenjit Bose, Jesus Garcia-Lopez, Mark H. Overmars, Godfried T. Toussaint, Gordon T. Wilfong, Binhai Zhu:
Feasibility of Design in Stereolithography. Algorithmica 19(1/2): 61-83 (1997) - [c5]Jesus Garcia-Lopez, Pedro A. Ramos:
Fitting a Set of Points by a Circle. SCG 1997: 139-146 - 1996
- [j2]Manuel Abellanas, Jesus Garcia-Lopez, Gregorio Hernández-Peñalver, Ferran Hurtado, Oriol Serra, Jorge Urrutia:
Onion Polygonizations. Inf. Process. Lett. 57(3): 165-173 (1996) - [c4]Manuel Abellanas, Jesus Garcia-Lopez, Gregorio Hernández-Peñalver, Marc Noy, Pedro A. Ramos:
Bipartite Embeddings of Trees in the Plane. GD 1996: 1-10 - 1994
- [c3]Manuel Abellanas, Jesus Garcia-Lopez, Ferran Hurtado:
Consecutive Guards. CCCG 1994: 393-398 - 1993
- [j1]Manuel Abellanas, Jesus Garcia-Lopez, Gregorio Hernández-Peñalver, Ferran Hurtado, Oriol Serra, Jorge Urrutia:
Updating Polygonizations. Comput. Graph. Forum 12(3): 143-152 (1993) - [c2]Jesus Garcia-Lopez, Pedro Ramos-Alonso:
Circular Visibility and Separability. CCCG 1993: 18-23 - [c1]Boudewijn Asberg, Gregoria Blanco, Prosenjit Bose, Jesus Garcia-Lopez, Mark H. Overmars, Godfried T. Toussaint, Gordon T. Wilfong, Binhai Zhu:
Feasability of Design in Stereolithography. FSTTCS 1993: 228-237
Coauthor Index
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.
last updated on 2025-01-21 00:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
