Search Results - Special Issue: Algorithms and Computation*

Improving Vertex Cover as a Graph Parameter by Ganian, Robert

“…Parameterized algorithms are often used to efficiently solve NP-hard problems on graphs. In this context, vertex cover is used as a powerful parameter for…”
Get full text

The Fagnano Triangle Patrolling Problem by Georgiou, Konstantinos, Kundu, Somnath, Pralat, Pawel

“…We investigate a combinatorial optimization problem that involves patrolling the edges of an acute triangle using a unit-speed agent. The goal is to minimize…”
Get full text

On quadratic threshold CSPs by Austrin, Per, Benabbas, Siavosh, Magen, Avner

“… (Computational Complexity, 2009), we consider a natural subclass of predicates defined by signs of quadratic polynomials, including the special case of predicates defined by signs of linear forms, and supply algorithms to approximate them as follows…”
Get full text