default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJuan Gutiérrez 0001
Person information
- affiliation: UTEC, Universidad de Ingeniería y Tecnología, Departament of Science and Computer Science, Barranco, Peru
- affiliation: Universidade Federal do Rio de Janeiro, COPPE Sistemas e Instituto de Matemática, Brazil
Other persons with the same name
- Juan Gutiérrez (aka: Juan Gutierrez) — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j8]Fábio Botler, Cristina G. Fernandes, Juan Gutiérrez:
Independent Dominating Sets in Planar Triangulations. Electron. J. Comb. 31(2) (2024)- [j7]Juan Gutiérrez
, Christian Valqui:
On two conjectures about the intersection of longest paths and cycles. Discret. Math. 347(1): 114148 (2024) - 2023
- [j6]Renzo Gómez, Juan Gutiérrez:
Path eccentricity of graphs. Discret. Appl. Math. 337: 1-13 (2023) - [j5]Juan Gutiérrez:
All longest cycles in a 2-connected partial 3-tree share a common vertex. J. Graph Theory 103(4): 690-712 (2023) - 2021
- [j4]Fábio Botler, Cristina G. Fernandes, Juan Gutiérrez:
On Tuza's conjecture for triangulations and graphs with small treewidth. Discret. Math. 344(4): 112281 (2021) - [j3]Juan Gutiérrez:
Transversals of longest cycles in partial k-trees and chordal graphs. J. Graph Theory 98(4): 589-603 (2021) - 2020
- [j2]Márcia R. Cerioli, Cristina G. Fernandes, Renzo Gómez, Juan Gutiérrez, Paloma T. Lima:
Transversals of longest paths. Discret. Math. 343(3): 111717 (2020) - 2017
- [j1]Márcia R. Cerioli, Cristina G. Fernandes, Renzo Gómez, Juan Gutiérrez, Paloma T. Lima:
Transversals of Longest Paths. Electron. Notes Discret. Math. 62: 135-140 (2017)
Conference and Workshop Papers
- 2019
- [c2]Fábio Botler, Cristina G. Fernandes, Juan Gutiérrez:
On Tuza's Conjecture for Triangulations and Graphs with Small Treewidth. LAGOS 2019: 171-183 - 2018
- [c1]Juan Gutiérrez:
Transversals of Longest Cycles in Chordal and Bounded Tree-Width Graphs. LATIN 2018: 558-571
Informal and Other Publications
- 2024
- [i8]Renzo Gómez, Juan Gutiérrez:
Domination and packing in graphs. CoRR abs/2402.05088 (2024) - 2023
- [i7]Fábio Botler, Cristina G. Fernandes, Juan Gutiérrez:
Independent dominating sets in planar triangulations. CoRR abs/2308.02754 (2023) - [i6]Juan Gutiérrez, Christian Valqui:
On two conjectures about the intersection of longest paths and cycles. CoRR abs/2310.03849 (2023) - 2022
- [i5]Renzo Gómez, Juan Gutiérrez:
Path eccentricity of graphs. CoRR abs/2202.02599 (2022) - 2021
- [i4]Juan Gutiérrez:
All longest cycles intersect in partial 3-trees. CoRR abs/2103.05186 (2021) - 2020
- [i3]Fábio Botler, Cristina G. Fernandes, Juan Gutiérrez:
On Tuza's conjecture for triangulations and graphs with small treewidth. CoRR abs/2002.07925 (2020) - 2019
- [i2]Juan Gutiérrez:
Transversals of Longest Cycles in Partial k-Trees and Chordal Graphs. CoRR abs/1912.12230 (2019) - 2017
- [i1]Márcia R. Cerioli, Cristina G. Fernandes, Renzo Gómez, Juan Gutiérrez, Paloma T. Lima:
Transversals of Longest Paths. CoRR abs/1712.07086 (2017)
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-07 20:28 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:
