|
A more accurate view of the Flat Wall Theorem
Ignasi Sau
,
Giannos Stamoulis
,
Dimitrios M. Thilikos
Article dans une revue
lirmm-04700544
v1
|
|
Compound Logics for Modification Problems
Fedor V. Fomin
,
Petr A. Golovach
,
Ignasi Sau
,
Giannos Stamoulis
,
Dimitrios M. Thilikos
ACM Transactions on Computational Logic, 2024, Leibniz International Proceedings in Informatics (LIPIcs), 26 (1), pp.1-57. ⟨10.1145/3696451⟩
Article dans une revue
lirmm-04825119
v1
|
|
Redicolouring digraphs: directed treewidth and cycle-degeneracy
Nicolas Nisse
,
Lucas Picasarri-Arrieta
,
Ignasi Sau
Article dans une revue
hal-04271445
v1
|
|
FPT algorithms for packing k-safe spanning rooted sub(di)graphs
Stéphane Bessy
,
Florian Hörsch
,
Ana Karolinna Maia
,
Dieter Rautenbach
,
Ignasi Sau
Article dans une revue
lirmm-04352990
v1
|
|
On the parameterized complexity of the median and closest problems under some permutation metrics
Luís Felipe I. Cunha
,
Ignasi Sau
,
Uéverton dos Santos Souza
Article dans une revue
lirmm-04907382
v1
|
|
Faster parameterized algorithms for modification problems to minor-closed classes
Laure Morelle
,
Giannos Stamoulis
,
Ignasi Sau
,
Dimitrios M. Thilikos
Article dans une revue
lirmm-04698814
v1
|
|
Target set selection with maximum activation time
Lucas Keiler
,
Carlos Vinicius Gomes Costa Lima
,
Ana Karolinna Maia de Oliveira
,
Rudini Sampaio
,
Ignasi Sau
Article dans une revue
lirmm-04140763
v1
|
|
Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets
Júlio Araújo
,
Marin Bougeret
,
Victor Campos
,
Ignasi Sau
Article dans une revue
lirmm-04028295
v1
|
|
Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm
Julien Baste
,
Ignasi Sau
,
Dimitrios M. Thilikos
Article dans une revue
lirmm-04171495
v1
|
|
k-apices of minor-closed graph classes. I. Bounding the obstructions
Ignasi Sau
,
Giannos Stamoulis
,
Dimitrios M. Thilikos
Article dans une revue
lirmm-04028310
v1
|
|
Reducing the vertex cover number via edge contractions
Paloma Thomé de Lima
,
Vinicius F. dos Santos
,
Ignasi Sau
,
Uéverton dos Santos Souza
,
Prafullkumar Tale
Article dans une revue
lirmm-04107607
v1
|
|
Adapting the Directed Grid Theorem into an FPT Algorithm
Victor Campos
,
Raul Lopes
,
Ana Karolinna Maia de Oliveira
,
Ignasi Sau
Article dans une revue
lirmm-04028302
v1
|
|
k-apices of Minor-closed Graph Classes. II. Parameterized Algorithms
Ignasi Sau
,
Giannos Stamoulis
,
Dimitrios M. Thilikos
Article dans une revue
hal-03835923
v1
|
|
Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel
Marin Bougeret
,
Bart M P Jansen
,
Ignasi Sau
Article dans une revue
lirmm-04028294
v1
|
|
Introducing lop-Kernels: A Framework for Kernelization Lower Bounds
Júlio Araújo
,
Marin Bougeret
,
Victor Campos
,
Ignasi Sau
Article dans une revue
lirmm-03991247
v1
|
|
A relaxation of the Directed Disjoint Paths problem: A global congestion metric helps
Raul Lopes
,
Ignasi Sau
Article dans une revue
lirmm-03772271
v1
|
|
Reducing graph transversals via edge contractions
Paloma T Lima
,
Vinicius F dos Santos
,
Ignasi Sau
,
Uéverton S Souza
Article dans une revue
lirmm-03374537
v1
|
|
On the complexity of finding large odd induced subgraphs and odd colorings
Rémy Belmonte
,
Ignasi Sau
Article dans une revue
lirmm-03374591
v1
|
|
Target set selection with maximum activation time
Lucas Keiler
,
Carlos Vinicius Gomes Costa Lima
,
Ana Karolinna Maia de Oliveira
,
Rudini Sampaio
,
Ignasi Sau
Article dans une revue
lirmm-03772657
v1
|
|
Finding Cuts of Bounded Degree
Guilherme C M Gomes
,
Ignasi Sau
Article dans une revue
lirmm-03374542
v1
|
|
Coloring Problems on Bipartite Graphs of Small Diameter
Victor A Campos
,
Guilherme C.M. Gomes
,
Allen Ibiapina
,
Raul Lopes
,
Ignasi Sau
et al.
The Electronic Journal of Combinatorics, 2021, 28 (2), pp.#P2.14. ⟨10.37236/9931⟩
Article dans une revue
lirmm-03374527
v1
|
|
A Unifying Model for Locally Constrained Spanning Tree Problems
Luiz Alberto Do Carmo Viana
,
Manoel Campêlo
,
Ignasi Sau
,
Ana Silva
Article dans une revue
lirmm-03374555
v1
|
|
Hitting forbidden induced subgraphs on bounded treewidth graphs
Ignasi Sau
,
Uéverton dos Santos Souza
Article dans une revue
lirmm-03772257
v1
|
|
Maximum cuts in edge-colored graphs
Luerbio Faria
,
Sulamita Klein
,
Ignasi Sau
,
Uéverton dos Santos Souza
,
Rubens Sucupira
Article dans une revue
lirmm-02989852
v1
|
|
Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds
Julien Baste
,
Ignasi Sau
,
Dimitrios M. Thilikos
Article dans une revue
lirmm-02989921
v1
|
|
Hitting minors on bounded treewidth graphs. III. Lower bounds
Julien Baste
,
Ignasi Sau
,
Dimitrios M. Thilikos
Article dans une revue
lirmm-02989938
v1
|
|
Dual Parameterization of Weighted Coloring
Júlio Araújo
,
Victor A Campos
,
Carlos Vinícius G. C. Lima
,
Vinícius Fernandes dos Santos
,
Ignasi Sau
et al.
Article dans une revue
lirmm-02989870
v1
|
|
On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths
Júlio Araújo
,
Victor A Campos
,
Ana Karolinna Maia de Oliveira
,
Ignasi Sau
,
Ana Silva
Article dans une revue
lirmm-02989813
v1
|
|
Parameterized complexity of finding a spanning tree with minimum reload cost diameter
Julien Baste
,
Didem Gözüpek
,
Christophe Paul
,
Ignasi Sau
,
Mordechai Shalom
et al.
Article dans une revue
lirmm-02989889
v1
|
|
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms
Julien Baste
,
Ignasi Sau
,
Dimitrios M. Thilikos
Article dans une revue
lirmm-02989928
v1
|
|
Adapting The Directed Grid Theorem into an FPT Algorithm
Victor Campos
,
Raul Lopes
,
Ana Karolinna Maia de Oliviera
,
Ignasi Sau
Article dans une revue
lirmm-02410620
v1
|
|
Weighted proper orientations of trees and graphs of bounded treewidth
Julio Araujo
,
Cláudia Linhares Sales
,
Ignasi Sau
,
Ana Silva
Article dans une revue
lirmm-02410622
v1
|
|
How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?
Marin Bougeret
,
Ignasi Sau
Article dans une revue
lirmm-02410618
v1
|
|
Counting Gallai 3-colorings of complete graphs
Josefran de Oliveira Bastos
,
Fabrício Siqueira Benevides
,
Guilherme Oliveira Mota
,
Ignasi Sau
Article dans une revue
lirmm-02410619
v1
|
|
Explicit Linear Kernels for Packing Problems
Valentin Garnero
,
Christophe Paul
,
Ignasi Sau
,
Dimitrios M. Thilikos
Article dans une revue
lirmm-02342736
v1
|
|
Approximating maximum uniquely restricted matchings in bipartite graphs
Julien Baste
,
Dieter Rautenbach
,
Ignasi Sau
Article dans une revue
lirmm-02410617
v1
|
|
Upper bounds on the uniquely restricted chromatic index
Julien Baste
,
Dieter Rautenbach
,
Ignasi Sau
Article dans une revue
lirmm-02412578
v1
|
|
A Linear Kernel for Planar Total Dominating Set
Valentin Garnero
,
Ignasi Sau
Article dans une revue
lirmm-03124041
v1
|
|
An $O(\log \mathrm {OPT})$-Approximation for Covering and Packing Minor Models of $\theta _r$
Dimitris Chatzidimitriou
,
Jean-Florent Raymond
,
Ignasi Sau
,
Dimitrios M. Thilikos
Article dans une revue
lirmm-01609998
v1
|
|
Improved FPT algorithms for weighted independent set in bull-free graphs
Henri Perret Du Cray
,
Ignasi Sau
Article dans une revue
hal-01733496
v1
|
|
On the number of labeled graphs of bounded treewidth
Julien Baste
,
Marc Noy
,
Ignasi Sau
Article dans une revue
hal-03109959
v1
|
|
Ruling out FPT algorithms for Weighted Coloring on forests
Julio Araujo
,
Julien Baste
,
Ignasi Sau
Article dans une revue
hal-03109986
v1
|
|
On the (Parameterized) Complexity of Recognizing Well-Covered $(r,l)$-graphs
Sancrey Rodrigues Alves
,
Konrad K. Dabrowski
,
Luerbio Faria
,
Sulamita Klein
,
Ignasi Sau
et al.
Article dans une revue
lirmm-03110090
v1
|
|
A Tight Erdös-Pósa Function for Wheel Minors
Pierre Aboulker
,
Samuel Fiorini
,
Tony Huynh
,
Gwénaël Joret
,
Jean-Florent Raymond
et al.
Article dans une revue
hal-01995696
v1
|
|
Complexity dichotomies for the Minimum F -Overlay problem
Nathann Cohen
,
Frédéric Havet
,
Dorian Mazauric
,
Ignasi Sau
,
Rémi Watrigant
Article dans une revue
hal-01947563
v1
|
|
An FPT 2-Approximation for Tree-Cut Decomposition
Eun Jung Kim
,
Sang-Il Oum
,
Christophe Paul
,
Ignasi Sau
,
Dimitrios M. Thilikos
Article dans une revue
hal-01690385
v1
|
|
Ruling out FPT algorithms for Weighted Coloring on forests
Julio Araujo
,
Julien Baste
,
Ignasi Sau
Article dans une revue
hal-01733595
v1
|
|
Maximum Cuts in Edge-colored Graphs
Rubens Sucupira
,
Luerbio Faria
,
Sulamita Klein
,
Ignasi Sau
,
Uéverton dos Santos Souza
Article dans une revue
hal-01733581
v1
|
|
On the complexity of computing the k-restricted edge-connectivity of a graph
Luis Pedro Montejano
,
Ignasi Sau
Article dans une revue
lirmm-01481786
v1
|
|
A linear kernel for planar red–blue dominating set
Valentin Garnero
,
Ignasi Sau
,
Dimitrios M. Thilikos
Article dans une revue
lirmm-01481785
v1
|
|
Minors in graphs of large θr-girth
Dimitris Chatzidimitriou
,
Jean-Florent Raymond
,
Ignasi Sau
,
Dimitrios M. Thilikos
Article dans une revue
hal-01218519
v2
|
|
A polynomial-time algorithm for Outerplanar Diameter Improvement
Nathann Cohen
,
Daniel Gonçalves
,
Eun Jung Kim
,
Christophe Paul
,
Ignasi Sau
et al.
Article dans une revue
hal-01592242
v1
|
|
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability
Didem Gözüpek
,
Sibel Özkan
,
Christophe Paul
,
Ignasi Sau
,
Mordechai Shalom
Article dans une revue
lirmm-01630777
v1
|
|
On the parameterized complexity of the Edge Monitoring problem
Julien Baste
,
Fairouz Beggas
,
Hamamache Kheddouci
,
Ignasi Sau
Article dans une revue
lirmm-01487565
v1
|
|
Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion
Julien Baste
,
Luerbio Faria
,
Sulamita Klein
,
Ignasi Sau
Article dans une revue
lirmm-01630773
v1
|
|
Parameterized algorithms for min-max multiway cut and list digraph homomorphism
Eun Jung Kim
,
Christophe Paul
,
Ignasi Sau
,
Dimitrios M. Thilikos
Article dans une revue
lirmm-01487567
v1
|
|
Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees
Julien Baste
,
Christophe Paul
,
Ignasi Sau
,
Celine Scornavacca
Article dans une revue
lirmm-03113710
v1
|
|
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
Eun Jung Kim
,
Alexander Langer
,
Christophe Paul
,
Felix Reidl
,
Peter Rossmanith
et al.
Article dans une revue
lirmm-01288472
v1
|
|
An edge variant of the Erdős–Pósa property
Jean-Florent Raymond
,
Ignasi Sau
,
Dimitrios M. Thilikos
Article dans une revue
lirmm-01347430
v2
|
|
The role of planarity in connectivity problems parameterized by treewidth
Julien Baste
,
Ignasi Sau
Article dans une revue
lirmm-01272664
v1
|
|
Explicit Linear Kernels via Dynamic Programming
Valentin Garnero
,
Christophe Paul
,
Ignasi Sau
,
Dimitrios M. Thilikos
Article dans une revue
lirmm-01263857
v1
|
|
Parameterized domination in circle graphs
Christophe Paul
,
Nicolas Bousquet
,
Daniel Gonçalves
,
George Mertzios
,
Ignasi Sau
et al.
Article dans une revue
hal-01178188
v1
|
|
Hitting and harvesting pumpkins
Gwénaël Joret
,
Christophe Paul
,
Ignasi Sau
,
Saket Saurabh
,
Stéphan Thomassé
Article dans une revue
hal-01178192
v1
|
|
Dynamic Programming for Graphs on Surfaces
Juanjo Rué
,
Ignasi Sau
,
Dimitrios M. Thilikos
Article dans une revue
lirmm-01083690
v1
|
|
Asymptotic enumeration of non-crossing partitions on surfaces
Dimitrios M. Thilikos
,
Ignasi Sau
,
Juanjo Rué
Article dans une revue
lirmm-00804780
v1
|
|
On approximating the $d$-girth of a graph
David Peleg
,
Ignasi Sau
,
Mordechai Shalom
Article dans une revue
lirmm-01272717
v1
|
|
On the approximability of some degree-constrained subgraph problems
Omid Amini
,
David Peleg
,
Stéphane Pérennes
,
Ignasi Sau
,
Saket Saurabh
Article dans une revue
lirmm-00736702
v1
|
|
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
George B. Mertzios
,
Ignasi Sau
,
Mordechai Shalom
,
Shmuel Zaks
Article dans une revue
lirmm-00736699
v1
|
|
Parameterized complexity of finding small degree-constrained subgraphs
Omid Amini
,
Ignasi Sau
,
Saket Saurabh
Article dans une revue
lirmm-00736517
v1
|
|
GMPLS Label Space Minimization through Hypergraph Layouts
Jean-Claude Bermond
,
David Coudert
,
Joanna Moulierac
,
Stéphane Pérennes
,
Ignasi Sau
et al.
Article dans une revue
hal-00706260
v1
|
|
Fast Minor Testing in Planar Graphs
Isolde Adler
,
Frederic Dorn
,
Fedor V. Fomin
,
Ignasi Sau
,
Dimitrios M. Thilikos
Article dans une revue
istex
lirmm-00904515
v1
|
|
Simpler multicoloring of triangle-free hexagonal graphs
Ignasi Sau
,
Petra Šparl
,
Janez Žerovnik
Article dans une revue
lirmm-00736521
v1
|
|
Circuits in graphs through a prescribed set of ordered vertices
David Coudert
,
Frédéric Giroire
,
Ignasi Sau
Article dans une revue
inria-00585561
v1
|
|
On self-duality of branchwidth in graphs of bounded genus
Ignasi Sau
,
Dimitrios M. Thilikos
Article dans une revue
lirmm-00736520
v1
|
|
The Recognition of Tolerance and Bounded Tolerance Graphs
George B. Mertzios
,
Ignasi Sau
,
Shmuel Zaks
Article dans une revue
lirmm-00736512
v1
|
|
Traffic grooming in bidirectional WDM ring networks
Jean-Claude Bermond
,
Xavier Muñoz
,
Ignasi Sau
Article dans une revue
hal-00643800
v1
|
|
Faster parameterized algorithms for minor containment
Isolde Adler
,
Frederic Dorn
,
Fedor V. Fomin
,
Ignasi Sau
,
Dimitrios M. Thilikos
Article dans une revue
istex
lirmm-00736522
v1
|
|
Edge-Partitioning Regular Graphs for Ring Traffic Grooming with a Priori Placement of the ADMs
Xavier Muñoz
,
Zhentao Li
,
Ignasi Sau
Article dans une revue
lirmm-00736697
v1
|
|
DROP COST AND WAVELENGTH OPTIMAL TWO-PERIOD GROOMING WITH RATIO 4∗
Jean-Claude Bermond
,
Charles J. Colbourn
,
Lucia Gionfriddo
,
Gaetano Quattrocchi
,
Ignasi Sau
SIAM Journal on Discrete Mathematics, 2010, 24 (2), pp.400-419
Article dans une revue
inria-00505516
v1
|
|
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
Ignasi Sau
,
Dimitrios M. Thilikos
Article dans une revue
lirmm-00736490
v1
|
|
Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4
Jean-Claude Bermond
,
Charles J. Colbourn
,
Lucia Gionfriddo
,
Gaetano Quattrocchi
,
Ignasi Sau
Article dans une revue
lirmm-00736478
v1
|
|
An optimal permutation routing algorithm on full-duplex hexagonal networks
Ignasi Sau
,
Janez Žerovnik
Discrete Mathematics and Theoretical Computer Science, 2008, Vol. 10 no. 3 (3), pp.49--62. ⟨10.46298/dmtcs.443⟩
Article dans une revue
hal-00972334
v1
|