- 60
- 39
- 11
- 8
- 6
- 5
- 4
- 2
Ignasi Sau
135
Documents
Researcher identifiers
ignasi-sau
-
0000-0002-8981-9287
- IdRef : 137767420
Presentation
See also : <http://www.lirmm.fr/~sau/Pubs.html>
Publications
- 52
- 24
- 17
- 16
- 12
- 9
- 9
- 7
- 7
- 6
- 6
- 6
- 6
- 6
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 42
- 23
- 22
- 10
- 9
- 8
- 8
- 7
- 7
- 7
- 7
- 6
- 6
- 6
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 122
- 13
- 5
- 4
- 2
- 1
- 11
- 10
- 9
- 7
- 5
- 5
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 5
- 6
- 8
- 14
- 8
- 14
- 16
- 9
- 8
- 7
- 5
- 8
- 8
- 7
- 7
- 1
- 3
- 1
- 53
- 37
- 12
- 11
- 3
- 3
- 2
- 1
- 2
- 1
- 1
|
Reducing the Vertex Cover Number via Edge ContractionMFCS 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⟩
Conference papers
lirmm-03772619v1
|
|
A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex CoverIPEC 2021 - 16th International Symposium on Parameterized and Exact Computation, Sep 2021, Virtual, Portugal. pp.4:1-4:19, ⟨10.4230/LIPIcs.IPEC.2021.4⟩
Conference papers
lirmm-03526704v1
|
|
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundarySODA 2020 - 31st Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 2020, Salt Lake City, UT, United States. pp.951-970, ⟨10.1137/1.9781611975994.57⟩
Conference papers
lirmm-02991215v1
|
|
Reducing Graph Transversals via Edge ContractionsMFCS 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⟩
Conference papers
lirmm-02991812v1
|
|
A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric HelpsMFCS 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⟩
Conference papers
lirmm-02991855v1
|
|
An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph ClassesICALP 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⟩
Conference papers
lirmm-02991704v1
|
|
Hitting Forbidden Induced Subgraphs on Bounded Treewidth GraphsMFCS 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⟩
Conference papers
lirmm-02991913v1
|
|
On the complexity of finding large odd induced subgraphs and odd coloringsWG 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⟩
Conference papers
lirmm-02991977v1
|
|
Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial KernelICALP 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⟩
Conference papers
lirmm-02991230v1
|
|
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and KernelizationIPEC 2019 - 14th International Symposium on Parameterized and Exact Computation, Sep 2019, Munich, Germany. pp.19:1--19:15, ⟨10.4230/LIPIcs.IPEC.2019.19⟩
Conference papers
lirmm-02410703v1
|
|
On the complexity of finding internally vertex-disjoint long directed paths13th Latin American Symposium on Theoretical Informatics (LATIN), Apr 2018, Buenos Aires, Argentina. pp.66-79, ⟨10.1007/978-3-319-77404-6_6⟩
Conference papers
lirmm-02410722v1
|
|
A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by TreewidthIPEC 2018 - 13th International Symposium on Parameterized and Exact Computation, Aug 2018, Helsinki, Finland. pp.2:1--2:13, ⟨10.4230/LIPIcs.IPEC.2018.2⟩
Conference papers
lirmm-02342806v1
|
|
Dual parameterization of Weighted ColoringIPEC 2018 - 13th International Symposium on Parameterized and Exact Computation, Aug 2018, Helsinki, Finland. pp.12:1--12:14, ⟨10.4230/LIPIcs.IPEC.2018.12⟩
Conference papers
lirmm-02410739v1
|
|
How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?IPEC 2017 - 12th International Symposium on Parameterized and Exact Computation, Sep 2017, Vienne, Austria. pp.10:1--10:13, ⟨10.4230/LIPIcs.IPEC.2017.10⟩
Conference papers
lirmm-01730228v1
|
|
On the Number of Labeled Graphs of Bounded TreewidthWG 2017 - 43rd International on Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2017, Eindhoven, Netherlands. pp.88-99, ⟨10.1007/978-3-319-68705-6_7⟩
Conference papers
hal-01734085v1
|
|
Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded TreewidthIPEC 2017 - 12th International Symposium on Parameterized and Exact Computation, Sep 2017, Vienna, Austria. pp.4:1--4:12, ⟨10.4230/LIPIcs.IPEC.2017.4⟩
Conference papers
hal-01733845v1
|
|
Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost DiameterIPEC 2017 - 12th International Symposium on Parameterized and Exact Computation, Sep 2017, Vienna, Austria. pp.3:1--3:12, ⟨10.4230/LIPIcs.IPEC.2017.3⟩
Conference papers
hal-01733767v1
|
Uniquely Restricted Matchings and Edge ColoringsWG: Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2017, Eindhoven, Netherlands. pp.100-112, ⟨10.1007/978-3-319-68705-6_8⟩
Conference papers
hal-01734132v1
|
|
|
Complexity Dichotomies for the Minimum $F$-Overlay Problem28th International Workshop on Combinatorial Algorithms (IWOCA), Jul 2017, Newcastle, Australia. pp.116-127, ⟨10.1007/978-3-319-78825-8_10⟩
Conference papers
hal-01571229v1
|
|
Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic TreesAAIM: Algorithmic Aspects in Information and Management, Jul 2016, Bergamo, Italy. pp.53-64, ⟨10.1007/978-3-319-41168-2_5⟩
Conference papers
lirmm-01481368v1
|
On the (Parameterized) Complexity of Recognizing Well-Covered $(r,l)$-graphsCOCOA: Conference on Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. pp.423-437, ⟨10.1007/978-3-319-48749-6_31⟩
Conference papers
lirmm-01481787v1
|
|
|
Parameterized Complexity of the MINCCA Problem on Graphs of Bounded DecomposabilityWG 2016 - 42nd International on Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2016, Istanbul, Turkey. pp.195-206, ⟨10.1007/978-3-662-53536-3_17⟩
Conference papers
lirmm-01481360v1
|
An FPT 2-Approximation for Tree-cut DecompositionWAOA: Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.35-46, ⟨10.1007/978-3-319-28684-6_4⟩
Conference papers
lirmm-01264015v1
|
|
|
An $O(log OPT)$-Approximation for Covering/Packing Minor Models of $θ _r$WAOA: Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.122-132, ⟨10.1007/978-3-319-28684-6_11⟩
Conference papers
hal-01218496v1
|
A Polynomial-Time Algorithm for Outerplanar Diameter ImprovementCSR: Computer Science in Russia, Jul 2015, Listvyanka, Russia. pp.123-142, ⟨10.1007/978-3-319-20297-6_9⟩
Conference papers
hal-01178222v1
|
|
|
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph HomomorphismIPEC 2015 - 10th International Symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.78-89, ⟨10.4230/LIPIcs.IPEC.2015.78⟩
Conference papers
lirmm-01263999v1
|
|
The role of planarity in connectivity problems parameterized by treewidthIPEC: International symposium on Parameterized and Exact Computation, Sep 2014, Wroclaw, Poland. pp.63-74, ⟨10.1007/978-3-319-13524-3_6⟩
Conference papers
lirmm-01481432v1
|
|
Explicit linear kernels via dynamic programmingSTACS: Symposium on Theoretical Aspects of Computer Science, Mar 2014, Lyon, France. pp.312-324, ⟨10.4230/LIPIcs.STACS.2014.312⟩
Conference papers
hal-01084007v1
|
An edge variant of the Erdős-Pósa propertyICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France
Conference papers
lirmm-00904544v1
|
|
|
Covering and packing pumpkin modelsICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France
Conference papers
lirmm-01083652v1
|
|
A linear kernel for planar red-blue dominating setCTW: Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2013, Enschede, Netherlands. pp.117-120
Conference papers
lirmm-00846771v1
|
Linear Kernels and Single-exponential Algorithms via Protrusion DecompositionsICALP: International Colloquium on Automata, Languages and Programming, Jul 2013, Riga, Latvia. pp.613-624, ⟨10.1007/978-3-642-39206-1_52⟩
Conference papers
lirmm-00829999v1
|
|
|
Dynamic Programming for $H$-minor-free GraphsCOCOON: Computing and Combinatorics Conference, Aug 2012, Sydney, NSW, Australia. pp.86-97, ⟨10.1007/978-3-642-32241-9_8⟩
Conference papers
lirmm-00736708v1
|
Parameterized Domination in Circle GraphsWG 2012 - 38th International Workshop on Graph Theoretic-Concepts in Computer Science, Jun 2012, Jerusalem, Israel. pp.308-319, ⟨10.1007/978-3-642-34611-8_31⟩
Conference papers
lirmm-00738534v1
|
|
Hitting and Harvesting PumpkinsESA 2011 - 19th Annual European Symposium on Algorithms, Sep 2011, Saarbrücken, Germany. pp.394-407, ⟨10.1007/978-3-642-23719-5_34⟩
Conference papers
lirmm-00642341v1
|
|
|
On Approximating the $d$-Girth of a GraphSOFSEM, Jan 2011, Nový Smokovec, Slovakia. pp.467-481, ⟨10.1007/978-3-642-18381-2_39⟩
Conference papers
lirmm-00736705v1
|
Dynamic programming for graphs on surfacesICALP: International Colloquium on Automata, Languages and Programming, 2010, Bordeaux, France. pp.372-383
Conference papers
lirmm-00736703v1
|
|
|
Fast Minor Testing in Planar GraphsESA 2010 - 18th Annual European Symposium on Algorithms, Sep 2010, Liverpool, United Kingdom. pp.97-109, ⟨10.1007/978-3-642-15775-2_9⟩
Conference papers
lirmm-00736769v1
|
|
The Recognition of Tolerance and Bounded Tolerance Graphs27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.585-596
Conference papers
inria-00455774v1
|
|
Edge-Simple Circuits Through 10 Ordered Vertices in Square GridsInternational Workshop on Combinatorial Algorithms -- IWOCA, Jun 2009, Hradec nad Moravicì, Czech Republic
Conference papers
inria-00429146v1
|
|
Hardness of Approximating the Traffic Grooming Problem9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2007, Ile d'Oléron, France. pp.45-48
Conference papers
inria-00176960v1
|
|
Traffic Grooming in Bidirectional WDM Ring NetworksInternational Conference on Transparent Optical Networks (ICTON), Jun 2006, Nottingham, United Kingdom. pp.19 - 22, ⟨10.1109/ICTON.2006.248390⟩
Conference papers
inria-00429168v1
|
Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19-21, 2019, Revised PapersLNCS (11789), 2019, 978-3-030-30785-1. ⟨10.1007/978-3-030-30786-8⟩
Books
lirmm-02342784v1
|
Traffic Grooming: Combinatorial Results and Practical Resolutions.Arie Koster and Xavier Muñoz. Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks., XXVII, Springer, pp.63-94, 2010, EATCS Texts in Theoretical Computer Science, 978-3-642-02249-4. ⟨10.1007/978-3-642-02250-0⟩
Book sections
inria-00530964v1
|
Parameterized complexity dichotomy for $(r,\ell)$-Vertex Deletion2016
Preprints, Working Papers, ...
lirmm-01272704v1
|
|
Improved kernels for Signed Max Cut parameterized above lower bound on (r,l)-graphs2016
Preprints, Working Papers, ...
lirmm-01272714v1
|
|
On the complexity of computing the $k$-restricted edge-connectivity of a graph2016
Preprints, Working Papers, ...
lirmm-01272707v1
|
|
Optimization in Graphs under Degree Constraints. Application to Telecommunication NetworksMathematics [math]. Université Nice Sophia Antipolis; Universitat Politécnica de Catalunya, 2009. English. ⟨NNT : ⟩
Theses
tel-00429092v1
|
|
Some Contributions to Parameterized ComplexityComputer Science [cs]. Université de Montpellier, 2018
Habilitation à diriger des recherches
tel-02079241v1
|