Ignasi Sau

According to our database1, Ignasi Sau authored at least 92 papers between 2008 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms.
Theor. Comput. Sci., 2020

Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds.
SIAM J. Discret. Math., 2020

Parameterized complexity of finding a spanning tree with minimum reload cost diameter.
Networks, 2020

Hitting minors on bounded treewidth graphs. III. Lower bounds.
J. Comput. Syst. Sci., 2020

Adapting the Directed Grid Theorem into an FPT Algorithm.
CoRR, 2020

Target set selection with maximum activation time.
CoRR, 2020

A Unifying Model for Locally Constrained Spanning Tree Problems.
CoRR, 2020

Coloring Problems on Bipartite Graphs of Small Diameter.
CoRR, 2020

On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths.
Algorithmica, 2020

Dual Parameterization of Weighted Coloring.
Algorithmica, 2020

On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 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

Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Reducing Graph Transversals via Edge Contractions.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes.
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
Weighted proper orientations of trees and graphs of bounded treewidth.
Theor. Comput. Sci., 2019

Upper bounds on the uniquely restricted chromatic index.
J. Graph Theory, 2019

Adapting The Directed Grid Theorem into an FPT Algorithm.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Counting Gallai 3-colorings of complete graphs.
Discret. Math., 2019

Approximating maximum uniquely restricted matchings in bipartite graphs.
Discret. Appl. Math., 2019

Explicit Linear Kernels for Packing Problems.
Algorithmica, 2019

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

Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization.
Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

2018
On the (parameterized) complexity of recognizing well-covered (<i>r</i>, <i>ℓ</i>)-graph.
Theor. Comput. Sci., 2018

A Tight Erdös-Pósa Function for Wheel Minors.
SIAM J. Discret. Math., 2018

Complexity dichotomies for the MinimumF-Overlay problem.
J. Discrete Algorithms, 2018

On the number of labeled graphs of bounded treewidth.
Eur. J. Comb., 2018

A Linear Kernel for Planar Total Dominating Set.
Discret. Math. Theor. Comput. Sci., 2018

Improved FPT algorithms for weighted independent set in bull-free graphs.
Discret. Math., 2018

An FPT 2-Approximation for Tree-Cut Decomposition.
Algorithmica, 2018

An O(log OPT)-Approximation for Covering and Packing Minor Models of θ<sub>r</sub>.
Algorithmica, 2018

A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth.
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
On the complexity of computing the k-restricted edge-connectivity of a graph.
Theor. Comput. Sci., 2017

Parameterized complexity of the MINCCA problem on graphs of bounded decomposability.
Theor. Comput. Sci., 2017

Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion.
Theory Comput. Syst., 2017

Parameterized algorithms for min-max multiway cut and list digraph homomorphism.
J. Comput. Syst. Sci., 2017

A polynomial-time algorithm for Outerplanar Diameter Improvement.
J. Comput. Syst. Sci., 2017

On the parameterized complexity of the Edge Monitoring problem.
Inf. Process. Lett., 2017

Maximum Cuts in Edge-colored Graphs.
Electron. Notes Discret. Math., 2017

Ruling out FPT algorithms for Weighted Coloring on forests.
Electron. Notes Discret. Math., 2017

Minors in graphs of large ϴ<sub>r</sub>-girth.
Eur. J. Comb., 2017

Improved kernels for Signed Max Cut parameterized above lower bound on (r, l)-graphs.
Discret. Math. Theor. Comput. Sci., 2017

A linear kernel for planar red-blue dominating set.
Discret. Appl. Math., 2017

Hitting minors on bounded treewidth graphs.
CoRR, 2017

Uniquely Restricted Matchings and Edge Colorings.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth.
Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

Complexity Dichotomies for the Minimum ℱ -Overlay Problem.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

2016
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions.
ACM Trans. Algorithms, 2016

An edge variant of the Erdős-Pósa property.
Discret. Math., 2016

On the (Parameterized) Complexity of Recognizing Well-Covered (r, l)-graphs.
Proceedings of the Combinatorial Optimization and Applications, 2016

Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees.
Proceedings of the Algorithmic Aspects in Information and Management, 2016

2015
The role of planarity in connectivity problems parameterized by treewidth.
Theor. Comput. Sci., 2015

Explicit Linear Kernels via Dynamic Programming.
SIAM J. Discret. Math., 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
Dynamic programming for graphs on surfaces.
ACM Trans. Algorithms, 2014

Hitting and Harvesting Pumpkins.
SIAM J. Discret. Math., 2014

Parameterized Domination in Circle Graphs.
Theory Comput. Syst., 2014

2013
Asymptotic enumeration of non-crossing partitions on surfaces.
Discret. Math., 2013

On approximating the <i>d</i>-girth of a graph.
Discret. Appl. Math., 2013

2012
Placing regenerators in optical networks to satisfy multiple sets of requests.
IEEE/ACM Trans. Netw., 2012

GMPLS label space minimization through hypergraph layouts.
Theor. Comput. Sci., 2012

Parameterized complexity of finding small degree-constrained subgraphs.
J. Discrete Algorithms, 2012

Simpler multicoloring of triangle-free hexagonal graphs.
Discret. Math., 2012

On the approximability of some degree-constrained subgraph problems.
Discret. Appl. Math., 2012

Fast Minor Testing in Planar Graphs.
Algorithmica, 2012

Dynamic Programming for H-minor-free Graphs.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011
Faster parameterized algorithms for minor containment.
Theor. Comput. Sci., 2011

Edge-Partitioning Regular Graphs for Ring Traffic Grooming with a Priori Placement of the ADMs.
SIAM J. Discret. Math., 2011

The Recognition of Tolerance and Bounded Tolerance Graphs.
SIAM J. Comput., 2011

Traffic grooming in bidirectional WDM ring networks.
Networks, 2011

On self-duality of branchwidth in graphs of bounded genus.
Discret. Appl. Math., 2011

2010
Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4.
SIAM J. Discret. Math., 2010

Circuits in Graphs through a prescribed Set of Ordered vertices.
J. Interconnect. Networks, 2010

Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs.
J. Discrete Algorithms, 2010

Traffic Grooming in Star Networks via Matching Techniques.
Proceedings of the Structural Information and Communication Complexity, 2010

Permutation Routing and (<i>ℓ</i>, <i>k</i>)-Routing on Plane Grids.
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

Traffic Grooming: Combinatorial Results and Practical Resolutions.
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

2009
Hardness and approximation of traffic grooming.
Theor. Comput. Sci., 2009

A New Intersection Model and Improved Algorithms for Tolerance Graphs.
SIAM J. Discret. Math., 2009

(<i>l</i>, k)-ROUTING ON PLANE GRIDS.
J. Interconnect. Networks, 2009

Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs.
Electron. Notes Discret. Math., 2009

Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Designing Hypergraph Layouts to GMPLS Routing Strategies.
Proceedings of the Structural Information and Communication Complexity, 2009

MPLS Label Stacking on the Line Network.
Proceedings of the NETWORKING 2009, 2009

Edge-Simple Circuits through 10 Ordered Vertices in Square Grids.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008
An Optimal Permutation Routing Algorithm on Full-Duplex Hexagonal Networks.
Discret. Math. Theor. Comput. Sci., 2008

Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

Degree-Constrained Subgraph Problems: Hardness and Approximation Results.
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem.
Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008


  Loading...