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.

 

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

Property Testing on k-Vertex-Connectivity of Graphs., и . Algorithmica, 62 (3-4): 701-712 (2012)Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems., , и . SIAM J. Comput., 41 (4): 1074-1093 (2012)Every Property Is Testable on a Natural Class of Scale-Free Multigraphs.. ESA, том 57 из LIPIcs, стр. 51:1-51:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs., , и . Comput. Complex., 29 (1): 1 (2020)On computational complexity of graph inference from counting., , , , и . Nat. Comput., 12 (4): 589-603 (2013)Single-Player and Two-Player Buttons & Scissors Games., , , , , , , , , и 5 other автор(ы). CoRR, (2016)Modulation-Adaptive Link-Disjoint Path Selection Model for 1 + 1 Protected Elastic Optical Networks., , , , и . IEEE Access, (2019)Enumeration of isolated cliques and pseudo-cliques., и . ACM Trans. Algorithms, 5 (4): 40:1-40:21 (2009)Generalized River Crossing Problems., , и . Theory Comput. Syst., 56 (2): 418-435 (2015)Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image., , , и . ISAAC, том 1533 из Lecture Notes in Computer Science, стр. 149-158. Springer, (1998)