Author of the publication

Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs.

, , and . IWOCA, volume 9538 of Lecture Notes in Computer Science, page 235-247. 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. 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

Broadcast Domination on Block Graphs in Linear Time., and . CSR, volume 7353 of Lecture Notes in Computer Science, page 172-183. Springer, (2012)Optimal Linear Arrangement of Interval Graphs., , , , and . MFCS, volume 4162 of Lecture Notes in Computer Science, page 267-279. Springer, (2006)Cliques and Clubs., , , and . CIAC, volume 7878 of Lecture Notes in Computer Science, page 276-287. Springer, (2013)Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width., , , , , and . Algorithmica, 80 (2): 714-741 (2018)Minimal Split Completions of Graphs., and . LATIN, volume 3887 of Lecture Notes in Computer Science, page 592-604. Springer, (2006)Graph Searching, Elimination Trees, and a Generalization of Bandwidth., , and . FCT, volume 2751 of Lecture Notes in Computer Science, page 73-85. Springer, (2003)Generalized H-coloring and H-covering of Trees., , , and . Nord. J. Comput., 10 (3): 206-223 (2003)Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization., , , , and . Inf. Comput., (2013)Faster Parameterized Algorithms for Minimum Fill-In., , and . ISAAC, volume 5369 of Lecture Notes in Computer Science, page 282-293. Springer, (2008)Computing Role Assignments of Proper Interval Graphs in Polynomial Time., , and . IWOCA, volume 6460 of Lecture Notes in Computer Science, page 167-180. Springer, (2010)