@InProceedings{le_et_al:LIPIcs.ISAAC.2016.50,
author = {Le, Hoang-Oanh and Le, Van Bang},
title = {{On the Complexity of Matching Cut in Graphs of Fixed Diameter}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {50:1--50:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.50},
URN = {urn:nbn:de:0030-drops-68205},
doi = {10.4230/LIPIcs.ISAAC.2016.50},
annote = {Keywords: matching cut, NP-hardness, graph algorithm, computational complexity, decomposable graph}
}