Paloma T. Lima
University of Bergen, Norway
Paloma [dot] Lima [at] uib.no
My research interests lie mainly within structural graph theory, graph algorithms and parameterized complexity.
In November 2019, I completed my PhD at the University of Bergen, under the supervision of Pinar Heggernes. Before coming to Bergen, I did my masters and bachelor studies at the Federal University of Rio de Janeiro.
In proceedings of conferences (without a published journal version)       : open access
Three problems on well-partitioned chordal graphs with J. Ahn, L. Jaffke and O. Kwon CIAC 2021 (to appear)
On the maximum number of edges in chordal graphs of bounded degree and matching number with J. R. S. Blair, P. Heggernes and D. Lokshtanov LATIN 2020
Rainbow vertex coloring bipartite graphs and chordal graphs with P. Heggernes, D. Issac, J. Lauri and E. J. van Leeuwen MFCS 2018
Reducing graph transversals via edge contractions with V. F. dos Santos, I. Sau and U. S. Souza Journal of Computer and System Sciences (2021)   |   MFCS 2020 I wrote a short article about this paper for the Parameterized Complexity Newsletter.
Classifying k-edge colouring for H-free graphs with E. Galby, D. Paulusma and B. Ries Information Processing Letters (2019)
On the parameterized complexity of k-edge colouring (arXiv) with E. Galby, D. Paulusma and B. Ries
I am a program committee member of ESA 2021
Since 2018, I regularly review papers for conferences (e.g. SODA, STACS, ESA, WG, MFCS, LATIN, IPEC) and journals (e.g. Journal of Graph Theory, SIAM Journal on Discrete Mathematics, Theoretical Computer Science, Information Processing Letters).