@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} } @article {1172, title = {On the minimum and maximum selective graph coloring problems in some graph classes}, journal = {Discrete Applied Mathematics}, volume = {204}, year = {2016}, pages = {77{\textendash}89}, author = {Demange, Marc and Ekim, Tinaz and Ries, Bernard} } @article {demange2014efficient, title = {Efficient recognition of equimatchable graphs}, journal = {Information Processing Letters}, volume = {114}, number = {1}, year = {2014}, pages = {66{\textendash}71}, publisher = {Elsevier}, author = {Demange, Marc and Ekim, Tinaz} } @article {demange2013hardness, title = {Hardness and approximation of minimum maximal matchings}, journal = {International Journal of Computer Mathematics}, number = {ahead-of-print}, year = {2013}, pages = {1{\textendash}20}, publisher = {Taylor \& Francis}, author = {Demange, Marc and Ekim, Tinaz and Tanasescu, Cerasela} } @article {demange2013note, title = {A note on the NP-hardness of two matching problems in induced subgrids}, journal = {Discrete Mathematics and Theoretical Computer Science}, volume = {15}, number = {2}, year = {2013}, pages = {233{\textendash}242}, author = {Demange, Marc and Ekim, Tinaz and others} } @article {demange2009tutorial, title = {A tutorial on the use of graph coloring for some problems in robotics}, journal = {European Journal of Operational Research}, volume = {192}, number = {1}, year = {2009}, pages = {41{\textendash}55}, publisher = {North-Holland}, author = {Demange, Marc and Ekim, Tinaz and de Werra, Dominique} } @article {demange2008minimum, title = {Minimum maximal matching is NP-hard in regular bipartite graphs}, journal = {Theory and Applications of Models of Computation}, year = {2008}, pages = {364{\textendash}374}, publisher = {Springer}, author = {Demange, Marc 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 {demange2005p, title = {(p, k)-coloring problems in line graphs}, journal = {Theoretical computer science}, volume = {349}, number = {3}, year = {2005}, pages = {462{\textendash}474}, publisher = {Elsevier}, author = {Demange, Marc and Ekim, Tinaz and de Werra, Dominique} } @article {demange2005partitioning, title = {Partitioning cographs into cliques and stable sets}, journal = {Discrete Optimization}, volume = {2}, number = {2}, year = {2005}, pages = {145{\textendash}153}, publisher = {Elsevier}, author = {Demange, Marc and Ekim, Tinaz and de Werra, Dominique} }