Dossier de Ignasi Sau Valls

Publications liées à la thèse

Livres ou chapitres de livre

  1. T. Cinkler, D. Coudert, M. Flammini, G. Monaco, L. Moscardelli, X. Muñoz, I. Sau, M. Shalom, and S. Zaks. Graphs and Algorithms in Communication Networks – Studies in Broadband, Optical, Wireless and Ad Hoc Networks. Chapter: Traffic Grooming: Combinatorial Results and Practical Resolutions. EATCS Texts in Theoretical Computer Science, Springer. December 2009.
  2. I. Sau and J. Zerovnik. Graphs and Algorithms in Communication Networks – Studies in Broadband, Optical, Wireless and Ad Hoc Networks. Chapter: Permutation Routing and (l,k)-routing on Plane Grids. EATCS Texts in Theoretical Computer Science, Springer. December 2009.

Articles dans des revues internationales avec comité de lecture

  1. I. Sau and J. Zerovnik. An Optimal Permutation Routing Algorithm for Full-Duplex Hexagonal Mesh Networks. Discrete Mathematics and Theoretical Computer Science (DMTCS), 10(3):49–62, 2008.
  2. O. Amini, S. Pérennes, and I. Sau. Hardness and Approximation of Traffic Grooming. Theoretical Computer Science (TCS), 410(38–40):3751–3760, 2009.
  3. F. Huc, I. Sau, and J. Zerovnik. (l,k)-Routing on Plane Grids. Journal of Interconnection Networks (JOIN), 10(1–2):27–57, 2009.
  4. G.B. Mertzios, I. Sau, and S. Zaks. A New Intersection Model and Improved Algorithms for Tolerance Graphs. SIAM Journal on Discrete Mathematics (SIDMA), 23(4):1800–1813, 2009.
  5. J.-C. Bermond, C.J. Colbourn, L. Gionfriddo, G. Quattrocchi, and I. Sau. Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4. SIAM Journal on Discrete Mathematics (SIDMA), 24(2): 400–419, 2010.
  6. I. Sau and D.M. Thilikos. Subexponential Parameterized Algorithms for Degree-constrained Subgraph Problems on Planar Graphs. Journal of Discrete Algorithms (JDA), 8(3): 330–338, 2010.
  7. J.-C. Bermond, X. Muñoz, and I. Sau. Traffic Grooming in Bidirectional WDM Ring Networks. Networks, to appear.
  8. O. Amini, I. Sau, and S. Saurabh. Parameterized Complexity of Finding Small Degree-constrained Subgraphs. Journal of Discrete Algorithms (JDA), accepted for publication.
  9. O. Amini, D. Peleg, S. Pérennes, I. Sau, and S. Saurabh. On the approximability of some degree-constrained subgraph problems. Discrete Applied Mathematics (DAM), accepted for publication.

