Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs

Algorithmica ◽  
2002 ◽  
Vol 33 (4) ◽  
pp. 461-493 ◽  
Author(s):  
J. Alber ◽  
H. L. Bodlaender ◽  
H. Fernau ◽  
T. Kloks ◽  
R. Niedermeier
2019 ◽  
Vol 15 (3) ◽  
pp. 1-18 ◽  
Author(s):  
Saeed Akhoondian Amiri ◽  
Stefan Schmid ◽  
Sebastian Siebertz
Keyword(s):  

Author(s):  
Erik D. Demaine ◽  
Fedor V. Fomin ◽  
Mohammad Taghi Hajiaghayi ◽  
Dimitrios M. Thilikos

Author(s):  
Jochen Alber ◽  
Hongbing Fan ◽  
Michael R. Fellows ◽  
Henning Fernau ◽  
Rolf Niedermeier ◽  
...  

2014 ◽  
Vol 56 (2) ◽  
pp. 330-346 ◽  
Author(s):  
Bruno Escoffier ◽  
Jérôme Monnot ◽  
Vangelis Th. Paschos ◽  
Mingyu Xiao

2020 ◽  
Vol 49 (4) ◽  
pp. 772-810
Author(s):  
Parinya Chalermsook ◽  
Marek Cygan ◽  
Guy Kortsarz ◽  
Bundit Laekhanukit ◽  
Pasin Manurangsi ◽  
...  

2005 ◽  
Vol 1 (1) ◽  
pp. 33-47 ◽  
Author(s):  
Erik D. Demaine ◽  
Fedor V. Fomin ◽  
Mohammadtaghi Hajiaghayi ◽  
Dimitrios M. Thilikos

2008 ◽  
Vol 17 (2) ◽  
pp. 287-295 ◽  
Author(s):  
VADIM LOZIN

We analyse classes of planar graphs with respect to various properties such as polynomial-time solvability of thedominating setproblem or boundedness of the tree-width. A helpful tool to address this question is the notion of boundary classes. The main result of the paper is that for many important properties there are exactly two boundary classes of planar graphs.


2011 ◽  
Vol 412 (50) ◽  
pp. 6982-7000 ◽  
Author(s):  
Marek Cygan ◽  
Geevarghese Philip ◽  
Marcin Pilipczuk ◽  
Michał Pilipczuk ◽  
Jakub Onufry Wojtaszczyk

Sign in / Sign up

Export Citation Format

Share Document