The many facets of upper domination

Cristina Bazgan; Ljiljana Brankovic; Katrin Casel; Henning Fernau; Klaus Jansen; Kim-Manuel Klein; Michael Lampis; Mathieu Liedloff; Jérôme Monnot; Vangelis Th Paschos

doi:10.1016/j.tcs.2017.05.042

The many facets of upper domination

Cristina Bazgan
, Ljiljana Brankovic
, Katrin Casel
, Henning Fernau
, Klaus Jansen
, Kim-Manuel Klein
, Michael Lampis
, Mathieu Liedloff
, Jérôme Monnot
, Vangelis Th Paschos

Computer Science

Research output: Contribution to journal › Conference article › peer-review

43 Citations (Scopus)

Abstract

This paper studies Upper Domination, i.e., the problem of computing the maximum cardinality of a minimal dominating set in a graph with respect to classical and parameterised complexity as well as approximability.

Original language	English
Pages (from-to)	2-25
Journal	Theoretical Computer Science
Volume	717
Early online date	15 Jun 2017
DOIs	https://doi.org/10.1016/j.tcs.2017.05.042
Publication status	Published - 22 Mar 2018
Event	AAIM 2016: 11th International Conference on Algorithmic Aspects of Information and Management - University of Bergamo, Bergamo, Italy Duration: 18 Jul 2016 → 20 Jul 2016

Access to Document

10.1016/j.tcs.2017.05.042

https://hdl.handle.net/1959.11/51948

Handle.net

Persistent link

Cite this

@article{76761e9219624a97a054f164f46793e1,

title = "The many facets of upper domination",

abstract = "This paper studies Upper Domination, i.e., the problem of computing the maximum cardinality of a minimal dominating set in a graph with respect to classical and parameterised complexity as well as approximability.",

author = "Cristina Bazgan and Ljiljana Brankovic and Katrin Casel and Henning Fernau and Klaus Jansen and Kim-Manuel Klein and Michael Lampis and Mathieu Liedloff and J{\'e}r{\^o}me Monnot and Paschos, \{Vangelis Th\}",

note = "Alternate publication title: Selected papers presented at the 11th International Conference on Algorithmic Aspects of Information and Management (AAIM 2016); AAIM 2016: 11th International Conference on Algorithmic Aspects of Information and Management ; Conference date: 18-07-2016 Through 20-07-2016",

year = "2018",

month = mar,

day = "22",

doi = "10.1016/j.tcs.2017.05.042",

language = "English",

volume = "717",

pages = "2--25",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier BV",

}

TY - JOUR

T1 - The many facets of upper domination

AU - Bazgan, Cristina

AU - Brankovic, Ljiljana

AU - Casel, Katrin

AU - Fernau, Henning

AU - Jansen, Klaus

AU - Klein, Kim-Manuel

AU - Lampis, Michael

AU - Liedloff, Mathieu

AU - Monnot, Jérôme

AU - Paschos, Vangelis Th

N1 - Alternate publication title: Selected papers presented at the 11th International Conference on Algorithmic Aspects of Information and Management (AAIM 2016)

PY - 2018/3/22

Y1 - 2018/3/22

N2 - This paper studies Upper Domination, i.e., the problem of computing the maximum cardinality of a minimal dominating set in a graph with respect to classical and parameterised complexity as well as approximability.

AB - This paper studies Upper Domination, i.e., the problem of computing the maximum cardinality of a minimal dominating set in a graph with respect to classical and parameterised complexity as well as approximability.

U2 - 10.1016/j.tcs.2017.05.042

DO - 10.1016/j.tcs.2017.05.042

M3 - Conference article

SN - 0304-3975

VL - 717

SP - 2

EP - 25

JO - Theoretical Computer Science

JF - Theoretical Computer Science

T2 - AAIM 2016: 11th International Conference on Algorithmic Aspects of Information and Management

Y2 - 18 July 2016 through 20 July 2016

ER -

The many facets of upper domination

Abstract

Access to Document

Handle.net

Fingerprint

Cite this