Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Sau, Ignasi
577  Ergebnisse:
Personensuche X
?
1

Digraph Tango: from structure to algorithms and back again:

Garlet Milani, Marcelo , 2024
Link: https://nbn-resolving.de..
 
?
2

Redicolouring digraphs: Directed treewidth and cycle-degene..:

Nisse, Nicolas ; Picasarri-Arrieta, Lucas ; Sau, Ignasi
Discrete Applied Mathematics.  356 (2024)  - p. 191-208 , 2024
Link: https://doi.org/10.1016/..
 
?
3

A more accurate view of the Flat Wall Theorem:

Sau, Ignasi ; Stamoulis, Giannos ; Thilikos, Dimitrios M.
Journal of Graph Theory.  , 2024
Link: https://doi.org/10.1002/..
 
?
4

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/..
 
?
5

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/..
 
?
6

k-apices of minor-closed graph classes. I. Bounding the obs..:

Sau, Ignasi ; Stamoulis, Giannos ; Thilikos, Dimitrios M.
Journal of Combinatorial Theory, Series B.  161 (2023)  - p. 180-227 , 2023
Link: https://doi.org/10.1016/..
 
?
7

Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal ..:

Baste, Julien ; Sau, Ignasi ; Thilikos, Dimitrios M.
SIAM Journal on Computing.  52 (2023)  4 - p. 865-912 , 2023
Link: https://doi.org/10.1137/..
 
?
8

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/..
 
?
9

A relaxation of the Directed Disjoint Paths problem: A glob..:

Lopes, Raul ; Sau, Ignasi
Theoretical Computer Science.  898 (2022)  - p. 75-91 , 2022
Link: https://doi.org/10.1016/..
 
?
10

k-apices of Minor-closed Graph Classes. II. Parameterized A..:

Sau, Ignasi ; Stamoulis, Giannos ; Thilikos, Dimitrios M.
ACM Transactions on Algorithms.  18 (2022)  3 - p. 1-30 , 2022
Link: https://doi.org/10.1145/..
 
?
11

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/..
 
?
12

Introducing lop-Kernels: A Framework for Kernelization Lowe..:

Araújo, Júlio ; Bougeret, Marin ; Campos, Victor.
Algorithmica.  84 (2022)  11 - p. 3365-3406 , 2022
Link: https://doi.org/10.1007/..
 
?
13

Parameterized Complexity of Computing Maximum Minimal Block..:

Araújo, Júlio ; Bougeret, Marin ; Campos, Victor A..
Algorithmica.  85 (2022)  2 - p. 444-491 , 2022
Link: https://doi.org/10.1007/..
 
?
14

Bridge-Depth Characterizes which Minor-Closed Structural Pa..:

Bougeret, Marin ; Jansen, Bart M. P. ; Sau, Ignasi
SIAM Journal on Discrete Mathematics.  36 (2022)  4 - p. 2737-2773 , 2022
Link: https://doi.org/10.1137/..
 
?
15

Finding Cuts of Bounded Degree: Complexity, FPT and Exact A..:

Gomes, Guilherme C. M. ; Sau, Ignasi
Algorithmica.  83 (2021)  6 - p. 1677-1706 , 2021
Link: https://doi.org/10.1007/..
 
1-15