Ignasi Sau

Documents

Identifiants chercheurs

ignasi-sau
0000-0002-8981-9287
IdRef : 137767420

Présentation

Publications

43303

	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 Journal of Computer and System Sciences, 2023, 136, pp.63-87. ⟨10.1016/j.jcss.2023.03.003⟩ Article dans une revue lirmm-04107607v1
	k-apices of minor-closed graph classes. I. Bounding the obstructions Ignasi Sau , Giannos Stamoulis , Dimitrios M. Thilikos Journal of Combinatorial Theory, Series B, 2023, 161, pp.180-227. ⟨10.1016/j.jctb.2023.02.012⟩ Article dans une revue lirmm-04028310v1
	Target set selection with maximum activation time Lucas Keiler , Carlos Vinicius Gomes Costa Lima , Ana Karolinna Maia , Rudini Sampaio , Ignasi Sau Discrete Applied Mathematics, 2023, 338, pp.199-217. ⟨10.1016/j.dam.2023.06.004⟩ Article dans une revue lirmm-04140763v1
	Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm Julien Baste , Ignasi Sau , Dimitrios M. Thilikos SIAM Journal on Computing, 2023, 52 (4), pp.865-912. ⟨10.1137/21M140482X⟩ Article dans une revue lirmm-04171495v1
	Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets Júlio Araújo , Marin Bougeret , Victor Campos , Ignasi Sau Algorithmica, 2023, 85 (2), pp.444-491. ⟨10.1007/s00453-022-01036-5⟩ Article dans une revue lirmm-04028295v1
	k-apices of Minor-closed Graph Classes. II. Parameterized Algorithms Ignasi Sau , Giannos Stamoulis , Dimitrios M. Thilikos ACM Transactions on Algorithms, 2022, 18 (3), pp.1-30. ⟨10.1145/3519028⟩ Article dans une revue hal-03835923v1
	Introducing lop-Kernels: A Framework for Kernelization Lower Bounds Júlio Araújo , Marin Bougeret , Victor Campos , Ignasi Sau Algorithmica, 2022, 84 (11), pp.3365-3406. ⟨10.1007/s00453-022-00979-z⟩ Article dans une revue lirmm-03991247v1
	A relaxation of the Directed Disjoint Paths problem: A global congestion metric helps Raul Lopes , Ignasi Sau Theoretical Computer Science, 2022, 898, pp.75-91. ⟨10.1016/j.tcs.2021.10.023⟩ Article dans une revue lirmm-03772271v1
	Adapting the Directed Grid Theorem into an FPT Algorithm Victor Campos , Raul Lopes , Ana Karolinna Maia , Ignasi Sau SIAM Journal on Discrete Mathematics, 2022, 36 (3), pp.1887-1917. ⟨10.1137/21m1452664⟩ Article dans une revue lirmm-04028302v1
	Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel Marin Bougeret , Bart M P Jansen , Ignasi Sau SIAM Journal on Discrete Mathematics, 2022, 36 (4), pp.2737-2773. ⟨10.1137/21m1400766⟩ Article dans une revue lirmm-04028294v1
	Hitting forbidden induced subgraphs on bounded treewidth graphs Ignasi Sau , Uéverton dos Santos Souza Information and Computation, 2021, 281, pp.104812. ⟨10.1016/j.ic.2021.104812⟩ Article dans une revue lirmm-03772257v1
	Coloring Problems on Bipartite Graphs of Small Diameter Victor A Campos , Guilherme C.M. Gomes , Allen Ibiapina , Raul Lopes , Ignasi Sau The Electronic Journal of Combinatorics, 2021, 28 (2), pp.#P2.14. ⟨10.37236/9931⟩ Article dans une revue lirmm-03374527v1
	On the complexity of finding large odd induced subgraphs and odd colorings Rémy Belmonte , Ignasi Sau Algorithmica, 2021, 83 (8), pp.2351-2373. ⟨10.1007/s00453-021-00830-x⟩ Article dans une revue lirmm-03374591v1
	Reducing graph transversals via edge contractions Paloma T Lima , Vinicius F dos Santos , Ignasi Sau , Uéverton S Souza Journal of Computer and System Sciences, 2021, 120, pp.62-74. ⟨10.1016/j.jcss.2021.03.003⟩ Article dans une revue lirmm-03374537v1
	Target set selection with maximum activation time Lucas Keiler , Carlos V.G.C. Lima , Ana Karolinna Maia , Rudini Sampaio , Ignasi Sau Procedia Computer Science, 2021, 195, pp.86-96. ⟨10.1016/j.procs.2021.11.014⟩ Article dans une revue lirmm-03772657v1
	A Unifying Model for Locally Constrained Spanning Tree Problems Luiz Alberto Do Carmo Viana , Manoel Campêlo , Ignasi Sau , Ana Silva Journal of Combinatorial Optimization, 2021, 42 (1), pp.125-150. ⟨10.1007/s10878-021-00740-2⟩ Article dans une revue lirmm-03374555v1
	Finding Cuts of Bounded Degree Guilherme C M Gomes , Ignasi Sau Algorithmica, 2021, 83 (6), pp.1677-1706. ⟨10.1007/s00453-021-00798-8⟩ Article dans une revue lirmm-03374542v1
	Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds Julien Baste , Ignasi Sau , Dimitrios M. Thilikos SIAM Journal on Discrete Mathematics, 2020, 34 (3), pp.1623-1648. ⟨10.1137/19M1287146⟩ Article dans une revue lirmm-02989921v1
	Parameterized complexity of finding a spanning tree with minimum reload cost diameter Julien Baste , Didem Gözüpek , Christophe Paul , Ignasi Sau , Mordechai Shalom Networks, 2020, 75 (3), pp.259-277. ⟨10.1002/net.21923⟩ Article dans une revue lirmm-02989889v1
	Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms Julien Baste , Ignasi Sau , Dimitrios M. Thilikos Theoretical Computer Science, 2020, 814, pp.135-152. ⟨10.1016/j.tcs.2020.01.026⟩ Article dans une revue lirmm-02989928v1
	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 Algorithmica, 2020, 82 (8), pp.2316-2336. ⟨10.1007/s00453-020-00686-7⟩ Article dans une revue lirmm-02989870v1
	Hitting minors on bounded treewidth graphs. III. Lower bounds Julien Baste , Ignasi Sau , Dimitrios M. Thilikos Journal of Computer and System Sciences, 2020, 109, pp.56-77. ⟨10.1016/j.jcss.2019.11.002⟩ Article dans une revue lirmm-02989938v1
	Weighted proper orientations of trees and graphs of bounded treewidth Julio Araujo , Cláudia Linhares Sales , Ignasi Sau , Ana Silva Theoretical Computer Science, 2019, 771, pp.39-48. ⟨10.1016/j.tcs.2018.11.013⟩ Article dans une revue lirmm-02410622v1
	Approximating maximum uniquely restricted matchings in bipartite graphs Julien Baste , Dieter Rautenbach , Ignasi Sau Discrete Applied Mathematics, 2019, 267, pp.30-40. ⟨10.1016/j.dam.2019.04.024⟩ Article dans une revue lirmm-02410617v1
	Upper bounds on the uniquely restricted chromatic index Julien Baste , Dieter Rautenbach , Ignasi Sau Journal of Graph Theory, 2019, 91 (3), pp.251-258. ⟨10.1002/jgt.22429⟩ Article dans une revue lirmm-02412578v1
	Adapting The Directed Grid Theorem into an FPT Algorithm Victor Campos , Raul Lopes , Ana Karolinna Maia de Oliviera , Ignasi Sau Electronic Notes in Theoretical Computer Science, 2019, 346, pp.229-240. ⟨10.1016/j.entcs.2019.08.021⟩ Article dans une revue lirmm-02410620v1
	Counting Gallai 3-colorings of complete graphs Josefran de Oliveira Bastos , Fabrício Siqueira Benevides , Guilherme Oliveira Mota , Ignasi Sau Discrete Mathematics, 2019, 342 (9), pp.2618-2631. ⟨10.1016/j.disc.2019.05.015⟩ Article dans une revue lirmm-02410619v1
	How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs? Marin Bougeret , Ignasi Sau Algorithmica, 2019, 81 (10), pp.4043-4068. ⟨10.1007/s00453-018-0468-8⟩ Article dans une revue lirmm-02410618v1

	Compound Logics for Modification Problems Fedor V. Fomin , Petr A. Golovach , Ignasi Sau , Giannos Stamoulis , Dimitrios M. Thilikos ICALP 2023 - 50th International Colloquium on Automata, Languages and Programming, Jul 2023, Paderborn, Germany. pp.1-21, ⟨10.4230/LIPIcs.ICALP.2023.51⟩ Communication dans un congrès lirmm-04253801v1
	Faster parameterized algorithms for modification problems to minor-closed classes Laure Morelle , Ignasi Sau , Giannos Stamoulis , Dimitrios M. Thilikos ICALP 2023 - 50th International Colloquium on Automata, Languages and Programming, Jul 2023, Paderborn, Germany. pp.93:1-93:19, ⟨10.4230/LIPIcs.ICALP.2023.93⟩ Communication dans un congrès lirmm-04253814v1
	Reducing the Vertex Cover Number via Edge Contraction Paloma T. Lima , Vinicius Fernandes dos Santos , Ignasi Sau , Uéverton dos Santos Souza , Prafullkumar Tale MFCS 2022 - 47th International Symposium on Mathematical Foundations of Computer Science, Aug 2022, Vienna, Austria. pp.69:1-69:14, ⟨10.4230/LIPIcs.MFCS.2022.69⟩ Communication dans un congrès lirmm-03772619v1
	A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover Júlio Araújo , Marin Bougeret , Victor Campos , Ignasi Sau IPEC 2021 - 16th International Symposium on Parameterized and Exact Computation, Sep 2021, Virtual, Portugal. pp.4:1-4:19, ⟨10.4230/LIPIcs.IPEC.2021.4⟩ Communication dans un congrès lirmm-03526704v1
	Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs Ignasi Sau , Uéverton dos Santos Souza MFCS 2020 - 45th International Symposium on Mathematical Foundations of Computer Science, Aug 2020, Prague, Czech Republic. pp.82:1-82:15, ⟨10.4230/LIPIcs.MFCS.2020.82⟩ Communication dans un congrès lirmm-02991913v1
	A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps Raul Lopes , Ignasi Sau MFCS 2020 - 45th International Symposium on Mathematical Foundations of Computer Science, Aug 2020, Prague, Czech Republic. pp.68:1-68:15, ⟨10.4230/LIPIcs.MFCS.2020.68⟩ Communication dans un congrès lirmm-02991855v1
	Reducing Graph Transversals via Edge Contractions Paloma T. Lima , Vinicius Fernandes dos Santos , Ignasi Sau , Uéverton dos Santos Souza MFCS 2020 - 45th International Symposium on Mathematical Foundations of Computer Science, Aug 2020, Prague, Czech Republic. pp.64:1-64:15, ⟨10.4230/LIPIcs.MFCS.2020.64⟩ Communication dans un congrès lirmm-02991812v1
	Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel Marin Bougeret , Bart M P Jansen , Ignasi Sau ICALP 2020 - 47th International Colloquium on Automata, Languages, and Programming, Jul 2020, Saarbrücken, Germany. pp.16:1--16:19, ⟨10.4230/LIPIcs.ICALP.2020.16⟩ Communication dans un congrès lirmm-02991230v1
	An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes Ignasi Sau , Giannos Stamoulis , Dimitrios M. Thilikos ICALP 2020 - 47th International Colloquium on Automata, Languages, and Programming, Jul 2020, Saarbrücken, Germany. pp.95:1-95:20, ⟨10.4230/LIPIcs.ICALP.2020.95⟩ Communication dans un congrès lirmm-02991704v1
	On the complexity of finding large odd induced subgraphs and odd colorings Rémy Belmonte , Ignasi Sau WG 2020 - 46th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2020, Leeds, United Kingdom. pp.67-79, ⟨10.1007/978-3-030-60440-0_6⟩ Communication dans un congrès lirmm-02991977v1
	Dual parameterization of Weighted Coloring Julio Araujo , Victor Campos , Carlos Vinícius G. C. Lima , Vinicius Fernandes dos Santos , Ignasi Sau IPEC 2018 - 13th International Symposium on Parameterized and Exact Computation, Aug 2018, Helsinki, Finland. pp.12:1--12:14, ⟨10.4230/LIPIcs.IPEC.2018.12⟩ Communication dans un congrès lirmm-02410739v1
	A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth Julien Baste , Ignasi Sau , Dimitrios M. Thilikos IPEC 2018 - 13th International Symposium on Parameterized and Exact Computation, Aug 2018, Helsinki, Finland. pp.2:1--2:13, ⟨10.4230/LIPIcs.IPEC.2018.2⟩ Communication dans un congrès lirmm-02342806v1

