Author of the publication

Maximum Motif Problem in Vertex-Colored Graphs.

, , and . CPM, volume 5577 of Lecture Notes in Computer Science, page 221-235. Springer, (2009)

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

Editorial., , and . Theor. Comput. Sci., (2018)Correcting gene tree by removal and modification: Tractability and approximability., , and . J. Discrete Algorithms, (2015)Top-k Connected Overlapping Densest Subgraphs in Dual Networks., , and . COMPLEX NETWORKS (2), volume 944 of Studies in Computational Intelligence, page 585-596. Springer, (2020)Minimum Leaf Removal for Reconciliation: Complexity and Algorithms., and . CPM, volume 7354 of Lecture Notes in Computer Science, page 399-412. Springer, (2012)Clique Editing to Support Case Versus Control Discrimination., , and . KES-IDT (1), volume 56 of Smart Innovation, Systems and Technologies, page 27-36. Springer, (2016)Sequence Classification via LCS.. KES-IDT, volume 309 of Smart Innovation, Systems and Technologies, page 77-86. Springer, (2022)Integrating Temporal Graphs via Dual Networks: Dense Graph Discovery., , and . COMPLEX NETWORKS (2), volume 1078 of Studies in Computational Intelligence, page 523-535. Springer, (2022)On the Complexity of the l-diversity Problem., , and . MFCS, volume 6907 of Lecture Notes in Computer Science, page 266-277. Springer, (2011)Restricted and Swap Common Superstring: A Parameterized View., , , and . IPEC, volume 7535 of Lecture Notes in Computer Science, page 49-60. Springer, (2012)The k-Anonymity Problem Is Hard., , and . FCT, volume 5699 of Lecture Notes in Computer Science, page 26-37. Springer, (2009)