( en | de | ru )

 

Disambiguation of "Sau, Ignasi"

Author of the publication

copydeleteadd this publication to your clipboard
The Role of Planarity in Connectivity Problems Parameterized by Treewidth.

, and . IPEC, volume 8894 of Lecture Notes in Computer Science, page 63-74. Springer, (2014)

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

Carmen Sauter

Aluminiumverstärktes Zirkoniumdioxid als orales Implantatmaterial: eine kaumaschinelle Untersuchung. Uni Freiburg, (2010)
 

Other publications of authors with the same name

Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees., , , and . AAIM, volume 9778 of Lecture Notes in Computer Science, page 53-64. Springer, (2016)Hitting and Harvesting Pumpkins., , , , and . ESA, volume 6942 of Lecture Notes in Computer Science, page 394-407. Springer, (2011)Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter., , , , , and . IPEC, volume 89 of LIPIcs, page 3:1-3:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests., , , and . ICALP (2), volume 6199 of Lecture Notes in Computer Science, page 333-344. Springer, (2010)Uniquely Restricted Matchings and Edge Colorings., , and . WG, volume 10520 of Lecture Notes in Computer Science, page 100-112. Springer, (2017)On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings., and . WG, volume 12301 of Lecture Notes in Computer Science, page 67-79. Springer, (2020)On the Number of Labeled Graphs of Bounded Treewidth., , and . WG, volume 10520 of Lecture Notes in Computer Science, page 88-99. Springer, (2017)Faster parameterized algorithms for minor containment., , , , and . Theor. Comput. Sci., 412 (50): 7018-7028 (2011)Hitting and Harvesting Pumpkins., , , , and . SIAM J. Discret. Math., 28 (3): 1363-1390 (2014)A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary., , and . SODA, page 951-970. SIAM, (2020)