( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Theta-3 is connected.

, , , , , , , и . CCCG, Carleton University, Ottawa, Canada, (2013)

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.

Bruno Korman

Gisela Korman

Talat Korman

Josef Korman

Matias Mieth

 

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

Routing in Histograms., , , , , , , и . WALCOM, том 12049 из Lecture Notes in Computer Science, стр. 43-54. Springer, (2020)Reconfiguration of connected graph partitions., , , , , , , , и . J. Graph Theory, 102 (1): 35-66 (2023)Some properties of higher order delaunay and gabriel graphs., , , , , , и . CCCG, стр. 13-16. (2010)The 1-Center and 1-Highway Problem., , , и . EGC, том 7579 из Lecture Notes in Computer Science, стр. 155-165. Springer, (2011)Convex Hulls in Polygonal Domains., , , и . SWAT, том 101 из LIPIcs, стр. 8:1-8:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Balanced Line Separators of Unit Disk Graphs., , , , , , , , и . WADS, том 10389 из Lecture Notes in Computer Science, стр. 241-252. Springer, (2017)Optimal Insertion of a Segment Highway in a City Metric., и . COCOON, том 5092 из Lecture Notes in Computer Science, стр. 611-620. Springer, (2008)Experimental Study of Compressed Stack Algorithms in Limited Memory Environments., , и . CoRR, (2017)Time-space trade-offs for triangulating a simple polygon., , , , и . J. Comput. Geom., 8 (1): 105-124 (2017)Packing Short Plane Spanning Trees in Complete Geometric Graphs., , , , , , , и . ISAAC, том 64 из LIPIcs, стр. 9:1-9:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)