( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Enumerating m-Length Walks in Directed Graphs with Constant Delay.

, , и . LATIN (1), том 14578 из Lecture Notes in Computer Science, стр. 35-50. Springer, (2024)

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.

Pawel Urbanski

Pawel Golak

Pawel Durek

Sascha Pawel

Pawel Silberring

 

Другие публикации лиц с тем же именем

Testing Generalised Freeness of Words., , и . STACS, том 25 из LIPIcs, стр. 337-349. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Tying up the loose ends in fully LZW-compressed pattern matching.. STACS, том 14 из LIPIcs, стр. 624-635. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Efficiently Finding All Maximal alpha-gapped Repeats., , , , и . STACS, том 47 из LIPIcs, стр. 39:1-39:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Speeding up dynamic programming in the line-constrained k-median., и . Theory Comput. Syst., 62 (6): 1351-1365 (2018)Order-Preserving Squares in Strings., , и . CPM, том 259 из LIPIcs, стр. 13:1-13:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Optimal pattern matching in LZW compressed strings.. SODA, стр. 362-372. SIAM, (2011)Planar Negative k-Cycle., , и . SODA, стр. 2717-2724. SIAM, (2021)Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs., и . ISAAC, том 181 из LIPIcs, стр. 23:1-23:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Finding the KT Partition of a Weighted Graph in Near-Linear Time., , и . APPROX/RANDOM, том 245 из LIPIcs, стр. 32:1-32:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Fast and Longest Rollercoasters., , и . STACS, том 126 из LIPIcs, стр. 30:1-30:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)