@article {1506,
	title = {A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs},
	journal = {Information Processing Letters},
	volume = {121},
	year = {2017},
	pages = {29-33},
	abstract = {<p>It is known that the maximum cardinality cut problem is NP-hard even in chordal graphs. On the positive side, the problem is known to be polynomial time solvable in some subclasses of proper interval graphs which is in turn a subclass of chordal graphs. In this paper, we consider the time complexity of the problem in proper interval graphs, and propose a polynomial-time dynamic programming algorithm.</p>},
	keywords = {Graph algorithms, Maximum cut, Proper interval graph},
	issn = {0020-0190},
	doi = {https://doi.org/10.1016/j.ipl.2017.01.007},
	url = {https://www.sciencedirect.com/science/article/pii/S0020019017300133},
	author = {Arman Boyac{\i} and Ekim, Tinaz and Mordechai Shalom}
}
@article {ekim2014polar,
	title = {Polar cographs},
	journal = {Discrete Applied Mathematics},
	volume = {171},
	number = {EPFL-ARTICLE-199582},
	year = {2014},
	pages = {158{\textendash}158},
	publisher = {Elsevier Science Bv},
	author = {Ekim, Tinaz and Mahadev, NVR and de Werra, Dominique}
}
@article {bonomo2013perfectness,
	title = {Perfectness of clustered graphs},
	journal = {Discrete Optimization},
	volume = {10},
	number = {4},
	year = {2013},
	pages = {296{\textendash}303},
	publisher = {Elsevier},
	author = {Bonomo, Flavia and Cornaz, Denis and Ekim, Tinaz and Ries, Bernard}
}
@article {ekim2013polar,
	title = {Polar permutation graphs are polynomial-time recognisable},
	journal = {European Journal of Combinatorics},
	volume = {34},
	number = {3},
	year = {2013},
	pages = {576{\textendash}592},
	publisher = {Academic Press},
	author = {Ekim, Tinaz and Heggernes, Pinar and Meister, Daniel}
}
@article {ekim2009partitioning,
	title = {Partitioning graphs into complete and empty graphs},
	journal = {Discrete Mathematics},
	volume = {309},
	number = {19},
	year = {2009},
	pages = {5849{\textendash}5856},
	publisher = {Elsevier},
	author = {Ekim, Tinaz and Gimbel, John}
}
@article {ekim2008polar,
	title = {Polar cographs},
	journal = {Discrete Applied Mathematics},
	volume = {156},
	number = {10},
	year = {2008},
	pages = {1652{\textendash}1660},
	publisher = {North-Holland},
	author = {Ekim, Tinaz and Mahadev, Nadimpalli VR and de Werra, Dominique}
}
@article {ekim2008polarity,
	title = {Polarity of chordal graphs},
	journal = {Discrete Applied Mathematics},
	volume = {156},
	number = {13},
	year = {2008},
	pages = {2469{\textendash}2479},
	publisher = {Elsevier},
	author = {Ekim, Tinaz and Hell, Pavol and Stacho, Juraj and de Werra, Dominique}
}
@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}
}
