Short Bio
I am a PhD student at Aix-Marseille Université under supervision of Jérémie Chalopin and co-supervision of Oscar Defrain.
During my master's at Universidade Federal do Ceará, as a member of the ParGO research group, I wrote a thesis on valid inequalities for the k-Color Shortest Path problem. I also have a law degree, for whatever reason*. See also my dblp and Google Scholar entries.
Research interests: Enumeration Algorithms**, Computational Complexity Theory, and everything in-between.
Contact: emanuel.castelo[at]lis-lab.fr
Office: Aix-Marseille University, Campus de Luminy, Laboratoire d'Informatique et Systèmes, TPR2, 5th Floor, Office 05.24.
*: I forgot most of it :)
**: Although «Generation Algorithms» sometimes sound more appropriate.
Research
Preprints
- Castelo, E., Defrain, O., and Gomes G. C. M. Enumerating minimal dominating sets and variants in chordal bipartite graphs. arXiv, 2502.14611.
Journal
- de Andrade, R. C., Castelo, E. E. S., and Saraiva, R. D. Valid inequalities for the k-color shortest path problem. European Journal of Operational Research, 315(2):499-510, 2024.
Talks
Attended Events
- School on Graph Theory (Nouan-le-Fuzelier, Jun. 30 - Jul. 04, 2025)
- Graphs and complexity (Lyon, Apr. 07-08, 2025)
- Le kaleidoscope de la complexité (Marseille, Mar. 31 - Apr. 04, 2025)
- 26e Journées Graphes et Algorithmes (Dijon, Nov. 19-22, 2024)