@article {1503,
	title = {On Almost Well-Covered Graphs of Girth at Least 6},
	journal = {Discrete Mathematics \& Theoretical Computer Science},
	volume = {20},
	year = {2018},
	author = {Milani{\v c}, Martin and Hujdurovi{\'c}, Ademir and G{\"o}z{\"u}pek, Didem and Ekim, Tinaz}
}
@article {1512,
	title = {Advances on defective parameters in graphs},
	journal = {Discrete Optimization},
	volume = {16},
	year = {2015},
	pages = {62-69},
	abstract = {<p>We consider the generalization of Ramsey numbers to the defective framework using k-dense and k-sparse sets. We construct the first tableaux for defective Ramsey numbers with exact values whenever it is known, and lower and upper bounds otherwise. In light of defective Ramsey numbers, we consider the defective cocoloring problem which consists of partitioning the vertex set of a given graph into k-sparse and k-dense sets. By the help of efficient graph generation methods, we show that c0(4)=12,c1(3)=12 and c2(2)=10 where ck(m) is the maximum order n such that all n-graphs can be k-defectively cocolored using at most m colors. We also give the numbers of k-defective m-cocritical graphs of order n (until n=10) for different levels of defectiveness and m=2,3 and 4.</p>},
	keywords = {Cocritical graphs, Defective cocoloring, Defective Ramsey numbers, Efficient graph generation},
	issn = {1572-5286},
	doi = {https://doi.org/10.1016/j.disopt.2015.01.002},
	url = {https://www.sciencedirect.com/science/article/pii/S1572528615000031},
	author = {Ahu Akdemir and Ekim, Tinaz}
}
@article {demange2006approximation,
	title = {On the approximation of Min Split-coloring and Min Cocoloring.},
	journal = {J. Graph Algorithms Appl.},
	volume = {10},
	number = {2},
	year = {2006},
	pages = {297{\textendash}315},
	author = {Demange, Marc and Ekim, Tinaz and de Werra, Dominique and others}
}
@article {ekim2004approximation,
	title = {Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximationa},
	journal = {International Journal of Computer Mathematics},
	volume = {81},
	number = {5},
	year = {2004},
	pages = {569{\textendash}582},
	publisher = {Taylor \& Francis Group},
	author = {Ekim, Tinaz and Paschos, Vangelis Th}
}
