Guilherme de C. M. Gomes

Orcid: 0000-0002-5164-1460

According to our database1, Guilherme de C. M. Gomes authored at least 23 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Minimum separator reconfiguration.
J. Comput. Syst. Sci., 2024

Complexity of Deciding the Equality of Matching Numbers.
CoRR, 2024

Matching (Multi)Cut: Algorithms, Complexity, and Enumeration.
Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

2023
Structural Parameterizations for Equitable Coloring: Complexity, FPT Algorithms, and Kernelization.
Algorithmica, July, 2023

Disconnected matchings.
Theor. Comput. Sci., May, 2023

2022
How to build high quality L2R training data: Unsupervised compression-based selective sampling for learning to rank.
Inf. Sci., 2022

Weighted Connected Matchings.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021
Coloring Problems on Bipartite Graphs of Small Diameter.
Electron. J. Comb., 2021

Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization.
Algorithmica, 2021

On structural parameterizations of the selective coloring problem.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

Kernelization results for Equitable Coloring.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

Parameterized algorithms for locating-dominating sets.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

FPT and Kernelization Algorithms for the Induced Tree Problem.
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020
Intersection graph of maximal stars.
Discret. Appl. Math., 2020

FPT and kernelization algorithms for the k-in-a-tree problem.
CoRR, 2020

Some results on Vertex Separator Reconfiguration.
CoRR, 2020

Structural Parameterizations for Equitable Coloring.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019
Parameterized Complexity of Equitable Coloring.
Discret. Math. Theor. Comput. Sci., 2019

2016
Compression-Based Selective Sampling for Learning to Rank.
Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

2014
Popularity dynamics of foursquare micro-reviews.
Proceedings of the second ACM conference on Online social networks, 2014

2013
Is Learning to Rank Worth it? A Statistical Analysis of Learning to Rank Methods in the LETOR Benchmarks.
J. Inf. Data Manag., 2013

2012
Is Learning to Rank Worth it? A Statistical Analysis of Learning to Rank Methods.
Proceedings of the XXVII Simpósio Brasileiro de Banco de Dados, 2012

Automatic query expansion based on tag recommendation.
Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012


  Loading...