2 citations · 2 across the 2 of their papers we have counts for
3 papers
Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation
Louis Dublois, Michael Lampis, Vangelis Th. Paschos
An upper dominating set is a minimal dominating set in a graph. In the \textsc{Upper Dominating Set} problem, the goal is to find an upper dominating set of maximum size. We study…
(In)approximability of Maximum Minimal FVS
Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei +2
We study the approximability of the NP-complete \textsc{Maximum Minimal Feedback Vertex Set} problem. Informally, this natural problem seems to lie in an intermediate space between…
New Algorithms for Mixed Dominating Set
Louis Dublois, Michael Lampis, Vangelis Th. Paschos
A mixed dominating set is a collection of vertices and edges that dominates all vertices and edges of a graph. We study the complexity of exact and parameterized algorithms for \te…