Ignasi Sau

Ignasi Sau Valls

	2009
10		Ignasi Sau, Dimitrios M. Thilikos: On Self-Duality of Branchwidth in Graphs of Bounded Genus. CTW 2009: 19-22
9		David Coudert, Frédéric Giroire, Ignasi Sau: Edge-Simple Circuits through 10 Ordered Vertices in Square Grids. IWOCA 2009: 134-145
8		Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Hervé Rivano, Ignasi Sau, Fernando Solano Donado: MPLS Label Stacking on the Line Network. Networking 2009: 809-820
7		Ignasi Sau, Dimitrios M. Thilikos: Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs. Electronic Notes in Discrete Mathematics 32: 59-66 (2009)
6		Omid Amini, Stéphane Pérennes, Ignasi Sau: Hardness and approximation of traffic grooming. Theor. Comput. Sci. 410(38-40): 3751-3760 (2009)
	2008
5		Omid Amini, Ignasi Sau, Saket Saurabh: Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem. IWPEC 2008: 13-29
4		Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh: Degree-Constrained Subgraph Problems: Hardness and Approximation Results. WAOA 2008: 29-42
3		Xavier Muñoz, Ignasi Sau: Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph. WG 2008: 300-311
2		Janez Zerovnik, Ignasi Sau: An Optimal Permutation Routing Algorithm on Full-Duplex Hexagonal Networks. Discrete Mathematics & Theoretical Computer Science 10(3): (2008)
	2007
1		Omid Amini, Stéphane Pérennes, Ignasi Sau: Hardness and Approximation of Traffic Grooming. ISAAC 2007: 561-573

Coauthor Index

1	Omid Amini	[1] [4] [5] [6]
2	Jean-Claude Bermond	[8]
3	David Coudert	[8] [9]
4	Fernando Solano Donado	[8]
5	Frédéric Giroire	[9]
6	Joanna Moulierac	[8]
7	Xavier Muñoz	[3]
8	David Peleg	[4]
9	Stéphane Pérennes (Stephane Perennes)	[1] [4] [6] [8]
10	Hervé Rivano	[8]
11	Saket Saurabh	[4] [5]
12	Dimitrios M. Thilikos	[7] [10]
13	Janez Zerovnik	[2]

Colors in the list of coauthors