Hjem
Paloma Thome de Limas bilde

Paloma Thome de Lima

Postdoktor
  • E-postPaloma.Lima@uib.no
  • Telefon+47 922 92 574
  • Besøksadresse
    HIB - Thormøhlensgt. 55
  • Postadresse
    Postboks 7803
    5020 Bergen
Vitenskapelig artikkel
  • Vis forfatter(e) 2020. Transversals of longest paths. Discrete Mathematics. 10 sider.
  • Vis forfatter(e) 2020. Structural parameterizations of clique coloring. Leibniz International Proceedings in Informatics. 49:1-49:15.
  • Vis forfatter(e) 2020. Reducing graph transversals via edge contractions. Leibniz International Proceedings in Informatics. 64:1-64:15.
  • Vis forfatter(e) 2020. Parameterized Aspects of Strong Subgraph Closure. Algorithmica. 2006-2038.
  • Vis forfatter(e) 2020. On the maximum number of edges in chordal graphs of bounded degree and matching number. Lecture Notes in Computer Science (LNCS). 600-612.
  • Vis forfatter(e) 2020. Graph Square Roots of Small Distance from Degree One Graphs. Lecture Notes in Computer Science (LNCS). 116-128.
  • Vis forfatter(e) 2020. Finding connected secluded subgraphs. Journal of computer and system sciences. 101-124.
  • Vis forfatter(e) 2020. Algorithms for the rainbow vertex coloring problem on graph classes. Leibniz International Proceedings in Informatics. 63:1-63:13.
  • Vis forfatter(e) 2020. A complexity dichotomy for critical values of the b-chromatic number of graphs. Theoretical Computer Science. 182-196.
  • Vis forfatter(e) 2019. Reducing the Domination Number of Graphs via Edge Contractions. Leibniz International Proceedings in Informatics. 41:1-41:13.
  • Vis forfatter(e) 2019. Intersection of longest paths in graph classes. Discrete Applied Mathematics.
  • Vis forfatter(e) 2019. Classifying k-edge colouring for H-free graphs. Information Processing Letters. 39-43.
  • Vis forfatter(e) 2019. Blocking dominating sets for H-free graphs via edge contractions. Leibniz International Proceedings in Informatics. 21:1-21:14.
  • Vis forfatter(e) 2019. Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. Algorithmica. 2795-2828.
  • Vis forfatter(e) 2019. A complexity dichotomy for critical values of the b-chromatic number of graphs. Leibniz International Proceedings in Informatics. 34:1-34:13.
  • Vis forfatter(e) 2018. Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. Leibniz International Proceedings in Informatics. 83:1-83:13.
  • Vis forfatter(e) 2018. Parameterized Aspects of Strong Subgraph Closure. Leibniz International Proceedings in Informatics. 23:1-23:13.
  • Vis forfatter(e) 2018. Finding connected secluded subgraphs. Leibniz International Proceedings in Informatics. 1-13.
  • Vis forfatter(e) 2017. Transversals of Longest Paths. Electronic Notes in Discrete Mathematics. 135-140.
  • Vis forfatter(e) 2017. Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. Lecture Notes in Computer Science (LNCS). 275-288.
Doktorgradsavhandling
  • Vis forfatter(e) 2019. Structural and Algorithmic Graph Theory Through the Lenses of Graph Classes.
Vitenskapelig Kapittel/Artikkel/Konferanseartikkel
  • Vis forfatter(e) 2020. Well-partitioned chordal graphs: obstruction set and disjoint paths. 13 sider.

Se fullstendig oversikt over publikasjoner i CRIStin.