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.

 

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

On the SIG dimension of trees under $L_ınfty$ metric., , и . CoRR, (2009)Tight Bounds for Gomory-Hu-like Cut Counting., , и . CoRR, (2015)Faster exact algorithms for some terminal set problems., , , , , и . J. Comput. Syst. Sci., (2017)Refined Lower Bounds for Nearest Neighbor Condensation.. ALT, том 167 из Proceedings of Machine Learning Research, стр. 262-281. PMLR, (2022)Towards a Theory of Parameterized Streaming Algorithms., и . IPEC, том 148 из LIPIcs, стр. 7:1-7:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Shadowless Solutions for Fixed-Parameter Tractability of Directed Graphs., и . Encyclopedia of Algorithms, (2016)A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs.. CIAC, том 12701 из Lecture Notes in Computer Science, стр. 187-201. Springer, (2021)How Does Fairness Affect the Complexity of Gerrymandering?, , и . AAMAS, стр. 2869-2871. ACM, (2023)List H-Coloring a Graph by Removing Few Vertices., , и . Algorithmica, 78 (1): 110-146 (2017)Parameterized Approximation Algorithms for Bidirected Steiner Network Problems., , и . ACM Trans. Algorithms, 17 (2): 12:1-12:68 (2021)