Short version to appear in Proceedings of the IX Latin and American Algorithms, Graphs and Optimization
Symposium (LAGOS), ENDM, Marseille, France, September 2017.
Short version to appear in Proceedings of the 12th International Symposium on Parameterized and Exact Computation (IPEC),
LIPIcs, Vienna, Austria, September 2017.
Short version to appear in Proceedings of the 12th International Symposium on Parameterized and Exact Computation (IPEC),
LIPIcs, Vienna, Austria, September 2017.
Short version to appear in Proceedings of the 12th International Symposium on Parameterized and Exact Computation (IPEC),
LIPIcs, Vienna, Austria, September 2017.
In Proceedings of the 43rd International Workshop on Graph-Theoretic Concepts in Computer
Science (WG), volume 10520 LNCS, pages 100-112, Eindhoven, The Netherlands, June 2017.
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.
Short version to appear in Proceedings of the IX Latin and American Algorithms, Graphs and Optimization
Symposium (LAGOS), ENDM, Marseille, France, September 2017.
Short version (in Portuguese) in XLVIII Simpósio Brasileiro de Pesquisa Operacional (SBPO),
Vitória, Brazil, September 2016.
Short abstract in XXXVI Congresso da Sociedade Brasileira de Computação - Encontro de Teoria da Computação (CSBC-ETC),
Porto Alegre, Brazil, July 2016.
Short version in Proceedings of the 10th International Conference on Combinatorial Optimization and Applications
(COCOA), volume 10043 of LNCS, pages 423-437, Hong Kong, China, December 2016.
Full version in Theoretical Computer Science (TCS), 690: 91-103, 2017.
Short version in Proceedings of the 42nd International Workshop on Graph-Theoretic Concepts
in Computer Science (WG), volume 9941 of LNCS, pages 195-206, Istanbul, Turkey, June 2016.
Full version in Bulletin of Mathematical Biology (BMAB), 79(4): 920-938, 2017.
Short version in Proceedings of the 11th International Conference on Algorithmic
Aspects of Information and Management (AAIM), Bergamo, Italy, July 2016.
Short version in Proceedings of the 13th Workshop on Approximation and Online Algorithms (WAOA), volume 9499 of LNCS, pages 35-46, Patras, Greece, September 2015.
Short version in Proceedings of the 13th Workshop on Approximation and Online Algorithms (WAOA), volume 9499 of LNCS, pages 122-132, Patras, Greece, September 2015.
Full version in European Journal of Combinatorics (EJC), 65: 106-121, 2017.
Short version (entitled "Covering and packing pumpkin models") in Proceedings of the 9th International Colloquium on Graph Theory and Combinatorics
(ICGT), Grenoble, France, June-July 2014.
Full version in Journal of Computer and System Sciences (JCSS), 86: 191-206, 2017.
Short version in Proceedings of the 10th International Symposium on Parameterized and
Exact Computation (IPEC), volume 43 of LIPIcs, pages 78-89, Patras, Greece, September 2015.
Full version Theoretical Computer Science (TCS), 662: 31-39, 2017.
Short version in Proceedings of the 41st International Workshop on Graph-Theoretic Concepts
in Computer Science (WG), volume 9224 of LNCS, pages 219-233, Munich, Germany, June 2015.
Full version in Journal of Computer and System Sciences (JCSS), 89: 315-327, 2017.
Short version in Proceedings of the 10th International Computer Science Symposium in Russia
(CSR), volume 9139 of LNCS, pages 123-142, Listvyanka, Russia, July 2015.
Full version to appear in Discrete Mathematics (DM).
Short version in Proceedings of the 9th International Symposium on Parameterized and Exact Computation
(IPEC), volume 8894 of LNCS, pages 282-293, Warsaw, Poland, September 2014.
Full version in SIAM Journal on Discrete Mathematics (SIDMA), 29(4): 1864-1894, 2015.
Short version in Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science
(STACS), volume 25 of LIPIcs, pages
312-324, Lyon, France, March 2014.
Full version in Theoretical Computer Science (TCS), 570: 1-14, 2015.
Short version in Proceedings of the 9th International Symposium on Parameterized and Exact Computation
(IPEC), volume 8894 of LNCS, pages 63-74, Warsaw, Poland, September 2014.
Full version in Discrete Applied Mathematics (DAM), 217: 536-547, 2017.
Short version in Proceedings of the 12th Cologne Twente Workshop on Graphs and
Combinatorial Optimization (CTW), pages 117-120, Enschede, The Netherlands,
May 2013.
Full version in ACM Transactions on Algorithms (TALG), 12(2): 21, 2016.
Short version in Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP), volume 7965 of LNCS, pages 613-624, Riga, Latvia,
July 2013.
Full version in Theory of Computing Systems (TOCS), 54(1): 45-72, 2014.
Short version in Proceedings of the 38th International Workshop on Graph-Theoretic Concepts
in Computer Science (WG), volume 7551 of LNCS, pages 308-319, Jerusalem, Israel, June 2012.
Full version in SIAM Journal on Discrete Mathematics (SIDMA), 28(3): 1363-1390, 2014.
Short version in Proceedings of the 19th Annual European
Symposium on Algorithms (ESA), volume 6942 of LNCS, pages 394-407, Saarbrücken, Germany, September 2011.
Short version in Proceedings of the 18th Annual International Computing and Combinatorics Conference (COCOON), volume 7434 of LNCS, pages 86-97, Sydney, Australia, August 2012.
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.
Short version in Proceedings of the 17th International Colloquium on Structural Information and Communication Complexity
(SIROCCO), volume 6058 of LNCS, pages 41-56, Sirince, Turkey, June 2010.
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 ACM Transactions on Algorithms (TALG), 10(2): 8, 2014.
Short version in Proceedings of the 37th International Colloquium on Automata, Languages and Programming
(ICALP), volume 6198 of LNCS, pages 372-383, Bordeaux, France, July 2010.
Full version in Discrete Mathematics (DM), 313(5-6): 635-649, 2013.
Short version in Proceedings of the 37th International Colloquium on Automata, Languages and Programming
(ICALP), volume 6198 of LNCS, pages 372-383, Bordeaux, France, July 2010.
Short version in Proceedings of the 18th Annual European
Symposium on Algorithms (ESA), volume 6346 of LNCS, pages 97-109, Liverpool, U.K., September 2010.
Full version in Theoretical Computer Science (TCS), 412(50): 7018-7028, 2011.
Short version in Proceedings of the 12th Scandinavian Symposium and Workshops on Algorithm Theory
(SWAT), volume 6139 of LNCS, pages 322-333, Bergen, Norway, June 2010.
Full version in SIAM Journal on Computing (SICOMP), 40(5): 1234-1257, 2011.
Short version in Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science
(STACS), volume 5 of LIPIcs, pages 858-596, Nancy, France, March 2010.
Full version in SIAM Journal on Discrete Mathematics (SIDMA), 25(4):
1490-1505, 2011.
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.
Full version in Journal of Discrete Algorithms (JDA), 10: 70-83, 2012.
Short version in Proceedings of the International Workshop on Parameterized and Exact Computation (IWPEC), volume 5008 of LNCS, pages 13-29, Victoria, Canada, May 2008.
Full version in Discrete Applied Mathematics (DAM), 160(12): 1661-1679, 2012.
Short version in Proceedings of the 6th Workshop on Approximation and Online Algorithms (WAOA), volume 5426 of LNCS, pages 29-42, Universität Karlsruhe, Germany, September 2008.
Full version in Theoretical Computer Science (TCS), 444: 3-16, 2012.
First short version (with Hervé Rivano) in Proceedings of IFIP Networking, volume 5550 of LNCS, pages
809-820, Aachen, Germany, May 2009.
Second short version in Proceedings of 16th International Colloquium on Structural Information
and Communication Complexity (SIROCCO), volume 5869 of LNCS, pages 57-71, Piran, Slovenia, May 2009.
Full version in Journal of Discrete Algorithms (JDA), 8(3): 330-338, 2010.
Short version in Proceedings of DIMAP workshop on Algorithmic Graph Theory (AGT), Electronic Notes in Discrete Mathematics, 32:59-66, University of Warwick, U.K., March 2009.
Full version in SIAM Journal on Discrete Mathematics (SIDMA), 23(4):1800-1813, 2009.
Short version in Proceedings of the 35th International Workshop on Graph-Theoretic Concepts
in Computer Science (WG), volume 5911 of LNCS, pages 285-295, Montpellier, France, June 2009.
Full version in Journal of Interconnection Networks (JOIN), 11(3-4): 121-141, 2011.
Short version in Proceedings of the 20th International Workshop on
Combinatorial Algorithms (IWOCA), volume 5874 of LNCS, pages 134-145, Opava, Czech Republic, June 2009.
Full version in Theoretical Computer Science (TCS), 410(38-40):3751-3760, 2009.
Short version in Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC), volume 4835 of LNCS, pages 561-573, Sendai, Japan, December 2007.
Communication in 9es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), Ile d'Oléron, France, May 2007.
Short version in Proceedings of the IEEE-LEOS International Conference on Transparent Optical Networks (ICTON), volume 3, pages 19-22, Nottingham, UK, June 2006.
Poster in ADONET/COST293 Spring School on Combinatorial Optimization and Communication Networks, Budapest University of Technology and Economics, Hungary, March 2006.
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.
Permutation Routing and (l,k)-Routing on Plane Grids
[link to the full book]
Ignasi Sau and Janez Zerovnik.
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.