Publications

 Journal Papers

1. On a class of strong valid inequalities for the connected matching polytope
   Submitted.
   Also available at arXiv:2309.14019

2. Polyhedral approach to weighted connected matchings in general graphs
   Submitted.
   Also available at arXiv.2310.05733; Full implementation on the corresponding github repository

3. Polyhedral results and stronger Lagrangean bounds for stable spanning trees
   Optimization Letters, 2023, Volume 17, Issue 6,  pp 1317-1335 (open access). DOI: 10.1007/s11590-022-01949-8
   Full implementation on the corresponding github repository 

4. Fixed cardinality stable sets
   Discrete Applied Mathematics, 2021, Volume 303,  pp 137-148 (open access). DOI: 10.1016/j.dam.2021.01.019

5. The matching relaxation for a class of generalized set partitioning problems
   Discrete Applied Mathematics, 2019, Volume 253, pp 153-166. DOI: 10.1016/j.dam.2018.05.033
   Also available at arXiv:1606.09279

6. An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices
   Computational Optimization and Applications, 2016, Volume 65, Issue 3, pp 821-844. DOI: 10.1007/s10589-016-9850-0
   Also available at arXiv:1509.06562

7. A branch and cut algorithm for minimum spanning trees under conflict constraints
   Optimization Letters, 2015, Volume 9, Issue 1, pp 41-55, DOI: 10.1007/s11590-014-0750-x
   Also available at arXiv:1307.1424

International Conferences

1. Towards stronger Lagrangean bounds for stable spanning trees
   10th International Network Optimization Conference (INOC), Aachen, Germany, 2022
   Published in a volume of OpenProceedings (open access). DOI: 10.48786/inoc.2022.06 

2. The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope
   18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW), online, 2020
   Chapter published in Volume 5 of the AIRO Springer Series.  DOI: 10.1007/978-3-030-63072-0_9

3. Combinatorial relaxation bounds and preprocessing for berth allocation problems
   14th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW), Gargnano, Italy, 2016.
   Proceedings published in Electronic Notes in Discrete Mathematics, Volume 55, pp 85-88. DOI: 10.1016/j.endm.2016.10.022

4. Designing a multicore graph library
   10th IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA), Madrid, Spain, 2012.
   Conference proceedings on  IEEE Xplore, pp. 721-728, DOI: 10.1109/ISPA.2012.106

5. Map ants, Reduce work
   IX Metaheuristics International Conference (MIC), Udine, Italy, 2011.

Poster presentations

1. Formulations and branch and cut algorithm for spanning trees under disjunctive constraints
   16th Conference on Integer Programming and Combinatorial Optimization (IPCO), Valparaíso, Chile, 2013.

Brazilian Conferences

1. Uma metodologia de relaxação combinatória para um problema de logística em portos
   XLVIII Brazilian Symposium on Operations Research (SBPO), Vitória, 2016.

2. Um algoritmo de branch and cut para árvores geradoras mínimas sob restrições de conflito
   XLV Brazilian Symposium on Operations Research (SBPO), Natal, Brazil, 2013.

3. Projeto de uma Biblioteca Paralela de Grafos
   XVI Latin-Ibero-American Congress on Operations Research / XLIV Brazilian Symposium on Operations Research (CLAIO/SBPO), Rio de Janeiro, Brazil, 2012.

4. Mining Structural Signatures of Proteins
   III Workshop on Data Mining Algorithms and Applications, João Pessoa, Brazil, 2007.