About me

In November 2019 I completed my PhD degree in Computer Science at the University of Bergen. My supervisor was Pinar Heggernes.

Before coming to Bergen, I did my masters and bachelor studies at the Federal University of Rio de Janeiro.

My research interests lie mainly in the area of structural and algorithmic graph theory.


: open access

Conference proceedings (without journal version yet)

Blocking dominating sets for H-free graphs via edge contractions
with E. Galby and B. Ries
ISAAC 2019 

A complexity dichotomy for critical values of the b-chromatic number of graphs
with L. Jaffke
MFCS 2019    |   full version (pdf)

Reducing the domination number of graphs via edge contractions
with E. Galby and B. Ries
MFCS 2019    |   full version (pdf)

Rainbow vertex coloring bipartite graphs and chordal graphs
with P. Heggernes, D. Issac, J. Lauri and E. J. van Leeuwen
MFCS 2018 

Parameterized aspects of strong subgraph closure
with P. A. Golovach, P. Heggernes, A. L. Konstantinidis and C. Papadopoulos
SWAT 2018    |   full version (pdf)

Finding connected secluded subgraphs
with P. A. Golovach, P. Heggernes and P. Montealegre
IPEC 2017    |   full version (pdf)

Journal publications

Transversals of longest paths
with M. R. Cerioli, C. G. Fernandes, R. Gómez and J. Gutiérrez
Discrete Mathematics (online, 2020)   |   Short version at LAGOS 2017

Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
with P. A. Golovach, P. Heggernes, D. Kratsch and D. Paulusma
Algorithmica 81: 2795-2828 (2019)   |   Short version at WG 2017

Intersection of longest paths in graph classes
with M. R. Cerioli
Discrete Applied Mathematics (online, 2019)    |   Short version at CTW 2016

Classifying k-edge colouring for H-free graphs
with E. Galby, D. Paulusma and B. Ries
Information Processing Letters 146: 39-43 (2019)