Ignasi Sau
- Linear kernels and single-exponential algorithms via protrusion decompositions
2012/07/03 by Eun Jung Kim, Alexander Langer, Kim, Eun Jung +11 · 5 citations
Computer Science · Mathematics · #05C85 #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #Limits and Structures in Graph Theory
- Dynamic Programming for Graphs on Surfaces
2011/04/13 by Juanjo Rué, Ignasi Sau, Rué, Juanjo +3 · 3 citations
Computer Science · #05C85 #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics
- Explicit linear kernels via dynamic programming
2013/12/23 by Valentin Garnero, Christophe Paul, Garnero, Valentin +5 · 2 citations
Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #Graph Labeling and Dimension Problems
- On the complexity of finding large odd induced subgraphs and odd colorings
2020/02/14 by Rémy Belmonte, Belmonte, Rémy, Ignasi Sau +1 · 2 citations
Computer Science · Engineering · Mathematics · #05C15 #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #Limits and Structures in Graph Theory #graph theory and CDMA systems
- Parameterized Domination in Circle Graphs
2012/05/16 by Nicolás Bousquet, Daniel Gonçalves, Bousquet, Nicolas +9 · 1 citation
Computer Science · #05C10 #05C85 #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #G.2.2 #Interconnection Networks and Systems
- A Linear Kernel for Planar Red-Blue Dominating Set
2014/08/27 by Valentin Garnero, Ignasi Sau, Garnero, Valentin +3 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Limits and Structures in Graph Theory #Complexity and Algorithms in Graphs
- Explicit linear kernels for packing problems
2016/10/19 by Valentin Garnero, Garnero, Valentin, Christophe Paul +5 · 1 citation
Computer Science · Mathematics · #05C85 #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #Limits and Structures in Graph Theory
- Uniquely restricted matchings and edge colorings
2016/11/21 by Julien Baste, Baste, Julien, Dieter Rautenbach +3 · 1 citation
Computer Science · Mathematics · #05C70 #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #Limits and Structures in Graph Theory
- Target set selection with maximum activation time
2020/07/10 by Lucas Keiler, Carlos Vinicius G. C. Lima, Keiler, Lucas +7 · 1 citation
Computer Science · Mathematics · #05C15 #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #Limits and Structures in Graph Theory
- k-apices of minor-closed graph classes. II. Parameterized algorithms
2020/04/27 by Ignasi Sau, Sau, Ignasi, Giannos Stamoulis +3 · 1 citation
Computer Science · Mathematics · #05C69 #05C75 #05C83 #05C85 #68R10 #Advanced Combinatorial Mathematics #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory
- k-apices of minor-closed graph classes. I. Bounding the obstructions
2021/03/01 by Ignasi Sau, Giannos Stamoulis, Sau, Ignasi +3 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Graph theory and applications #Limits and Structures in Graph Theory
- Dynamic programming on bipartite tree decompositions
2023/09/14 by Lars Jaffke, Laure Morelle, Jaffke, Lars +5 · 1 citation
Computer Science · #Advanced Graph Theory Research #Optimization and Search Problems #Complexity and Algorithms in Graphs
- Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms
2021/03/11 by Julien Baste, Baste, Julien, Ignasi Sau +3 · 1 citation
Computer Science · Mathematics · #05C69 #05C75 #05C83 #05C85 #68R10 #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #Limits and Structures in Graph Theory
- Constant congestion linkages in polynomially strong digraphs in polynomial time
2024/09/05 by Raul Lopes, Ignasi Sau, Lopes, Raul +1 · 1 citation
Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Interconnection Networks and Systems #Optimization and Search Problems