( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Minimum Rectilinear Polygons for Given Angle Sequences.

, , , , , и . CoRR, (2016)

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.

Nathan S Evans

Ilselore Evans

Jonathan Evans

Richard Evans

Neil Evans

 

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

Clone Detection via Structural Abstraction., , и . Structure-Based Compression of Complex Massive Data, том 08261 из Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2008)Signal Propagation, with Application to a Lower Bound on the Depth of Noisy Formulas, и . FOCS, стр. 594-603. IEEE Computer Society, (1993)SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs., , , и . ISAAC, том 8283 из Lecture Notes in Computer Science, стр. 185-195. Springer, (2013)Ortho-Polygon Visibility Representations of Embedded Graphs., , , , , , и . GD, том 9801 из Lecture Notes in Computer Science, стр. 280-294. Springer, (2016)Profile-Guided Code Compression., и . PLDI, стр. 95-105. ACM, (2002)Visualization of Bipartite Graphs in Limited Window Size., , и . SOFSEM, том 14519 из Lecture Notes in Computer Science, стр. 198-210. Springer, (2024)Fractional Bamboo Trimming and Distributed Windows Scheduling., , и . SOFSEM, том 14519 из Lecture Notes in Computer Science, стр. 69-81. Springer, (2024)On k-Guarding Polygons., , и . CCCG, Carleton University, Ottawa, Canada, (2013)On characterizing terrain visibility graphs., и . J. Comput. Geom., 6 (1): 108-141 (2015)Lower Bounds for Noisy Boolean Decision Trees., и . STOC, стр. 620-628. ACM, (1996)