Iterated Type Partitions

DOI10.1007/978-3-030-48966-3_15OpenAlexW3032361217MaRDI QIDQ5041190

Gennaro Cordasco, Adele A. Rescigno, Luisa Gargano

Publication date: 13 October 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.08122

zbMATH Keywords

parameterized complexityneighborhood diversityW[1-hardness]fixed-parameter tractable algorithmsmodular-width

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (4)

Immunization in the threshold model: a parameterized complexity study ⋮ Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization ⋮ Parameterized complexity for iterated type partitions and modular-width ⋮ Spanning trees with few branch vertices in graphs of bounded neighborhood diversity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of conflict-free colorings of graphs
• Parameterized complexity of coloring problems: treewidth versus vertex cover
• On the complexity of some colorful problems parameterized by treewidth
• Equitable colorings of bounded treewidth graphs
• Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity
• Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
• Bin packing with fixed number of bins revisited
• Linear time solvable optimization problems on graphs of bounded clique-width
• Partitioning graphs into induced subgraphs
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems
• The Monotone Circuit Value Problem with Bounded Genus Is in NC
• Parameterized Algorithms for Modular-Width
• Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width
• Metric Dimension of Bounded Width Graphs
• Integer Programming with a Fixed Number of Variables
• Intractability of Clique-Width Parameterizations
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• Clique-Width is NP-Complete
• Algorithmic Meta-theorems for Restrictions of Treewidth
• Graph Layout Problems Parameterized by Vertex Cover
• Total domination in graphs
• Evangelism in social networks: Algorithms and complexity
• Integer Programming in Parameterized Complexity: Three Miniatures.
• Transitiv orientierbare Graphen

This page was built for publication: Iterated Type Partitions