Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Lima, Paloma T.
597  Ergebnisse:
Personensuche X
?
1

On the maximum number of edges in planar graphs of bounded ..:

Jaffke, Lars ; Lima, Paloma T.
Discrete Mathematics.  346 (2023)  8 - p. 113431 , 2023
Link: https://doi.org/10.1016/..
 
?
2

b-Coloring Parameterized by Clique-Width:

Jaffke, Lars ; Lima, Paloma T. ; Lokshtanov, Daniel
Theory of Computing Systems.  , 2023
Link: https://doi.org/10.1007/..
 
?
3

Using edge contractions to reduce the semitotal domination ..:

Galby, Esther ; Lima, Paloma T. ; Mann, Felix.
Theoretical Computer Science.  939 (2023)  - p. 140-160 , 2023
Link: https://doi.org/10.1016/..
 
?
4

Reducing the vertex cover number via edge contractions:

Lima, Paloma T. ; dos Santos, Vinicius F. ; Sau, Ignasi..
Journal of Computer and System Sciences.  136 (2023)  - p. 63-87 , 2023
Link: https://doi.org/10.1016/..
 
?
5

On the Maximum Number of Edges in Chordal Graphs of Bounded..:

Blair, Jean R. S. ; Heggernes, Pinar ; Lima, Paloma T..
Algorithmica.  84 (2022)  12 - p. 3587-3602 , 2022
Link: https://doi.org/10.1007/..
 
?
6

Well-partitioned chordal graphs:

Ahn, Jungho ; Jaffke, Lars ; Kwon, O-joung.
Discrete Mathematics.  345 (2022)  10 - p. 112985 , 2022
Link: https://doi.org/10.1016/..
 
?
7

Graph Square Roots of Small Distance from Degree One Graphs:

Golovach, Petr A. ; Lima, Paloma T. ; Papadopoulos, Charis
Theory of Computing Systems.  66 (2022)  4 - p. 821-846 , 2022
Link: https://doi.org/10.1007/..
 
?
8

Reducing graph transversals via edge contractions:

Lima, Paloma T. ; dos Santos, Vinicius F. ; Sau, Ignasi.
Journal of Computer and System Sciences.  120 (2021)  - p. 62-74 , 2021
Link: https://doi.org/10.1016/..
 
?
9

Reducing the domination number of graphs via edge contracti..:

Galby, Esther ; Lima, Paloma T. ; Ries, Bernard
Discrete Mathematics.  344 (2021)  1 - p. 112169 , 2021
Link: https://doi.org/10.1016/..
 
?
10

Algorithms for the rainbow vertex coloring problem on graph..:

Lima, Paloma T. ; van Leeuwen, Erik Jan ; van der Wegen, Marieke
Theoretical Computer Science.  887 (2021)  - p. 122-142 , 2021
Link: https://doi.org/10.1016/..
 
?
11

Structural Parameterizations of Clique Coloring:

Jaffke, Lars ; Lima, Paloma T. ; Philip, Geevarghese
Algorithmica.  84 (2021)  2 - p. 273-303 , 2021
Link: https://doi.org/10.1007/..
 
?
12

Three Problems on Well-Partitioned Chordal Graphs:

, In: Lecture Notes in Computer Science; Algorithms and Complexity,
Ahn, Jungho ; Jaffke, Lars ; Kwon, O-joung. - p. 23-36 , 2021
Link: https://doi.org/10.1007/..
 
?
13

Parameterized Aspects of Strong Subgraph Closure:

Golovach, Petr A. ; Heggernes, Pinar ; Konstantinidis, Athanasios L...
Algorithmica.  82 (2020)  7 - p. 2006-2038 , 2020
Link: https://doi.org/10.1007/..
 
?
14

Well-Partitioned Chordal Graphs: Obstruction Set and Disjoi..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Ahn, Jungho ; Jaffke, Lars ; Kwon, O-joung. - p. 148-160 , 2020
Link: https://doi.org/10.1007/..
 
?
15

Graph Square Roots of Small Distance from Degree One Graphs:

, In: LATIN 2020: Theoretical Informatics; Lecture Notes in Computer Science,
Golovach, Petr A. ; Lima, Paloma T. ; Papadopoulos, Charis - p. 116-128 , 2020
Link: https://doi.org/10.1007/..
 
1-15