( en | de | ru )

 

Disambiguation of "Wasa, Kunihiro"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient Enumeration of Dominating Sets for Sparse Graphs.

, , , and . ISAAC, volume 123 of LIPIcs, page 8:1-8:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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.

Kunihiro Jojima

Helmut Gustav Wasa Cederstolpe

 

Other publications of authors with the same name

Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph., , and . ISAAC, volume 8889 of Lecture Notes in Computer Science, page 94-102. Springer, (2014)An Efficient Algorithm for Enumerating Induced Subgraphs with Bounded Degeneracy., and . COCOA, volume 11346 of Lecture Notes in Computer Science, page 35-45. Springer, (2018)Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth., , , , and . IWOCA, volume 10979 of Lecture Notes in Computer Science, page 201-213. Springer, (2018)On Maximal Cliques with Connectivity Constraints in Directed Graphs., , , and . ISAAC, volume 92 of LIPIcs, page 23:1-23:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four., , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 101-A (9): 1383-1391 (2018)Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph., , , , and . Theor. Comput. Sci., (2020)An Approximation Algorithm for K-best Enumeration of Minimal Connected Edge Dominating Sets with Cardinality Constraints., and . CoRR, (2022)Reconfiguration of Spanning Trees with Many or Few Leaves., , , , , , and . ESA, volume 173 of LIPIcs, page 24:1-24:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)The Perfect Matching Reconfiguration Problem., , , , , , , and . MFCS, volume 138 of LIPIcs, page 80:1-80:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application., , , and . COCOON, volume 7434 of Lecture Notes in Computer Science, page 347-359. Springer, (2012)