Home
Paloma Thomé de Lima's picture

Paloma Thomé de Lima

PhD Candidate
  • E-mailPaloma.Lima@uib.no
  • Visitor Address
    HIB - Thormøhlensgt. 55
  • Postal Address
    Postboks 7803
    5020 Bergen

My research is in the area of structural and algorithmic graph theory.

Academic article
  • Cerioli, Marcia R.; Lima, Paloma T. 2019. Intersection of longest paths in graph classes. Discrete Applied Mathematics.
  • Galby, Esther; Lima, Paloma T.; Paulusma, Daniel; Ries, Bernard. 2019. Classifying k-edge colouring for H-free graphs. Information Processing Letters. 39-43.
  • Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter; Lima, Paloma T.; Paulusma, Daniel. 2019. Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. Algorithmica. 2795-2828.
  • Jaffke, Lars; Lima, Paloma T. 2019. A complexity dichotomy for critical values of the b-chromatic number of graphs. Leibniz International Proceedings in Informatics. 34:1-34:13.
  • Heggernes, Pinar; Issac, Davis; Lauri, Juho; T. Lima, Paloma; van Leeuwen, Erik Jan. 2018. Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. Leibniz International Proceedings in Informatics. 83:1-83:13.
  • Golovach, Petr; Heggernes, Pinar; Konstantinidis, Athanasios; T. Lima, Paloma; Papadopoulos, Charis. 2018. Parameterized Aspects of Strong Subgraph Closure. Leibniz International Proceedings in Informatics. 23:1-23:13.
  • Golovach, Petr; Heggernes, Pinar; Thomé de Lima, Paloma; Montealegre, Pedro. 2018. Finding connected secluded subgraphs. Leibniz International Proceedings in Informatics. 1-13.
  • Cerioli, Marcia R.; Fernandes, Cristina G.; Gómez, Renzo; Gutiérrez, Juan; Lima, Paloma. 2017. Transversals of Longest Paths. Electronic Notes in Discrete Mathematics. 135-140.
  • Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter; Lima, Paloma; Paulusma, Daniël. 2017. Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. Lecture Notes in Computer Science (LNCS). 275-288.
Doctoral dissertation
  • Lima, Paloma T. 2019. Structural and Algorithmic Graph Theory Through the Lenses of Graph Classes.

More information in national current research information system (CRIStin)