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
Journal articles
  • Cerioli, Marcia R.; Lima, Paloma T. 2019. Intersection of longest paths in graph classes. Discrete Applied Mathematics. doi: 10.1016/j.dam.2019.03.022
  • Galby, Esther; Lima, Paloma T.; Paulusma, Daniel; Ries, Bernard. 2019. Classifying k-edge colouring for H-free graphs. Information Processing Letters. 146: 39-43. doi: 10.1016/j.ipl.2019.02.006
  • 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. 81: 2795-2828. doi: 10.1007/s00453-019-00555-y
  • Jaffke, Lars; Lima, Paloma T. 2019. A complexity dichotomy for critical values of the b-chromatic number of graphs. Leibniz International Proceedings in Informatics. 138: 34:1-34:13. doi: 10.4230/LIPIcs.MFCS.2019.34
  • Golovach, Petr; Heggernes, Pinar; Konstantinidis, Athanasios; T. Lima, Paloma; Papadopoulos, Charis. 2018. Parameterized Aspects of Strong Subgraph Closure. Leibniz International Proceedings in Informatics. 101: 23:1-23:13. doi: 10.4230/LIPIcs.SWAT.2018.23
  • Golovach, Petr; Heggernes, Pinar; Thomé de Lima, Paloma; Montealegre, Pedro. 2018. Finding connected secluded subgraphs. Leibniz International Proceedings in Informatics. 89: 1-13. doi: 10.4230/LIPIcs.IPEC.2017.18
  • 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. 117: 83:1-83:13. doi: 10.4230/LIPIcs.MFCS.2018.83
  • Cerioli, Marcia R.; Fernandes, Cristina G.; Gómez, Renzo; Gutiérrez, Juan; Lima, Paloma. 2017. Transversals of Longest Paths. Electronic Notes in Discrete Mathematics. 62: 135-140. doi: 10.1016/j.endm.2017.10.024
  • 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. 10520 LNCS: 275-288. doi: 10.1007/978-3-319-68705-6_21
Reports and theses
  • Lima, Paloma T. 2019. Structural and Algorithmic Graph Theory Through the Lenses of Graph Classes. Universitetet i Bergen.

More information in national current research information system (CRIStin)