Export 8 results:
Author Title Type [ Year(Asc)]
Filters: First Letter Of Title is P and Author is Ekim, Tinaz  [Clear All Filters]
2014
Ekim, T., NVR. Mahadev, and D. de Werra, "Polar cographs", Discrete Applied Mathematics, vol. 171, no. EPFL-ARTICLE-199582: Elsevier Science Bv, pp. 158–158, 2014.
2013
Bonomo, F., D. Cornaz, T. Ekim, and B. Ries, "Perfectness of clustered graphs", Discrete Optimization, vol. 10, no. 4: Elsevier, pp. 296–303, 2013.
Ekim, T., P. Heggernes, and D. Meister, "Polar permutation graphs are polynomial-time recognisable", European Journal of Combinatorics, vol. 34, no. 3: Academic Press, pp. 576–592, 2013.
2009
Ekim, T., and J. Gimbel, "Partitioning graphs into complete and empty graphs", Discrete Mathematics, vol. 309, no. 19: Elsevier, pp. 5849–5856, 2009.
2008
Ekim, T., N. V. R. Mahadev, and D. de Werra, "Polar cographs", Discrete Applied Mathematics, vol. 156, no. 10: North-Holland, pp. 1652–1660, 2008.
Ekim, T., P. Hell, J. Stacho, and D. de Werra, "Polarity of chordal graphs", Discrete Applied Mathematics, vol. 156, no. 13: Elsevier, pp. 2469–2479, 2008.
2005
Demange, M., T. Ekim, and D. de Werra, "(p, k)-coloring problems in line graphs", Theoretical computer science, vol. 349, no. 3: Elsevier, pp. 462–474, 2005.
Demange, M., T. Ekim, and D. de Werra, "Partitioning cographs into cliques and stable sets", Discrete Optimization, vol. 2, no. 2: Elsevier, pp. 145–153, 2005.