Author of the publication

Listing Subgraphs by Cartesian Decomposition.

, , , , and . MFCS, volume 117 of LIPIcs, page 84:1-84:16. Schloss Dagstuhl - Leibniz-Zentrum fuer 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.

 

Other publications of authors with the same name

Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques., , , and . ICALP, volume 55 of LIPIcs, page 148:1-148:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs., , , , , and . MFCS, volume 138 of LIPIcs, page 73:1-73:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Listing Maximal Independent Sets with Minimal Space and Bounded Delay., , , , and . SPIRE, volume 10508 of Lecture Notes in Computer Science, page 144-160. Springer, (2017)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)Shared-Nothing Distributed Enumeration of 2-Plexes., , , and . CIKM, page 2469-2472. ACM, (2019)Community Detection in Social Networks: Breaking the Taboos., , , , and . SEBD, page 118-125. Matematicamente.it, (2016)Listing Maximal Subgraphs Satisfying Strongly Accessible Properties., , , and . SIAM J. Discrete Math., 33 (2): 587-613 (2019)Proximity Search For Maximal Subgraph Enumeration., , , , and . CoRR, (2019)D2K: Scalable Community Detection in Massive Networks via Small-Diameter k-Plexes., , , , , and . KDD, page 1272-1281. ACM, (2018)New polynomial delay bounds for maximal subgraph enumeration by proximity search., and . STOC, page 1179-1190. ACM, (2019)