Ignasi Sau
Orcid: 0000-0002-8981-9287Affiliations:
- CNRS, LIRMM, Montpellier, France
According to our database1,
Ignasi Sau
authored at least 108 papers
between 2008 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on lirmm.fr
On csauthors.net:
Bibliography
2023
Discret. Appl. Math., October, 2023
SIAM J. Comput., August, 2023
J. Comb. Theory, Ser. B, July, 2023
Algorithmica, February, 2023
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
Proceedings of the 31st Annual European Symposium on Algorithms, 2023
2022
Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel.
SIAM J. Discret. Math., December, 2022
A relaxation of the Directed Disjoint Paths problem: A global congestion metric helps.
Theor. Comput. Sci., 2022
ACM Trans. Algorithms, 2022
Algorithmica, 2022
2021
J. Comb. Optim., 2021
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization.
Algorithmica, 2021
Algorithmica, 2021
A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021
2020
Theor. Comput. Sci., 2020
SIAM J. Discret. Math., 2020
Parameterized complexity of finding a spanning tree with minimum reload cost diameter.
Networks, 2020
J. Comput. Syst. Sci., 2020
Algorithmica, 2020
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020
Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020
2019
Theor. Comput. Sci., 2019
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019
Discret. Appl. Math., 2019
How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?
Algorithmica, 2019
2018
On the (parameterized) complexity of recognizing well-covered (<i>r</i>, <i>ℓ</i>)-graph.
Theor. Comput. Sci., 2018
J. Discrete Algorithms, 2018
Discret. Math. Theor. Comput. Sci., 2018
Discret. Math., 2018
Algorithmica, 2018
Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018
Some Contributions to Parameterized Complexity. (Quelques Contributions en Complexité Paramétrée).
, 2018
2017
Theor. Comput. Sci., 2017
Theor. Comput. Sci., 2017
Theory Comput. Syst., 2017
J. Comput. Syst. Sci., 2017
J. Comput. Syst. Sci., 2017
Inf. Process. Lett., 2017
Electron. Notes Discret. Math., 2017
Improved kernels for Signed Max Cut parameterized above lower bound on (r, l)-graphs.
Discret. Math. Theor. Comput. Sci., 2017
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017
Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017
2016
ACM Trans. Algorithms, 2016
Proceedings of the Combinatorial Optimization and Applications, 2016
Proceedings of the Algorithmic Aspects in Information and Management, 2016
2015
Theor. Comput. Sci., 2015
An O(\log \mathrmOPT) O ( log OPT ) -Approximation for Covering/Packing Minor Models of θ _r θ r.
Proceedings of the Approximation and Online Algorithms - 13th International Workshop, 2015
2014
2013
2012
IEEE/ACM Trans. Netw., 2012
J. Discrete Algorithms, 2012
Discret. Appl. Math., 2012
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012
2011
Edge-Partitioning Regular Graphs for Ring Traffic Grooming with a Priori Placement of the ADMs.
SIAM J. Discret. Math., 2011
Discret. Appl. Math., 2011
2010
SIAM J. Discret. Math., 2010
J. Interconnect. Networks, 2010
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs.
J. Discrete Algorithms, 2010
Proceedings of the Structural Information and Communication Complexity, 2010
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010
2009
SIAM J. Discret. Math., 2009
Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs.
Electron. Notes Discret. Math., 2009
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009
Proceedings of the Structural Information and Communication Complexity, 2009
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009
2008
Discret. Math. Theor. Comput. Sci., 2008
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008
Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008