default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHernán G. Abeledo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c6]Janiele Custodio, Hernán G. Abeledo:
Drone Network Design for Environmental Emergency Response in the Brazilian Amazon. ICT-DM 2023: 1-6
2010 – 2019
- 2014
- [j9]Hongliang Ren
, Enrique Campos-Náñez, Ziv Yaniv, Filip Banovac, Hernán G. Abeledo, Nobuhiko Hata, Kevin Cleary:
Treatment Planning and Image Guidance for Radiofrequency Ablation of Large Tumors. IEEE J. Biomed. Health Informatics 18(3): 920-928 (2014) - 2013
- [j8]Hernán G. Abeledo, Ricardo Fukasawa, Artur Alves Pessoa, Eduardo Uchoa:
The time dependent traveling salesman problem: polyhedra and algorithm. Math. Program. Comput. 5(1): 27-55 (2013) - 2010
- [j7]Hernán G. Abeledo, Gary W. Atkinson:
A min-max theorem for plane bipartite graphs. Discret. Appl. Math. 158(5): 375-378 (2010) - [j6]Fernanda Menezes, Oscar Porto, Marcelo L. Reis, Lorenza Moreno, Marcus Poggi de Aragão, Eduardo Uchoa, Hernán G. Abeledo, Nelci Carvalho do Nascimento:
Optimizing Helicopter Transport of Oil Rig Crews at Petrobras. Interfaces 40(5): 408-416 (2010) - [j5]Ziv Yaniv, Patrick Cheng, Emmanuel Wilson, Teo Popa, David Lindisch, Enrique Campos-Náñez, Hernán G. Abeledo, Vance Watson, Kevin Cleary, Filip Banovac:
Needle-Based Interventions With the Image-Guided Surgery Toolkit (IGSTK): From Phantoms to Clinical Trials. IEEE Trans. Biomed. Eng. 57(4): 922-933 (2010) - [c5]Hernán G. Abeledo, Ricardo Fukasawa, Artur Alves Pessoa, Eduardo Uchoa:
The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm. SEA 2010: 202-213
2000 – 2009
- 2007
- [j4]Hua Ni, Hernán G. Abeledo:
A branch-and-price approach for large-scale employee tour scheduling problems. Ann. Oper. Res. 155(1): 167-176 (2007) - [c4]Hui Zhang, Filip Banovac, Stella Munuo, Enrique Campos-Náñez, Hernán G. Abeledo, Kevin Cleary:
Treatment planning and image guidance for radiofrequency ablation of liver tumors. Image-Guided Procedures 2007: 650922 - 2006
- [j3]Khaled Salem, Hernán G. Abeledo:
Hypergraphs and the Clar problem in hexagonal systems. Discret. Optim. 3(4): 392-397 (2006) - [c3]Junko Sekine, Enrique Campos-Náñez, John R. Harrald, Hernán G. Abeledo:
A simulation-based approach to trade-off analysis of port security. WSC 2006: 521-528
1990 – 1999
- 1998
- [c2]Hernán G. Abeledo, Gary W. Atkinson:
The Clar and Fries problems for benzenoid hydrocarbons are linear programs. Discrete Mathematical Chemistry 1998: 1-8 - [c1]Hernán G. Abeledo, Gary W. Atkinson:
Polyhedral Combinatorics of Benzenoid Problems. IPCO 1998: 202-212 - 1995
- [j2]Hernán G. Abeledo, Uriel G. Rothblum:
Paths to Marriage Stability. Discret. Appl. Math. 63(1): 1-12 (1995) - 1994
- [j1]Hernán G. Abeledo, Uriel G. Rothblum:
Stable Matchings and Linear Inequalities. Discret. Appl. Math. 54(1): 1-27 (1994)
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-11-28 20:30 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:
