Author of the publication

Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph.

, , , , and . COCOON, volume 10392 of Lecture Notes in Computer Science, page 150-161. Springer, (2017)

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

Polynomial-Delay Enumeration of Maximal Common Subsequences., , , and . SPIRE, volume 11811 of Lecture Notes in Computer Science, page 189-202. Springer, (2019)Finding the Anticover of a String., , , , , , and . CPM, volume 161 of LIPIcs, page 2:1-2:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection in Graphs., , , , and . IEEE Access, (2020)A meta-algorithm for finding large k-plexes., , , and . Knowl. Inf. Syst., 63 (7): 1745-1769 (2021)Listing Maximal Subgraphs in Strongly Accessible Set Systems., , , and . CoRR, (2018)CAGE: Cache-Aware Graphlet Enumeration., , and . SPIRE, volume 14240 of Lecture Notes in Computer Science, page 129-142. Springer, (2023)Node Similarity with q -Grams for Real-World Labeled Networks., , , , , and . KDD, page 1282-1291. ACM, (2018)Directing Road Networks by Listing Strong Orientations., , , , and . IWOCA, volume 9843 of Lecture Notes in Computer Science, page 83-95. Springer, (2016)Listing Subgraphs by Cartesian Decomposition., , , , and . MFCS, volume 117 of LIPIcs, page 84:1-84:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Clique covering of large real-world networks., , and . SAC, page 1134-1139. ACM, (2016)