Author of the publication

An Efficient Algorithm for Assessing the Number of st-Paths in Large Graphs.

, , , and . SDM, page 289-297. SIAM, (2023)

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

Online Algorithms on Antipowers and Antiperiods., , , , , , , , and . SPIRE, volume 11811 of Lecture Notes in Computer Science, page 175-188. Springer, (2019)Beyond the BEST Theorem: Fast Assessment of Eulerian Trails., , , , , and . FCT, volume 12867 of Lecture Notes in Computer Science, page 162-175. Springer, (2021)Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space., , , , and . IWOCA, volume 14764 of Lecture Notes in Computer Science, page 382-395. Springer, (2024)Polynomial-Delay Enumeration of Maximal Common Subsequences., , , and . SPIRE, volume 11811 of Lecture Notes in Computer Science, page 189-202. Springer, (2019)Finding Diverse Strings and Longest Common Subsequences in a Graph., , , , and . CPM, volume 296 of LIPIcs, page 27:1-27:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Hide and Mine in Strings: Hardness and Algorithms., , , , , , , , , and . ICDM, page 924-929. IEEE, (2020)On Strings Having the Same Length- k Substrings., , , , , , , and . CPM, volume 223 of LIPIcs, page 16:1-16:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs., , , and . MFCS, volume 170 of LIPIcs, page 25:1-25:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)An Efficient Algorithm for Assessing the Number of st-Paths in Large Graphs., , , and . SDM, page 289-297. SIAM, (2023)Bounding the Number of Eulerian Tours in Undirected Graphs.. COCOON, volume 13595 of Lecture Notes in Computer Science, page 368-380. Springer, (2022)