Author of the publication

New Bounds for Approximating Extremal Distances in Undirected Graphs.

, , and . SODA, page 363-376. SIAM, (2016)

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)Inferring Mobile Elements in S. Cerevisiae Strains., , , , and . BIOINFORMATICS, page 131-136. SciTePress, (2011)A fully-dynamic data structure for external substring search (Extended Abstract)., and . STOC, page 693-702. ACM, (1995)Optimal Trade-Offs for Succinct String Indexes., , and . ICALP (1), volume 6198 of Lecture Notes in Computer Science, page 678-689. Springer, (2010)Optimal Listing of Cycles and St-paths in Undirected Graphs, , , , , , and . Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, page 1884--1896. SIAM, (2013)Longest Property-Preserved Common Factor., , , , , , and . SPIRE, volume 11147 of Lecture Notes in Computer Science, page 42-49. Springer, (2018)Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform., , and . ANALCO, page 191-202. SIAM, (2008)A fast discovery algorithm for large common connected induced subgraphs., , , , and . Discret. Appl. Math., (2019)Large-scale clique cover of real-world networks., , and . Inf. Comput., (2020)Succinct Representations for (Non)Deterministic Finite Automata., , , and . LATA, volume 12638 of Lecture Notes in Computer Science, page 55-67. Springer, (2021)