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.

 

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

An Improved Algorithm for Finding Cycles Through Elements.. IPCO, том 5035 из Lecture Notes in Computer Science, стр. 374-384. Springer, (2008)Domination in a graph with a 2-factor., , и . J. Graph Theory, 52 (1): 1-6 (2006)2-connected 7-coverings of 3-connected graphs on surfaces., , и . J. Graph Theory, 43 (1): 26-36 (2003)Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set., , , и . PODC, стр. 283-285. ACM, (2020)Disjoint Even Cycles Packing., , , и . Electron. Notes Discret. Math., (2009)Three-coloring triangle-free planar graphs in linear time, , и . CoRR, (2013)NoSingles: a space-efficient algorithm for influence maximization., , , и . SSDBM, стр. 18:1-18:12. ACM, (2018)Cliques in Odd-Minor-Free Graphs., и . CATS, том 128 из CRPIT, стр. 133-138. Australian Computer Society, (2012)Improved Algorithm for the Half-Disjoint Paths Problem., и . APPROX-RANDOM, том 6302 из Lecture Notes in Computer Science, стр. 287-297. Springer, (2010)How Neural Networks Extrapolate: From Feedforward to Graph Neural Networks., , , , , и . ICLR, OpenReview.net, (2021)