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.

 

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

(Delta+1)-total-colorability of plane graphs with maximum degree Delta at least 6 and without adjacent short cycles., и . Inf. Process. Lett., 110 (18-19): 830-834 (2010)Flickr1024: A Dataset for Stereo Image Super-Resolution., , , , и . CoRR, (2019)Every planar graph without cycles of length 4 or 9 is (1, 1, 0)-colorable., , и . Discret. Math., 340 (9): 2108-2122 (2017)Distance Constraints on Short Cycles for 3-Colorability of Planar graphs., и . Graphs Comb., 31 (5): 1497-1505 (2015)On the 7 Total Colorability of Planar Graphs with Maximum Degree 6 and without 4-cycles., и . Graphs Comb., 25 (3): 401-407 (2009)Enhancing Mid-Low-Resolution Ship Detection With High-Resolution Feature Distillation., , , , , , и . IEEE Geosci. Remote. Sens. Lett., (2022)Symmetric Parallax Attention for Stereo Image Super-Resolution., , , , , и . CoRR, (2020)(3, 1)-Choosability of toroidal graphs with some forbidden short cycles., и . Discret. Appl. Math., (2015)Parallax Attention for Unsupervised Stereo Correspondence Learning., , , , , , и . IEEE Trans. Pattern Anal. Mach. Intell., 44 (4): 2108-2125 (2022)Planar graphs without cycles of length 4 or 5 are (3, 0, 0)(3, 0, 0)-colorable., , , , и . Discret. Math., 313 (20): 2312-2317 (2013)