( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Inverse Voronoi Problem in Graphs I: Hardness.

, , , и . Algorithmica, 82 (10): 3018-3040 (2020)

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.

Dubravko Bojanovski

Béatrice Mohar

Béatrice Mohar

Béatrice Mohar

Béatrice Mohar

 

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

Bishellable drawings of Kn., , , , , , , , и . CoRR, (2015)Dan Archdeacon (11 May 1954 to 18 February 2015)., , и . Ars Math. Contemp., (2017)Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard., и . SIAM J. Comput., 42 (5): 1803-1829 (2013)Do We Really Understand the Crossing Numbers?. MFCS, том 6281 из Lecture Notes in Computer Science, стр. 38-41. Springer, (2010)Embedding Graphs in the Torus in Linear Time., , и . IPCO, том 920 из Lecture Notes in Computer Science, стр. 360-363. Springer, (1995)Ordering without Forbidden Patterns., , и . ESA, том 8737 из Lecture Notes in Computer Science, стр. 554-565. Springer, (2014)Preface., , , , и . Discussiones Mathematicae Graph Theory, 23 (2): 205 (2003)Coloring parameters for graphs on surfaces., и . Electron. Notes Discret. Math., (2008)Game of cops and robbers in oriented quotients of the integer grid., и . Discret. Math., 341 (2): 439-450 (2018)Universal obstructions for embedding extension problems.. Australas. J Comb., (2006)