Export 9 results:
Author Title Type [ Year] Filters: Author is Ekim, Tinaz and First Letter Of Title is P [Clear All Filters]
"A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs",
Information Processing Letters, vol. 121, pp. 29-33, 2017.
"Polar cographs",
Discrete Applied Mathematics, vol. 171, no. EPFL-ARTICLE-199582: Elsevier Science Bv, pp. 158–158, 2014.
"Perfectness of clustered graphs",
Discrete Optimization, vol. 10, no. 4: Elsevier, pp. 296–303, 2013.
"Polar permutation graphs are polynomial-time recognisable",
European Journal of Combinatorics, vol. 34, no. 3: Academic Press, pp. 576–592, 2013.
"Partitioning graphs into complete and empty graphs",
Discrete Mathematics, vol. 309, no. 19: Elsevier, pp. 5849–5856, 2009.
"Polar cographs",
Discrete Applied Mathematics, vol. 156, no. 10: North-Holland, pp. 1652–1660, 2008.
"Polarity of chordal graphs",
Discrete Applied Mathematics, vol. 156, no. 13: Elsevier, pp. 2469–2479, 2008.
"(p, k)-coloring problems in line graphs",
Theoretical computer science, vol. 349, no. 3: Elsevier, pp. 462–474, 2005.
"Partitioning cographs into cliques and stable sets",
Discrete Optimization, vol. 2, no. 2: Elsevier, pp. 145–153, 2005.