Author of the publication

The Minimum All-Ones Problem for Graphs with Small Treewidth.

, and . COCOA, volume 4616 of Lecture Notes in Computer Science, page 335-342. Springer, (2007)

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.

 

Other publications of authors with the same name

Algorithms For The Optimal Hamiltonian Path In Halin Graphs., , and . Ars Comb., (2008)An Algorithm to Find the Constrained Steiner Tree in Halin Networks., , and . FGCN (1), page 423-426. IEEE Computer Society, (2008)Discovering Hierarchical Subgraphs of K-Core-Truss., , , , , , and . Data Science and Engineering, 3 (2): 136-149 (2018)Ranking Based Selection Genetic Algorithm for Capacity Flow Assignments., , , , and . ISICA (2), volume 107 of Communications in Computer and Information Science, page 97-107. Springer, (2010)A Linear Algorithm to Find the Steiner Tree in Halin Networks.. IMECS, page 2307-2311. Newswood Limited, (2007)An Algorithm to Solve the Partition into Perfect Matchings Problem in Halin Graphs., and . International Conference on Computational Science (3), volume 4489 of Lecture Notes in Computer Science, page 410-418. Springer, (2007)Optimal root choice for parallel processing of tree decompositions., , and . IJIIDS, 4 (1): 60-80 (2010)A Linear Algorithm to Find the Maximum-weighted Matching in Halin Graphs., , and . IMECS, page 2274-2278. Newswood Limited, (2007)The Minimum All-Ones Problem for Graphs with Small Treewidth., and . COCOA, volume 4616 of Lecture Notes in Computer Science, page 335-342. Springer, (2007)A Note on Root Choice for Parallel Processing of Tree Decompositions., and . KES-AMSTA, volume 4953 of Lecture Notes in Computer Science, page 713-722. Springer, (2008)