Grundy Coloring and friends, half-graphs, bicliques

DOI10.1007/s00453-022-01001-2OpenAlexW4285587530MaRDI QIDQ2700380

Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora

Publication date: 21 April 2023

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-022-01001-2

zbMATH Keywords

parameterized complexityGrundy coloring\(K_{t,t}\)-free graphsETH lower boundshalf-graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs
• On the parameterized complexity of b-\textsc{chromatic number}
• Fundamentals of parameterized complexity
• Strong computational lower bounds via parameterized complexity
• Results on the Grundy chromatic number of graphs
• Some perfect coloring properties of graphs
• On-line 3-chromatic graphs. II: Critical graphs
• On the equality of the partial Grundy and upper ochromatic numbers of graphs
• Which problems have strongly exponential complexity?
• Complexity of Grundy coloring and its variants
• The Turing way to parameterized complexity
• On the Grundy and \(b\)-chromatic numbers of a graph
• FPT Algorithms for Domination in Biclique-Free Graphs
• Designing FPT Algorithms for Cut Problems Using Randomized Contractions
• Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams
• On the equality of the grundy and ochromatic numbers of a graph
• Parameterized Complexity of Independence and Domination on Geometric Graphs
• Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
• Color-coding
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• Deciding First-Order Properties of Nowhere Dense Graphs
• χ‐bounded families of oriented graphs
• Parameterized Complexity of Independent Set in H-Free Graphs.
• The Parameterized Hardness of the k-Center Problem in Transportation Networks
• Parameterized Algorithms

This page was built for publication: Grundy Coloring and friends, half-graphs, bicliques