On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem. Goyal, P., Kamat, V., & Misra, N. In Chatterjee, K. & Sgall, J., editors, Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings, volume 8087, of Lecture Notes in Computer Science, pages 492–503, 2013. Springer.
On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/mfcs/GoyalKM13,
  author    = {Prachi Goyal and
               Vikram Kamat and
               Neeldhara Misra},
  editor    = {Krishnendu Chatterjee and
               Jir{\'{\i}} Sgall},
  title     = {On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem},
  booktitle = {Mathematical Foundations of Computer Science 2013 - 38th International
               Symposium, {MFCS} 2013, Klosterneuburg, Austria, August 26-30, 2013.
               Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {8087},
  pages     = {492--503},
  publisher = {Springer},
  year      = {2013},
  url       = {https://doi.org/10.1007/978-3-642-40313-2\_44},
  doi       = {10.1007/978-3-642-40313-2\_44},
  timestamp = {Tue, 14 May 2019 10:00:37 +0200},
  biburl    = {https://dblp.org/rec/conf/mfcs/GoyalKM13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0