( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Complexity of Computing the k-restricted Edge-connectivity of a Graph.

, и . WG, том 9224 из Lecture Notes in Computer Science, стр. 219-233. Springer, (2015)

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.

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)
 

Другие публикации лиц с тем же именем

Maximum Cuts in Edge-colored Graphs., , , , и . Electron. Notes Discret. Math., (2017)Designing Hypergraph Layouts to GMPLS Routing Strategies., , , , , и . SIROCCO, том 5869 из Lecture Notes in Computer Science, стр. 57-71. Springer, (2009)Complexity Dichotomies for the Minimum ℱ -Overlay Problem., , , , и . IWOCA, том 10765 из Lecture Notes in Computer Science, стр. 116-127. Springer, (2017)Dynamic programming for graphs on surfaces., , и . ACM Trans. Algorithms, 10 (2): 8:1-8:26 (2014)An FPT 2-Approximation for Tree-cut Decomposition., , , , и . WAOA, том 9499 из Lecture Notes in Computer Science, стр. 35-46. Springer, (2015)Target set selection with maximum activation time., , , , и . Discret. Appl. Math., (октября 2023)Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm., , и . SIAM J. Comput., 52 (4): 865-912 (августа 2023)Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism., , , и . IPEC, том 43 из LIPIcs, стр. 78-89. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)On Self-Duality of Branchwidth in Graphs of Bounded Genus., и . CTW, стр. 19-22. (2009)Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth., , и . IPEC, том 89 из LIPIcs, стр. 4:1-4:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)