Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Ignasi Sau
Ignasi Sau Valls
2010 – today
- 2013
[j20]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos: Asymptotic enumeration of non-crossing partitions on surfaces. Discrete Mathematics 313(5): 635-649 (2013)- [c21]Valentin Garnero, Ignasi Sau, Dimitrios M. Thilikos: A linear kernel for planar red-blue dominating set. CTW 2013: 117-120
- 2012
- [j19]Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos: Fast Minor Testing in Planar Graphs. Algorithmica 64(1): 69-84 (2012)
- [j18]Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh: On the approximability of some degree-constrained subgraph problems. Discrete Applied Mathematics 160(12): 1661-1679 (2012)
- [j17]Ignasi Sau, Petra Sparl, Janez Zerovnik: Simpler multicoloring of triangle-free hexagonal graphs. Discrete Mathematics 312(1): 181-187 (2012)
- [j16]Omid Amini, Ignasi Sau, Saket Saurabh: Parameterized complexity of finding small degree-constrained subgraphs. J. Discrete Algorithms 10: 70-83 (2012)
- [j15]Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Ignasi Sau, Fernando Solano Donado: GMPLS label space minimization through hypergraph layouts. Theor. Comput. Sci. 444: 3-16 (2012)
- [j14]George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks: Placing regenerators in optical networks to satisfy multiple sets of requests. IEEE/ACM Trans. Netw. 20(6): 1870-1879 (2012)
- [c20]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos: Dynamic Programming for H-minor-free Graphs. COCOON 2012: 86-97
- [c19]Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé: Parameterized Domination in Circle Graphs. WG 2012: 308-319
- [i7]Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé: Parameterized Domination in Circle Graphs. CoRR abs/1205.3728 (2012)
- [i6]Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar: Linear kernels and single-exponential algorithms via protrusion decompositions. CoRR abs/1207.0835 (2012)
- [i5]Valentin Garnero, Ignasi Sau: A linear kernel for planar total dominating set. CoRR abs/1211.0978 (2012)
- 2011
- [j13]Ignasi Sau, Dimitrios M. Thilikos: On self-duality of branchwidth in graphs of bounded genus. Discrete Applied Mathematics 159(17): 2184-2186 (2011)
- [j12]Jean-Claude Bermond, Xavier Muñoz, Ignasi Sau: Traffic grooming in bidirectional WDM ring networks. Networks 58(1): 20-35 (2011)
- [j11]George B. Mertzios, Ignasi Sau, Shmuel Zaks: The Recognition of Tolerance and Bounded Tolerance Graphs. SIAM J. Comput. 40(5): 1234-1257 (2011)
- [j10]Xavier Muñoz, Zhentao Li, Ignasi Sau: Edge-Partitioning Regular Graphs for Ring Traffic Grooming with a Priori Placement of the ADMs. SIAM J. Discrete Math. 25(4): 1490-1505 (2011)
- [j9]Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos: Faster parameterized algorithms for minor containment. Theor. Comput. Sci. 412(50): 7018-7028 (2011)
- [c18]Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé: Hitting and Harvesting Pumpkins. ESA 2011: 394-407
- [c17]David Peleg, Ignasi Sau, Mordechai Shalom: On Approximating the d-Girth of a Graph. SOFSEM 2011: 467-481
- [i4]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos: Asymptotic Enumeration of Non-crossing Partitions on Surfaces. CoRR abs/1104.2477 (2011)
- [i3]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos: Dynamic Programming for Graphs on Surfaces. CoRR abs/1104.2486 (2011)
- [i2]Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé: Hitting and Harvesting Pumpkins. CoRR abs/1105.2704 (2011)
- 2010
- [j8]Ignasi Sau, Dimitrios M. Thilikos: Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs. J. Discrete Algorithms 8(3): 330-338 (2010)
- [j7]David Coudert, Frédéric Giroire, Ignasi Sau: Circuits in Graphs through a prescribed Set of Ordered vertices. Journal of Interconnection Networks 11(3-4): 121-141 (2010)
- [j6]Jean-Claude Bermond, Charles J. Colbourn, Lucia Gionfriddo, Gaetano Quattrocchi, Ignasi Sau: Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4. SIAM J. Discrete Math. 24(2): 400-419 (2010)
- [c16]Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos: Fast Minor Testing in Planar Graphs. ESA (1) 2010: 97-109
- [c15]George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks: Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests. ICALP (2) 2010: 333-344
- [c14]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos: Dynamic Programming for Graphs on Surfaces. ICALP (1) 2010: 372-383
- [c13]Ignasi Sau, Mordechai Shalom, Shmuel Zaks: Traffic Grooming in Star Networks via Matching Techniques. SIROCCO 2010: 41-56
- [c12]George B. Mertzios, Ignasi Sau, Shmuel Zaks: The Recognition of Tolerance and Bounded Tolerance Graphs. STACS 2010: 585-596
- [c11]Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos: Faster Parameterized Algorithms for Minor Containment. SWAT 2010: 322-333
- [i1]George B. Mertzios, Ignasi Sau, Shmuel Zaks: The Recognition of Tolerance and Bounded Tolerance Graphs. CoRR abs/1001.3251 (2010)
2000 – 2009
- 2009
- [j5]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)
- [j4]Florian Huc, Ignasi Sau, Janez Zerovnik: (l, k)-ROUTING ON PLANE GRIDS. Journal of Interconnection Networks 10(1-2): 27-57 (2009)
- [j3]George B. Mertzios, Ignasi Sau, Shmuel Zaks: A New Intersection Model and Improved Algorithms for Tolerance Graphs. SIAM J. Discrete Math. 23(4): 1800-1813 (2009)
- [j2]Omid Amini, Stéphane Pérennes, Ignasi Sau: Hardness and approximation of traffic grooming. Theor. Comput. Sci. 410(38-40): 3751-3760 (2009)
- [c10]Ignasi Sau, Dimitrios M. Thilikos: On Self-Duality of Branchwidth in Graphs of Bounded Genus. CTW 2009: 19-22
- [c9]David Coudert, Frédéric Giroire, Ignasi Sau: Edge-Simple Circuits through 10 Ordered Vertices in Square Grids. IWOCA 2009: 134-145
- [c8]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
- [c7]Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Ignasi Sau, Fernando Solano Donado: Designing Hypergraph Layouts to GMPLS Routing Strategies. SIROCCO 2009: 57-71
- [c6]Zhentao Li, Ignasi Sau: Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph. WG 2009: 250-261
- [c5]George B. Mertzios, Ignasi Sau, Shmuel Zaks: A New Intersection Model and Improved Algorithms for Tolerance Graphs. WG 2009: 285-295
- 2008
- [j1]Janez Zerovnik, Ignasi Sau: An Optimal Permutation Routing Algorithm on Full-Duplex Hexagonal Networks. Discrete Mathematics & Theoretical Computer Science 10(3) (2008)
- [c4]Omid Amini, Ignasi Sau, Saket Saurabh: Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem. IWPEC 2008: 13-29
- [c3]Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh: Degree-Constrained Subgraph Problems: Hardness and Approximation Results. WAOA 2008: 29-42
- [c2]Xavier Muñoz, Ignasi Sau: Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph. WG 2008: 300-311
- 2007
- [c1]Omid Amini, Stéphane Pérennes, Ignasi Sau: Hardness and Approximation of Traffic Grooming. ISAAC 2007: 561-573
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-17 21:56 CEST by the dblp team