@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}
}
