Local linear set on graphs with bounded twin cover number

DOI10.1016/j.ipl.2021.106118OpenAlexW3145782476MaRDI QIDQ2032157

Dušan Knop

Publication date: 16 June 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2021.106118

zbMATH Keywords

graph algorithmsparameterized algorithmslocal linear constraints

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An application of simultaneous diophantine approximation in combinatorial optimization
• Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity
• Parameterized complexity of fair deletion problems
• Deconstructing parameterized hardness of Fair Vertex Deletion problems
• Integer Programming with a Fixed Number of Variables
• On Integer Programming and Convolution.
• Fair edge deletion problems

This page was built for publication: Local linear set on graphs with bounded twin cover number