Author of the publication

A Fast Algorithm for Large Common Connected Induced Subgraphs.

, , , , and . AlCoB, volume 10252 of Lecture Notes in Computer Science, page 62-74. 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

Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing., , , , , and . CoRR, (2013)A fast discovery algorithm for large common connected induced subgraphs., , , , and . Discret. Appl. Math., (2019)Inferring Mobile Elements in S. Cerevisiae Strains., , , , and . BIOINFORMATICS, page 131-136. SciTePress, (2011)Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform., , and . ANALCO, page 191-202. SIAM, (2008)Beyond the BEST Theorem: Fast Assessment of Eulerian Trails., , , , , and . FCT, volume 12867 of Lecture Notes in Computer Science, page 162-175. Springer, (2021)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)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 für Informatik, (2016)Large-scale clique cover of real-world networks., , and . Inf. Comput., (2020)On Breaking Truss-Based Communities., , , , , and . KDD, page 117-126. ACM, (2021)Succinct Representations for (Non)Deterministic Finite Automata., , , and . LATA, volume 12638 of Lecture Notes in Computer Science, page 55-67. Springer, (2021)