E-LIB Suche - Ergebnisse für: Maia, Ana Karolinna

1

FPT algorithms for packing k-safe spanning rooted sub(di)gr..:

Bessy, Stéphane ; Hörsch, Florian ; Maia, Ana Karolinna..
Discrete Applied Mathematics. 346 (2024) - p. 80-94 , 2024

Link: https://doi.org/10.1016/..

2

Deciding the Erdős-Pósa Property in 3-Connected Digraphs:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Bensmail, Julien ; Campos, Victor ; Maia, Ana Karolinna.. - p. 59-71 , 2023

Link: https://doi.org/10.1007/..

3

Target set selection with maximum activation time:

Keiler, Lucas ; Lima, Carlos Vinicius Gomes Costa ; Maia, Ana Karolinna..
Discrete Applied Mathematics. 338 (2023) - p. 199-217 , 2023

Link: https://doi.org/10.1016/..

4

Adapting the Directed Grid Theorem into an FPT Algorithm:

Campos, Victor ; Lopes, Raul ; Maia, Ana Karolinna.
SIAM Journal on Discrete Mathematics. 36 (2022) 3 - p. 1887-1917 , 2022

Link: https://doi.org/10.1137/..

5

Target set selection with maximum activation time:

Keiler, Lucas ; Lima, Carlos V.G.C. ; Maia, Ana Karolinna..
Procedia Computer Science. 195 (2021) - p. 86-96 , 2021

Link: https://doi.org/10.1016/..

6

On the Complexity of Finding Internally Vertex-Disjoint Lon..:

Araújo, Júlio ; Campos, Victor A. ; Maia, Ana Karolinna..
Algorithmica. 82 (2019) 6 - p. 1616-1639 , 2019

Link: https://doi.org/10.1007/..

7

Adapting The Directed Grid Theorem into an FPT Algorithm:

Campos, Victor ; Lopes, Raul ; Maia, Ana Karolinna.
Electronic Notes in Theoretical Computer Science. 346 (2019) - p. 229-240 , 2019

Link: https://doi.org/10.1016/..

8

Maximization coloring problems on graphs with fewP4:

Campos, Victor ; Linhares-Sales, Cláudia ; Sampaio, Rudini.
Discrete Applied Mathematics. 164 (2014) - p. 539-546 , 2014

Link: https://doi.org/10.1016/..

9

Restricted coloring problems on Graphs with few P 4's:

Linhares-Sales, Cláudia ; Maia, Ana Karolinna ; Martins, Nicolas.
Annals of Operations Research. 217 (2014) 1 - p. 385-397 , 2014

Link: https://doi.org/10.1007/..

10

FPT algorithms for packing k-safe spanning rooted sub(di)gr..:

Bessy, Stéphane ; Hörsch, Florian ; Maia, Ana Karolinna..
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.dam.2023.11.026. , 2024

Link: https://hal-lirmm.ccsd.c..

11

FPT algorithms for packing k-safe spanning rooted sub(di)gr..:

Bessy, Stéphane ; Hörsch, Florian ; Maia, Ana Karolinna..
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.dam.2023.11.026. , 2024

Link: https://hal-lirmm.ccsd.c..

12

From branchings to flows: a study of an Edmonds' like prope..:

Carvalho, Cláudio ; Costa, Jonas ; Lopes, Raul...
info:eu-repo/semantics/altIdentifier/doi/10.46298/dmtcs.9302. , 2023

Link: https://hal.science/hal-..

13

Deciding the Erdős-Pósa property in 3-connected digraphs:

Bensmail, Julien ; Campos, Victor ; Maia, Ana, Karolinna..
hal-04084227. , 2023

Link: https://inria.hal.scienc..

14

Target set selection with maximum activation time:

Keiler, Lucas ; Lima, Carlos Vinicius Gomes Costa ; Maia, Ana Karolinna..
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.dam.2023.06.004. , 2023

Link: https://hal-lirmm.ccsd.c..

15

From branchings to flows: a study of an Edmonds' like prope..:

Carvalho, Cláudio ; Costa, Jonas ; Lopes, Raul...
info:eu-repo/semantics/altIdentifier/doi/10.46298/dmtcs.9302. , 2023

Link: https://hal.science/hal-..