Ignasi Sau

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Xavier Muñoz

> Home > Persons > Ignasi Sau

Publications

2011
[j12]
- view
  authority control:
- export record
  dblp key:
  - journals/networks/BermondMS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/BermondMS11
Jean-Claude Bermond, Xavier Muñoz, Ignasi Sau:
Traffic grooming in bidirectional WDM ring networks. Networks 58(1): 20-35 (2011)
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/siamdm/MunozLS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/MunozLS11
Xavier Muñoz, Zhentao Li, Ignasi Sau:
Edge-Partitioning Regular Graphs for Ring Traffic Grooming with a Priori Placement of the ADMs. SIAM J. Discret. Math. 25(4): 1490-1505 (2011)
2010
[p2]
- view
  authority control:
- export record
  dblp key:
  - books/sp/10/CinklerCFMMMSSZ10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/books/sp/10/CinklerCFMMMSSZ10
Tibor Cinkler, David Coudert, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Xavier Muñoz, Ignasi Sau, Mordechai Shalom, Shmuel Zaks:
Traffic Grooming: Combinatorial Results and Practical Resolutions. Graphs and Algorithms in Communication Networks 2010: 63-94
2008
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/wg/MunozS08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/MunozS08
Xavier Muñoz, Ignasi Sau:
Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph. WG 2008: 300-311

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.