( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Gap-planar Graphs.

, , , , , , , , , , и . CoRR, (2017)

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

 

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

Minimizing interference in ad hoc networks with bounded communication radius.. Inf. Process. Lett., 112 (19): 748-752 (2012)Memory-Constrained Algorithms for Simple Polygons, , , , , , и . CoRR, (2011)Dynamic Graph Coloring., , , , , , и . WADS, том 10389 из Lecture Notes in Computer Science, стр. 97-108. Springer, (2017)Routing in polygonal domains., , , , , , , , , и . Comput. Geom., (2020)Routing on the Visibility Graph., , , и . ISAAC, том 92 из LIPIcs, стр. 18:1-18:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)On Interference Among Moving Sensors and Related Problems., , , , , и . ESA, том 57 из LIPIcs, стр. 34:1-34:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Establishing Strong Connectivity using Optimal Radius Half-Disk Antennas., , , , , , и . CCCG, (2011)Hanabi is NP-complete, Even for Cheaters who Look at Their Cards., , , , , , , и . FUN, том 49 из LIPIcs, стр. 4:1-4:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Cannibal Animal Games: a new variant of Tic-Tac-Toe., , , , , , и . J. Inf. Process., 23 (3): 265-271 (2015)Negative Instance for the Edge Patrolling Beacon Problem., , , , , , , и . JCDCGGG, том 13034 из Lecture Notes in Computer Science, стр. 28-35. Springer, (2018)