( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Parameterized Algorithms for Finding Highly Connected Solution.

, , , и . CSR, том 13296 из Lecture Notes in Computer Science, стр. 1-16. Springer, (2022)

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.

Gregor Banik

Aritra Pal

Norbert Banik

Emil Banik

Norbert Banik

 

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

Parameterized algorithms for finding highly connected solution., , , и . Theor. Comput. Sci., (2023)Choice Is Hard., , , , , , и . ISAAC, том 9472 из Lecture Notes in Computer Science, стр. 318-328. Springer, (2015)Parameterized Complexity of Geometric Covering Problems Having Conflicts., , , , и . WADS, том 10389 из Lecture Notes in Computer Science, стр. 61-72. Springer, (2017)Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point., , и . WALCOM, том 6552 из Lecture Notes in Computer Science, стр. 98-109. Springer, (2011)Two-Round Discrete Voronoi Game along a Line., , , и . FAW-AAIM, том 7924 из Lecture Notes in Computer Science, стр. 210-220. Springer, (2013)Voronoi Game on Graphs., , , и . WALCOM, том 7748 из Lecture Notes in Computer Science, стр. 77-88. Springer, (2013)Parameterized Algorithms for Finding Highly Connected Solution., , , и . CSR, том 13296 из Lecture Notes in Computer Science, стр. 1-16. Springer, (2022)Tracking Paths., , , и . CIAC, том 10236 из Lecture Notes in Computer Science, стр. 67-79. (2017)The p-Center Problem in Tree Networks Revisited., , , , и . SWAT, том 53 из LIPIcs, стр. 6:1-6:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)A Polynomial Sized Kernel for Tracking Paths Problem., , , , и . LATIN, том 10807 из Lecture Notes in Computer Science, стр. 94-107. Springer, (2018)