Emanuel Castelo

Short bio

I am a PhD student at Aix‑Marseille Université under the 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 my DBLP and Google Scholar entries.

Research interests: Generation Algorithms, Computational Complexity Theory, Combinatorial Optimization, and their conical combination.

Contact: emanuel.castelo [at] lis-lab.fr

Office: Aix‑Marseille Université, Campus de Luminy, Laboratoire d'Informatique et des Systèmes, TPR2, 5th Floor, Office 05.24.

Castelo, E.; Defrain, O.; Gomes, C. M.; 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.

de Andrade, R. C.; Castelo, E. E. S.; Saraiva, R. D.; Valid inequalities for the k‑color shortest path problem. European Journal of Operational Research, 315(2):499–510, 2024.

Enumerating minimal dominating sets and variants in chordal bipartite graphs
- ParGO Seminar (Fortaleza, Dec. 12, 2025)
- 27e Journées Graphes et Algorithmes (Paris, Nov. 18, 2025)
- ACRO Seminar (Marseille, Jun. 16, 2025)

27e Journées Graphes et Algorithmes (Paris, Nov. 18–21, 2025)
School on Graph Theory (Nouan‑le‑Fuzelier, Jun. 30 – Jul. 4, 2025)
Graphs and Complexity (Lyon, Apr. 7–8, 2025)
Le Kaleidoscope de la Complexité (Marseille, Mar. 31–Apr 4, 2025)
26e Journées Graphes et Algorithmes (Dijon, Nov. 19–22, 2024)

I have a law degree and find constitutional law interesting, though it is not directly useful for theoretical computer science.

Check out these people: