Short Bio
I am a PhD student at Aix-Marseille Université under supervision of Jérémie Chalopin and co-supervision of Oscar Defrain.
I defended my master's thesis on the k-Color Shortest Path problem at Universidade Federal do Ceará. During this period I was member of the ParGO research group. I also have a law degree, for whatever reason. See also my dblp and Google Scholar entries.
Research interests: Algorithmic Enumeration, Computational Complexity Theory, and Combinatorial Optimization.
Contact: emanuel.castelo@lis-lab.fr.
Office: Aix-Marseille University, Campus de Luminy, Laboratoire d'Informatique et Systèmes, TPR2, 5th Floor, Office 05.24.
Publications
- Castelo, E., Defrain, O., and Gomes G. C. M. Enumerating minimal dominating sets and variants in chordal bipartite graphs. arXiv, 2502.14611.
- 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.
Attended Events
- 26e Journées Graphes et Algorithmes (JGA 2024)