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.

 

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

Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity., , , и . IPEC, том 285 из LIPIcs, стр. 5:1-5:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)The balanced connected subgraph problem for geometric intersection graphs., , , и . Theor. Comput. Sci., (2022)Multivariate Exploration of Metric Dilation., , , , , и . STACS, том 327 из LIPIcs, стр. 14:1-14:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2025)Parameterized Complexity of Perfectly Matched Sets., , , и . IPEC, том 249 из LIPIcs, стр. 2:1-2:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)The Balanced Connected Subgraph Problem., , , , , и . CALDAM, том 11394 из Lecture Notes in Computer Science, стр. 201-215. Springer, (2019)Parameterized complexity of perfectly matched sets., , , и . Theor. Comput. Sci., (мая 2023)The balanced connected subgraph problem., , , , , и . Discret. Appl. Math., (2022)Balanced Connected Subgraph Problem in Geometric Intersection Graphs., , , и . COCOA, том 11949 из Lecture Notes in Computer Science, стр. 56-68. Springer, (2019)Towards transitive-free digraphs., , и . Theor. Comput. Sci., (2025)A Parameterized Perspective of All-Colors., , и . CIAC (1), том 15679 из Lecture Notes in Computer Science, стр. 222-239. Springer, (2025)