From post

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.

 

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

Listing All Maximal k-Plexes in Temporal Graphs., , , , , и . ASONAM, стр. 41-46. IEEE Computer Society, (2018)Computational complexity aspects of point visibility graphs., , , , и . Discret. Appl. Math., (2019)Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems., , , и . Commun. ACM, 67 (4): 70-79 (апреля 2024)Listing All Maximal k-Plexes in Temporal Graphs., , , , , и . ACM Journal of Experimental Algorithmics, 24 (1): 1.13:1-1.13:27 (2019)Efficient computation of optimal temporal walks under waiting-time constraints., , , и . Appl. Netw. Sci., 5 (1): 73 (2020)Finding Temporal Paths Under Waiting Time Constraints., , , и . Algorithmica, 83 (9): 2754-2802 (2021)Multistage graph problems on a global budget., , , , , и . Theor. Comput. Sci., (2021)On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering., , , и . CIAC, том 12701 из Lecture Notes in Computer Science, стр. 216-230. Springer, (2021)The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints., , , и . CoRR, (2019)Multistage Problems on a Global Budget., , , , , и . CoRR, (2019)