( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On Induced Online Ramsey Number of Paths, Cycles, and Trees.

, , и . CSR, том 11532 из Lecture Notes in Computer Science, стр. 60-69. Springer, (2019)

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.

Václav Frolec

Václav Umlauf

Václav Pohl

Václav Kazda

Václav RÌ ehounek

 

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

Computing m-Eternal Domination Number of Cactus Graphs in Linear Time., , и . CoRR, (2023)On the Intersections of Non-homotopic Loops., , , и . CALDAM, том 12601 из Lecture Notes in Computer Science, стр. 196-205. Springer, (2021)On the Smallest Synchronizing Terms of Finite Tree Automata., , и . CIAA, том 14151 из Lecture Notes in Computer Science, стр. 79-90. Springer, (2023)A Simpler Bit-parallel Algorithm for Swap Matching., , и . CoRR, (2016)Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set., , , , , и . WAOA, том 12982 из Lecture Notes in Computer Science, стр. 23-38. Springer, (2021)Polynomial kernels for tracking shortest paths., , , , , и . Inf. Process. Lett., (2023)On the m-eternal Domination Number of Cactus Graphs., , и . RP, том 11674 из Lecture Notes in Computer Science, стр. 33-47. Springer, (2019)Efficient attack sequences in m-eternal domination., , и . CoRR, (2022)Constant factor approximation for tracking paths and fault tolerant feedback vertex set., , , , , и . Discret. Optim., (февраля 2023)Polynomial Kernels for Tracking Shortest Paths., , , , , и . CoRR, (2022)