Ignasi Sau

Présentation

Publications

Reducing the vertex cover number via edge contractions

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

Target set selection with maximum activation time

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

Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets

k-apices of Minor-closed Graph Classes. II. Parameterized Algorithms

Introducing lop-Kernels: A Framework for Kernelization Lower Bounds

A relaxation of the Directed Disjoint Paths problem: A global congestion metric helps

Adapting the Directed Grid Theorem into an FPT Algorithm

Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel

Hitting forbidden induced subgraphs on bounded treewidth graphs

Coloring Problems on Bipartite Graphs of Small Diameter

On the complexity of finding large odd induced subgraphs and odd colorings

Reducing graph transversals via edge contractions

Target set selection with maximum activation time

A Unifying Model for Locally Constrained Spanning Tree Problems

Finding Cuts of Bounded Degree

Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds

Parameterized complexity of finding a spanning tree with minimum reload cost diameter

Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms

Dual Parameterization of Weighted Coloring

Hitting minors on bounded treewidth graphs. III. Lower bounds

Weighted proper orientations of trees and graphs of bounded treewidth

Approximating maximum uniquely restricted matchings in bipartite graphs

Upper bounds on the uniquely restricted chromatic index

Adapting The Directed Grid Theorem into an FPT Algorithm

Counting Gallai 3-colorings of complete graphs

How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?

Compound Logics for Modification Problems

Faster parameterized algorithms for modification problems to minor-closed classes

Reducing the Vertex Cover Number via Edge Contraction

A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover

Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs

A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps

Reducing Graph Transversals via Edge Contractions

Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel

An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes

On the complexity of finding large odd induced subgraphs and odd colorings

Dual parameterization of Weighted Coloring

A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth