default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuillermo Esteban
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Prosenjit Bose, Guillermo Esteban
, Anil Maheshwari:
A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes. Theor. Comput. Sci. 1001: 114583 (2024)- [i5]Sarita de Berg, Guillermo Esteban, Rodrigo I. Silveira, Frank Staals:
Exact solutions to the Weighted Region Problem. CoRR abs/2402.12028 (2024) - [i4]Prosenjit Bose, Guillermo Esteban, David Orden, Rodrigo I. Silveira:
Approximating shortest paths in weighted square and hexagonal meshes. CoRR abs/2404.07562 (2024) - [i3]Prosenjit Bose, Jean-Lou De Carufel, Guillermo Esteban, Anil Maheshwari:
Computing shortest paths amid non-overlapping weighted disks. CoRR abs/2409.08869 (2024) - 2023
- [j5]Prosenjit Bose, Guillermo Esteban, David Orden, Rodrigo I. Silveira:
On approximating shortest paths in weighted triangular tessellations. Artif. Intell. 318: 103898 (2023) - [c7]Guillermo Esteban, Dan Halperin, Víctor Ruíz, Vera Sacristán, Rodrigo I. Silveira:
Shortest Coordinated Motion for Square Robots. WADS 2023: 430-443 - 2022
- [j4]Gi-Sang Cheon, Hong Joon Choi, Guillermo Esteban, Minho Song:
Enumeration of bipartite non-crossing geometric graphs. Discret. Appl. Math. 317: 86-100 (2022) - [c6]Prosenjit Bose, Guillermo Esteban, Anil Maheshwari:
Weighted shortest path in equilateral triangular meshes. CCCG 2022: 60-67 - [c5]Prosenjit Bose, Guillermo Esteban, David Orden, Rodrigo I. Silveira:
On Approximating Shortest Paths in Weighted Triangular Tessellations. WALCOM 2022: 409-421 - 2021
- [i2]Prosenjit Bose, Guillermo Esteban, David Orden, Rodrigo I. Silveira:
On approximating shortest paths in weighted triangular tessellations. CoRR abs/2111.13912 (2021) - 2020
- [i1]Guillermo Esteban, Clemens Huemer, Rodrigo I. Silveira:
New production matrices for geometric graphs. CoRR abs/2003.00524 (2020)
2010 – 2019
- 2018
- [j3]Guillermo Esteban, Clemens Huemer, Rodrigo I. Silveira:
New results on production matrices for geometric graphs. Electron. Notes Discret. Math. 68: 215-220 (2018) - 2016
- [j2]José Félix Muñoz-Soro, Guillermo Esteban, Óscar Corcho, Francisco J. Serón:
PPROC, an ontology for transparency in public procurement. Semantic Web 7(3): 295-309 (2016) - 2015
- [c4]José Félix Muñoz, Guillermo Esteban:
Using the Semantic Web for the Integration and Publication of Public Procurement Data. EGOVIS 2015: 13-28 - 2014
- [c3]Carlos Bobed, Fernando Bobillo, Roberto Yus, Guillermo Esteban, Eduardo Mena:
Android Went Semantic: Time for Evaluation. ORE 2014: 23-29 - 2013
- [j1]Carlos Bobed, Guillermo Esteban, Eduardo Mena:
Enabling keyword search on Linked Data repositories: An ontology-based approach. Int. J. Knowl. Based Intell. Eng. Syst. 17(1): 67-77 (2013) - [c2]Roberto Yus, Carlos Bobed, Guillermo Esteban, Fernando Bobillo, Eduardo Mena:
Android goes Semantic: DL Reasoners on Smartphones. ORE 2013: 46-52 - 2012
- [c1]Carlos Bobed, Guillermo Esteban, Eduardo Mena:
Ontology-driven Keyword-based Search on Linked Data. KES 2012: 1899-1908
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 2024-10-15 00:27 CEST 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:
