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. See also my dblp and Google Scholar entries.
Research interests: Generation Algorithms, Computational Complexity Theory, Combinatorial Optimization, and the linear combination of these topics.
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.
Research
/conferences
- Castelo, E., Defrain, O., and C. M. Gomes, G. Enumerating Minimal Dominating Sets and Variants in Chordal Bipartite Graphs. 19th International Symposium on Algorithms and Data Structures (WADS 2025), 15:1-15:15, 2025.
/journals
/talks
You can find me here
- 27e Journées Graphes et Algorithmes (Paris, Nov. 18-21, 2025)
- 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)
Misc
I have a law degree and do find constitutional law interesting. Not very useful for theoretical computer science, however.