Short version to appear in Proceedings of the 43rd International Workshop on Graph-Theoretic Concepts in Computer
Science (WG), volume 10520 of LNCS, pages 88-99, Eindhoven, The Netherlands, June 2017.
Full version in Discrete Applied Mathematics (DAM), 161(16-17): 2587-2596, 2013.
Short version in Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), volume 6543 of LNCS, pages 467-481, Novy Smokovec, Slovakia, January 2011.
Full version in IEEE/ACM Transactions on Networking (ToN), 20(6): 1870-1879, 2012.
Short version in Proceedings of the 37th International Colloquium on Automata, Languages and Programming
(ICALP), volume 6199 of LNCS, pages 333-344, Bordeaux, France, July 2010.Best paper award of Track C of ICALP'10.
Full version in SIAM Journal on Discrete Mathematics (SIDMA), 25(4):
First short version (without Zhentao Li) in Proceedings of the 34th International Workshop on Graph-Theoretic Concepts
in Computer Science (WG), volume 5344 of LNCS, pages 300-311, Durham University, U.K., July 2008.
Second short version (without Xavier Muñoz) in Proceedings of the 35th International Workshop on Graph-Theoretic Concepts
in Computer Science (WG), volume 5911 of LNCS, pages 250-261, Montpellier, France, June 2009.Best student paper award of WG'09.
Traffic Grooming: Combinatorial Results and Practical Resolutions
[link to the full book]
Tibor Cinkler, David Coudert, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Xavier Muñoz, Ignasi Sau, Mordechai Shalom, and Shmuel Zaks.
In Graphs and Algorithms in Communication Networks. Studies in Broadband, Optical, Wireless, and Ad Hoc Networks.
Arie Koster and Xavier Muñoz (editors). EATCS Texts in Theoretical Computer Science, Springer, December 2009.