Georgios Stamoulis. Approximation Algorithms for Bounded Color Matchings via Convex Decompositions. In Erzsébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik, editors, Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II. Volume 8635 of Lecture Notes in Computer Science, pages 625-636, Springer, 2014. [doi]
@inproceedings{Stamoulis14, title = {Approximation Algorithms for Bounded Color Matchings via Convex Decompositions}, author = {Georgios Stamoulis}, year = {2014}, doi = {10.1007/978-3-662-44465-8_53}, url = {http://dx.doi.org/10.1007/978-3-662-44465-8_53}, researchr = {https://researchr.org/publication/Stamoulis14}, cites = {0}, citedby = {0}, pages = {625-636}, booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II}, editor = {Erzsébet Csuhaj-Varjú and Martin Dietzfelbinger and Zoltán Ésik}, volume = {8635}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-662-44464-1}, }