( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
New Lower Bounds for the Number of (<=k)-Edges and the Rectilinear Crossing Number of Kn.

, , , и . Discret. Comput. Geom., 38 (1): 1-14 (2007)

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.

Jesús Pitarch López

Jesús García Molina

Ángel López García

Jesús Ángel Gomollón García

Oscar Jesús Garcia Suárez

 

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

New results on lower bounds for the number of (<=k)-facets., , , и . Eur. J. Comb., 30 (7): 1568-1574 (2009)New results on lower bounds for the number of (k)-facets: (extended abstract)., , , и . Electron. Notes Discret. Math., (2007)On properties of higher-order Delaunay graphs with applications., , , , , и . EuroCG, стр. 119-122. Technische Universiteit Eindhoven, (2005)New Lower Bounds for the Number of (<=k)-Edges and the Rectilinear Crossing Number of Kn., , , и . Discret. Comput. Geom., 38 (1): 1-14 (2007)Regularized greedy column subset selection., , и . Inf. Sci., (2019)Fitting a Set of Points by a Circle., и . SCG, стр. 139-146. ACM, (1997)Shortest paths and visibility inside triangulated curved polygons with applications to conic visibility., и . CCCG, (1998)Consecutive Guards., , и . CCCG, стр. 393-398. University of Saskatchewan, (1994)Bipartite Embeddings of Trees in the Plane., , , , и . Discret. Appl. Math., 93 (2-3): 141-148 (1999)Feasability of Design in Stereolithography., , , , , , , и . FSTTCS, том 761 из Lecture Notes in Computer Science, стр. 228-237. Springer, (1993)