@article {1498,
	title = {The complexity of the defensive domination problem in special graph classes},
	journal = {Discrete Mathematics},
	volume = {343},
	year = {2020},
	pages = {111665},
	abstract = {<p>A k-attack on a graph G is a set of k distinct vertices {a1,{\textellipsis},ak} which are said to be under attack. A k-attack A can be countered or defended by a subset of defender vertices X if and only if there exists an injective function f from A to X, such that either f(ai)=ai or (ai,f(ai)) is an edge of G, for all i, 1<=i<=k. Given a graph G, a subset D of V is a k-defensive dominating set of G if and only if D can counter any k-attack in G. We consider the k-defensive dominating set problem. We start a systematic study on the complexity of the k-defensive dominating set problem. When k is not fixed, we show that it is already co-NP-hard to decide whether a given set of vertices is a k-defensive dominating set or not. However, if k is fixed, then we show that the problem is NP-complete even in split graphs. Subsequently, we consider special graph classes, namely paths, cycles, co-chain graphs and threshold graphs. We show that in each of these graph classes, a k-defensive dominating set of minimum size can be found in linear time even for non-fixed k.</p>},
	keywords = {Domination, Networks, Security},
	issn = {0012-365X},
	doi = {https://doi.org/10.1016/j.disc.2019.111665},
	url = {https://www.sciencedirect.com/science/article/pii/S0012365X19303437},
	author = {Ekim, Tinaz and Arthur M. Farley and Andrzej Proskurowski}
}
@article {1507,
	title = {Complexity of the Improper Twin Edge Coloring of Graphs},
	journal = {Graphs and Combinatorics},
	volume = {33},
	year = {2017},
	pages = {595{\textendash}615},
	author = {Abedin, Paniz and Akbari, Saieed and Demange, Marc and Ekim, Tinaz}
}
@inbook {ekim2012computing,
	title = {Computing minimum geodetic sets of proper interval graphs},
	booktitle = {LATIN 2012: Theoretical Informatics},
	year = {2012},
	pages = {279{\textendash}290},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	author = {Ekim, Tinaz and Erey, Aysel and Heggernes, Pinar and van{\textquoteright}t Hof, Pim and Meister, Daniel}
}
@article {geinoz2008construction,
	title = {Construction of balanced sports schedules using partitions into subleagues},
	journal = {Operations Research Letters},
	volume = {36},
	number = {3},
	year = {2008},
	pages = {279{\textendash}282},
	publisher = {North-Holland},
	author = {Geinoz, A and Ekim, Tinaz and de Werra, Dominique}
}
@article {de2006construction,
	title = {Construction of sports schedules with multiple venues},
	journal = {Discrete Applied Mathematics},
	volume = {154},
	number = {1},
	year = {2006},
	pages = {47{\textendash}58},
	publisher = {North-Holland},
	author = {de Werra, Dominique and Ekim, Tinaz and Raess, C}
}
