default search action
Guilherme de C. M. Gomes
Person information
- affiliation: Universidade Federal de Minas Gerais, Belo Horizonte, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j10]Guilherme C. M. Gomes, Bruno Porto Masquio
, Paulo E. D. Pinto, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter:
Weighted connected matchings. Theor. Comput. Sci. 1036: 115149 (2025) - [i17]Emanuel Castelo, Oscar Defrain, Guilherme C. M. Gomes:
Enumerating minimal dominating sets and variants in chordal bipartite graphs. CoRR abs/2502.14611 (2025) - [i16]Guilherme C. M. Gomes, Raul Lopes, Ignasi Sau:
Revisiting Directed Disjoint Paths on tournaments (and relatives). CoRR abs/2504.19957 (2025) - 2024
- [j9]Guilherme C. M. Gomes
Minimum separator reconfiguration. J. Comput. Syst. Sci. 146: 103574 (2024) - [c14]Guilherme C. M. Gomes, Emanuel Juliano, Gabriel Martins, Vinícius Fernandes dos Santos:
Matching (Multi)Cut: Algorithms, Complexity, and Enumeration. IPEC 2024: 25:1-25:15 - [i15]Guilherme C. M. Gomes, Emanuel Juliano, Gabriel Martins, Vinícius Fernandes dos Santos:
Matching (Multi)Cut: Algorithms, Complexity, and Enumeration. CoRR abs/2407.02898 (2024) - [i14]Guilherme C. M. Gomes, Bruno Porto Masquio, Paulo E. D. Pinto, Dieter Rautenbach, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter, Florian Werner:
Complexity of Deciding the Equality of Matching Numbers. CoRR abs/2409.04855 (2024) - 2023
- [j8]Guilherme C. M. Gomes
Structural Parameterizations for Equitable Coloring: Complexity, FPT Algorithms, and Kernelization. Algorithmica 85(7): 1912-1947 (2023) - [j7]Guilherme C. M. Gomes, Bruno Porto Masquio
Disconnected matchings. Theor. Comput. Sci. 956: 113821 (2023) - [c13]Guilherme C. M. Gomes, Clément Legrand-Duchesne, Reem Mahmoud, Amer E. Mouawad, Yoshio Okamoto, Vinícius Fernandes dos Santos, Tom C. van der Zanden:
Minimum Separator Reconfiguration. IPEC 2023: 9:1-9:12 - [i13]Guilherme C. M. Gomes, Clément Legrand-Duchesne, Reem Mahmoud, Amer E. Mouawad, Yoshio Okamoto, Vinícius Fernandes dos Santos, Tom C. van der Zanden:
Minimum Separator Reconfiguration. CoRR abs/2307.07782 (2023) - 2022
- [j6]Rodrigo M. Silva, Guilherme C. M. Gomes, Mário S. Alvim
How to build high quality L2R training data: Unsupervised compression-based selective sampling for learning to rank. Inf. Sci. 601: 90-113 (2022) - [c12]Guilherme C. M. Gomes, Bruno Porto Masquio, Paulo E. D. Pinto, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter:
Weighted Connected Matchings. LATIN 2022: 54-70 - [i12]Guilherme C. M. Gomes, Bruno Porto Masquio, Paulo E. D. Pinto, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter:
Weighted Connected Matchings. CoRR abs/2202.04746 (2022) - 2021
- [j5]Guilherme de C. M. Gomes
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization. Algorithmica 83(6): 1677-1706 (2021) - [j4]Victor A. Campos, Guilherme de C. M. Gomes, Allen Ibiapina, Raul Lopes, Ignasi Sau
Coloring Problems on Bipartite Graphs of Small Diameter. Electron. J. Comb. 28(2): 2 (2021) - [c11]Guilherme de Castro Mendes Gomes
FPT and Kernelization Algorithms for the Induced Tree Problem. CIAC 2021: 158-172 - [c10]Guilherme de C. M. Gomes
Disconnected Matchings. COCOON 2021: 579-590 - [c9]Guilherme de C. M. Gomes, Vinícius Fernandes dos Santos:
Kernelization results for Equitable Coloring. LAGOS 2021: 59-67 - [c8]Márcia R. Cappelle, Guilherme C. M. Gomes, Vinícius Fernandes dos Santos:
Parameterized algorithms for locating-dominating sets. LAGOS 2021: 68-76 - [c7]Guilherme C. M. Gomes, Vinícius Fernandes dos Santos:
On structural parameterizations of the selective coloring problem. LAGOS 2021: 77-85 - [i11]Guilherme de C. M. Gomes, Bruno Porto Masquio, Paulo E. D. Pinto, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter:
Disconnected Matchings. CoRR abs/2112.09248 (2021) - 2020
- [j3]Guilherme de C. M. Gomes
Intersection graph of maximal stars. Discret. Appl. Math. 285: 567-580 (2020) - [c6]Guilherme de C. M. Gomes
Structural Parameterizations for Equitable Coloring. LATIN 2020: 129-140 - [i10]Guilherme de C. M. Gomes, Sérgio H. Nogueira, Vinícius Fernandes dos Santos:
Some results on Vertex Separator Reconfiguration. CoRR abs/2004.10873 (2020) - [i9]Victor A. Campos, Guilherme de C. M. Gomes, Allen Ibiapina, Raul Lopes, Ignasi Sau, Ana Silva:
Coloring Problems on Bipartite Graphs of Small Diameter. CoRR abs/2004.11173 (2020) - [i8]Guilherme de C. M. Gomes, Vinícius Fernandes dos Santos, Murilo V. G. da Silva, Jayme Luiz Szwarcfiter:
FPT and kernelization algorithms for the k-in-a-tree problem. CoRR abs/2007.04468 (2020) - [i7]Guilherme de C. M. Gomes, Vinícius Fernandes dos Santos:
On structural parameterizations of the selective coloring problem. CoRR abs/2011.14801 (2020) - [i6]Márcia R. Cappelle, Guilherme de C. M. Gomes, Vinícius Fernandes dos Santos:
Parameterized algorithms for locating-dominating sets. CoRR abs/2011.14849 (2020)
2010 – 2019
- 2019
- [j2]Guilherme de C. M. Gomes, Carlos V. G. C. Lima, Vinícius Fernandes dos Santos:
Parameterized Complexity of Equitable Coloring. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - [c5]Guilherme de C. M. Gomes
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization. IPEC 2019: 19:1-19:15 - [i5]Guilherme de C. M. Gomes, Ignasi Sau
Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization. CoRR abs/1905.03134 (2019) - [i4]Guilherme de C. M. Gomes, Matheus R. Guedes, Vinícius Fernandes dos Santos:
Structural Parameterizations for Equitable Coloring. CoRR abs/1911.03297 (2019) - [i3]Guilherme de C. M. Gomes, Marina Groshaus, Carlos V. G. C. Lima, Vinícius Fernandes dos Santos:
Intersection graph of maximal stars. CoRR abs/1911.10515 (2019) - 2018
- [i2]Guilherme de C. M. Gomes, Carlos V. G. C. Lima, Vinícius Fernandes dos Santos:
Parameterized Complexity of Equitable Coloring. CoRR abs/1810.13036 (2018) - 2016
- [c4]Rodrigo M. Silva, Guilherme de Castro Mendes Gomes, Mário S. Alvim
Compression-Based Selective Sampling for Learning to Rank. CIKM 2016: 247-256 - 2014
- [c3]Marisa A. Vasconcelos
Popularity dynamics of foursquare micro-reviews. COSN 2014: 119-130 - 2013
- [j1]Guilherme de Castro Mendes Gomes, Vitor Campos de Oliveira, Jussara M. Almeida, Marcos André Gonçalves:
Is Learning to Rank Worth it? A Statistical Analysis of Learning to Rank Methods in the LETOR Benchmarks. J. Inf. Data Manag. 4(1): 57-66 (2013) - [i1]Guilherme de Castro Mendes Gomes, Vitor Campos de Oliveira, Jussara Marques de Almeida, Marcos André Gonçalves:
Is Learning to Rank Worth It? A Statistical Analysis of Learning to Rank Methods. CoRR abs/1303.2277 (2013) - 2012
- [c2]Vitor Campos de Oliveira, Guilherme de Castro Mendes Gomes, Fabiano Belém, Wladmir C. Brandão
Automatic query expansion based on tag recommendation. CIKM 2012: 1985-1989 - [c1]Guilherme de Castro Mendes Gomes, Vitor Campos de Oliveira, Jussara Marques de Almeida, Marcos André Gonçalves:
Is Learning to Rank Worth it? A Statistical Analysis of Learning to Rank Methods. SBBD (Short Papers) 2012: 193-200
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-05-26 21:55 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: