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

{"_id":{"_str":"540c01e0480d3bb058001227"},"__v":0,"authorIDs":[],"author_short":["Goyal, P.","Kamat, V.","Misra, N."],"bibbaseid":"goyal-kamat-misra-ontheparameterizedcomplexityofthemaximumedge2coloringproblem-2013","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Prachi"],"propositions":[],"lastnames":["Goyal"],"suffixes":[]},{"firstnames":["Vikram"],"propositions":[],"lastnames":["Kamat"],"suffixes":[]},{"firstnames":["Neeldhara"],"propositions":[],"lastnames":["Misra"],"suffixes":[]}],"editor":[{"firstnames":["Krishnendu"],"propositions":[],"lastnames":["Chatterjee"],"suffixes":[]},{"firstnames":["Jirí"],"propositions":[],"lastnames":["Sgall"],"suffixes":[]}],"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","bibtex":"@inproceedings{DBLP:conf/mfcs/GoyalKM13,\n author = {Prachi Goyal and\n Vikram Kamat and\n Neeldhara Misra},\n editor = {Krishnendu Chatterjee and\n Jir{\\'{\\i}} Sgall},\n title = {On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem},\n booktitle = {Mathematical Foundations of Computer Science 2013 - 38th International\n Symposium, {MFCS} 2013, Klosterneuburg, Austria, August 26-30, 2013.\n Proceedings},\n series = {Lecture Notes in Computer Science},\n volume = {8087},\n pages = {492--503},\n publisher = {Springer},\n year = {2013},\n url = {https://doi.org/10.1007/978-3-642-40313-2\\_44},\n doi = {10.1007/978-3-642-40313-2\\_44},\n timestamp = {Tue, 14 May 2019 10:00:37 +0200},\n biburl = {https://dblp.org/rec/conf/mfcs/GoyalKM13.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Goyal, P.","Kamat, V.","Misra, N."],"editor_short":["Chatterjee, K.","Sgall, J."],"key":"DBLP:conf/mfcs/GoyalKM13","id":"DBLP:conf/mfcs/GoyalKM13","bibbaseid":"goyal-kamat-misra-ontheparameterizedcomplexityofthemaximumedge2coloringproblem-2013","role":"author","urls":{"Paper":"https://doi.org/10.1007/978-3-642-40313-2_44"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://dblp.org/pid/85/6789.bib","creationDate":"2014-09-07T06:57:36.661Z","downloads":0,"keywords":[],"search_terms":["parameterized","complexity","maximum","edge","coloring","problem","goyal","kamat","misra"],"title":"On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem","year":2013,"dataSources":["pbNfXdT6TmRjJ8o3S","tDMHZRX27gzjeY5r7"]}