| Solving the minimum convex partition of point sets with integer programming A Sapucaia, PJ de Rezende, CC de Souza Computational Geometry 99, 101794, 2021 | 11 | 2021 |
| Minimum convex partition of point sets AS Barboza, CC de Souza, PJ de Rezende Algorithms and Complexity: 11th International Conference, CIAC 2019, Rome …, 2019 | 7 | 2019 |
| On the strength of approximate linear programming relaxations for the traveling salesman problem R Fukasawa, AS Barboza, A Toriello Available online: www2. isye. gatech. edu/~ atoriello3/bcpalp. pdf (accessed …, 2016 | 5 | 2016 |
| Ruler wrapping T Gagie, M Saeidi, A Sapucaia International Journal of Computational Geometry & Applications 33 (01n02), 3-12, 2023 | 2 | 2023 |
| Covering Points with Unit Disks Under Color Constraints A Sapucaia, A Cire, P de Rezende, S de Rezende, C de Souza Available at SSRN 4334380, 0 | 1 | |
| Optimizing over Path-Length Matrices of Unrooted Binary Trees D Catanzaro, R Pesenti, A Sapucaia Barboza, L Wolsey | | 2023 |
| Geometric decomposition problems AS Barboza Institute of Computing - UNICAMP, 2022 | | 2022 |
| Solving the Coarseness Problem by ILP Using Column Generation A Sapucaia, PJ de Rezende, CC de Souza International Conference on Computational Science and Its Applications, 30-45, 2021 | | 2021 |
| Convex Bichromatic Quadrangulation of Point Sets with Minimum Color Flips A Sapucaia, AA Ciré, PJ de Rezende, CC de Souza 33rd Canadian Conference on Computational Geometry, 185-194, 2021 | | 2021 |