Articles dans des conférences internationales avec comité de lecture

  1. J.-C. Bermond, D. Coudert, X. Muñoz, and I. Sau. Traffic Grooming in Bidirectional WDM Ring Networks. In Proc. of the IEEE-LEOS International Conference on Transparent Optical Networks (ICTON), volume 3, pages 19–22, Nottingham, UK, June 2006.
  2. I. Sau and J. Zerovnik. Optimal Permutation Routing on Mesh Networks. In Proc. of the International Network Optimization Conference (INOC), Spa, Belgium, April 2007.
  3. O. Amini, S. Pérennes, and I. Sau. Hardness and Approximation of Traffic Grooming. In Proc. of the 18th International Symposium on Algorithms and Computation (ISAAC), volume 4835 of LNCS, pages 561–573, Sendai, Japan, December 2007.
  4. O. Amini, I. Sau, and S. Saurabh. Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem. In Proc. of the International Workshop on Parameterized and Exact Computation (IWPEC), volume 5008 of LNCS, pages 13–29, Victoria, Canada, May 2008.
  5. X. Muñoz and I. Sau. Traffic Grooming in Unidirectional WDM Rings with Bounded-Degree Request Graph. In Proc. 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.
  6. O. Amini, D. Peleg, S. Pérennes, I. Sau, and S. Saurabh. Degree-Constrained Subgraph Problems: Hardness and Approximation Results. In Proc. of the 6th Workshop on Approximation and Online Algorithms (WAOA), volume 5426 of LNCS, pages 29–42, Universität Karlsruhe, Germany, September 2008.
  7. I. Sau and D.M. Thilikos. Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs. In Proc. of DIMAP workshop on Algorithmic Graph Theory (AGT), Electronic Notes in Discrete Mathematics, 32:59–66, University of Warwick, U.K., March 2009.
  8. J.-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, H. Rivano, I. Sau, and F. Solano. MPLS label stacking on the line network. In Proc. of IFIP Networking, volume 5550 of LNCS, pages 809–820, Aachen, Germany, May 2009.
  9. J.-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, I. Sau, and F. Solano. Designing Hypergraph Layouts to GMPLS Routing Strategies. In Proc. of the 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO), volume 5869 of LNCS, pages 57–71, Piran, Slovenia, May 2009.
  10. I. Sau and D.M. Thilikos. On Self-duality of Branchwidth in Graphs of Bounded Genus. In Proc. of the 8th Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW), pages 12–22. Paris, France, June 2009.
  11. G.B. Mertzios, I. Sau, and S. Zaks. A New Intersection Model and Improved Algorithms for Tolerance Graphs. In Proc. of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 5911 of LNCS, pages 285–295, Montpellier, France, June 2009.
  12. Z. Li and I. Sau. Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph. In Proc. 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.
  13. D. Coudert, F. Giroire, and I. Sau. Edge-Simple Circuits Through 10 Ordered Vertices in Square Grids. In Proc. of the 20th International Workshop on Combinatorial Algorithms (IWOCA), volume 5874 of LNCS, pages 134–145, Opava, Czech Republic, June 2009.
  14. G.B. Mertzios, I. Sau, and S. Zaks. The Recognition of Tolerance and Bounded Tolerance Graphs. In Proc. of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS), volume 5 of LIPIcs, pages 858–596, Nancy, France, March 2010.
  15. I. Sau, M. Shalom, and S. Zaks. Traffic Grooming in Star Networks via Matching Techniques. In Proc. of the 17th International Colloquium on Structural Information and Communication Complexity (SIROCCO), volume 6058 of LNCS, pages 41–56, Sirince, Turkey, June 2010.
  16. I. Adler, F. Dorn, F. V. Fomin, I. Sau, and D. M. Thilikos. Faster Parameterized Algorithms for Minor Containment. In Proc. of the 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), volume 6139 of LNCS, pages 322–333, Bergen, Norway, June 2010.
  17. G. B. Mertzios, I. Sau, M. Shalom, and S. Zaks. Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests. In Proc. 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.
  18. J. Rué, I. Sau, and D.M. Thilikos. Dynamic Programming for Graphs on Surfaces. In Proc. of the 37th International Colloquium on Automata, Languages and Programming (ICALP), volume 6198 of LNCS, pages 372–383, Bordeaux, France, July 2010.
  19. I. Adler, F. Dorn, F. V. Fomin, I. Sau, and D. M. Thilikos. Fast Minor Testing in Planar Graphs. In Proc. of the 18th Annual European Symposium on Algorithms (ESA), volume 6346 of LNCS, pages 97–109, Liverpool, U.K., September 2010.

Articles dans des workshops internationaux avec comité de lecture

Autres publications

Articles dans des conférences nationales avec comité de lecture

  1. O. Amini, S. Pérennes, and I. Sau. Hardness of Approximating the Traffic Grooming. In Proc. of 9es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), Ile d'Oléron, France, May 2007.
  2. J. C. Araújo, C. Linhares-Sales, and I. Sau. Weighted Coloring on P4-sparse Graphs. In Proc. of 11es Journées Doctorales en Informatique et Réseaux (JDIR), Sophia Antipolis, France, March 2010.

Articles soumis à des revues internationales avec comité de lecture

  1. G.B. Mertzios, I. Sau, and S. Zaks. The Recognition of Tolerance and Bounded Tolerance Graphs. Submitted to SIAM Journal on Computing.
  2. I. Sau, P. Sparl, and J. Zerovnik. Simpler Multicoloring of Triangle-free Hexagonal Graphs. Submitted to Discrete Mathematics.
  3. I. Sau and D.M. Thilikos. On Self-duality of Branchwidth on Graphs of Bounded Genus. Submitted to Discrete Applied Mathematics.
  4. J.-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, I. Sau, and F. Solano Donado. GMPLS Label Space Minimization through Hypergraph Layouts. Submitted to Theoretical Computer Science.
  5. X. Muñoz, Z. Li, and I. Sau. Edge-partitioning Regular Graphs for Ring Traffic Grooming with a Priori Placement of the ADMs. Submitted to SIAM Journal on Discrete Mathematics.
  6. D. Coudert, F. Giroire, and I. Sau. On Circuits in Graphs Through a Prescribed Set of Ordered Vertices. Submitted to Journal of Interconnection Networks.
  7. I. Adler, F. Dorn, F. V. Fomin, I. Sau, and D. M. Thilikos. Faster Parameterized Algorithms for Minor Containment. Submitted to Theoretical Computer Science.
  8. G.B. Mertzios, I. Sau, M. Shalom, and S. Zaks. Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests. Submitted to IEEE Transactions on Networking.
  9. J. Rué, I. Sau, and D. M. Thilikos. Dynamic Programming for Graphs on Surfaces. Submitted to SIAM Journal on Computing.

Articles soumis à des conférences internationales avec comité de lecture

  1. D. Peleg, I. Sau, and M. Shalom. On approximating the d-girth of a graph. Submitted to SOFSEM 2011.
En cas de problème avec ce dossier, contactez le secrétaire du prix Mathieu Giraud