( en | de | ru )

 

Disambiguation of "Sau, Ignasi"

Author of the publication

copydeleteadd this publication to your clipboard
Placing regenerators in optical networks to satisfy multiple sets of requests.

, , , and . IEEE/ACM Trans. Netw., 20 (6): 1870-1879 (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sau Dan Lee

Sau-Mo Fung

Samson Sau-Sing Fung

Samson Sau-Sing Fung

Ahmad Saufi

Lignans in Phaleria macrocarpa (Scheff.) Boerl. and in Linum flavum var. compactum L.: = Lignane in Phaleria macrocarpa (Scheff.) Boerl. und Linum flavum var. compactum L.. Uni Düsseldorf, (2007)
 

Other publications of authors with the same name

Dynamic Programming for Graphs on Surfaces, , and . CoRR, (2011)An FPT 2-Approximation for Tree-Cut Decomposition., , , , and . Algorithmica, 80 (1): 116-135 (2018)Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph., and . WG, volume 5344 of Lecture Notes in Computer Science, page 300-311. (2008)On Approximating the d-Girth of a Graph., , and . SOFSEM, volume 6543 of Lecture Notes in Computer Science, page 467-481. Springer, (2011)Edge-Simple Circuits through 10 Ordered Vertices in Square Grids., , and . IWOCA, volume 5874 of Lecture Notes in Computer Science, page 134-145. Springer, (2009)Fast Minor Testing in Planar Graphs., , , , and . ESA (1), volume 6346 of Lecture Notes in Computer Science, page 97-109. Springer, (2010)Target set selection with maximum activation time., , , , and . CoRR, (2020)Upper bounds on the uniquely restricted chromatic index., , and . J. Graph Theory, 91 (3): 251-258 (2019)On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings., and . Algorithmica, 83 (8): 2351-2373 (2021)A relaxation of the Directed Disjoint Paths problem: A global congestion metric helps., and . Theor. Comput. Sci., (2022)