( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Max-Cut and Max-Bisection are NP-hard on unit disk graphs

, и . CoRR, (2006)

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.

Josep

Leonardo Díaz

Juan Díaz Ochoa

Gonzalo Díaz Díaz

Jesús Díaz y Díaz

 

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

Dynamic random graphs with vertex removal., , и . CoRR, (2022)Sharp threshold for hamiltonicity of random geometric graphs, , и . CoRR, (2006)EATCS Fellows 2019 - Call for Nominations.. Bull. EATCS, (2018)Complexity issues on bounded restrictive H-coloring., , и . Discret. Math., 307 (16): 2082-2093 (2007)Structural Complexity I, , и . EATCS Monographs on Theoretical Computer Science Springer, (1990)On the connectivity of dynamic random geometric graphs., , и . SODA, стр. 601-610. SIAM, (2008)Continuous Monitoring in the Dynamic Sensor Field Model., , , и . ALGOSENSORS, том 7111 из Lecture Notes in Computer Science, стр. 161-172. Springer, (2011)Recent Results on Parameterized H-Colorings., , и . Graphs, Morphisms and Statistical Physics, том 63 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 65-85. DIMACS/AMS, (2001)A new upper bound for 3-SAT., , , и . FSTTCS, том 2 из LIPIcs, стр. 163-174. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2008)On List k-Coloring Convex Bipartite Graphs., , , и . CoRR, (2020)