NP-Completeness of Max-Cut for Segment Intersection Graphs (bibtex)

by Oswin Aichholzer, Wolfgang Mulzer, P. Schnider and Birgit Vogtenhuber

Reference:

Oswin Aichholzer, Wolfgang Mulzer, P. Schnider and Birgit Vogtenhuber, NP-Completeness of Max-Cut for Segment Intersection Graphs, In Proceedings of the 34th European Workshop on Computational Geometry (EuroCG), 32:1–32:6, (2018). (extended abstract)

Bibtex Entry:

@InProceedings{AichholzerEtAl2018a,
  author    = {Oswin Aichholzer and Wolfgang Mulzer and P. Schnider and Birgit Vogtenhuber},
  booktitle = {Proceedings of the 34th European Workshop on Computational Geometry (EuroCG)},
  title     = {{NP}-Completeness of Max-Cut for Segment Intersection Graphs},
  year      = {2018},
  oatype    = {Green},
  note      = {extended abstract},
  pages     = {32:1--32:6},
  groups    = {Project11 (Aichholzer), Faculty, External, nonpeer},
  url       = {https://conference.imp.fu-berlin.de/eurocg18/download/eurocg_proc.pdf},
}