( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Approximation Algorithms for B 1-EPG Graphs.

, , и . WADS, том 8037 из Lecture Notes in Computer Science, стр. 328-340. Springer, (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.

Karin Birge Gilardoni-Büch

Andrea Gilardoni

Alexander Gilanschah

Roger Gilabert-Oriol

Parviz Gila

 

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

Approximation Schemes for Covering and Packing., , , и . WALCOM, том 7748 из Lecture Notes in Computer Science, стр. 89-100. Springer, (2013)Conflict-Free Coloring of Points on a Line with respect to a Set of Intervals., , и . CCCG, стр. 93-96. Carleton University, Ottawa, Canada, (2007)Typeness for omega-Regular Automata., , и . ATVA, том 3299 из Lecture Notes in Computer Science, стр. 324-338. Springer, (2004)Approximation Schemes for Covering and Packing, , , и . CoRR, (2012)A Scheme for Computing Minimum Covers within Simple Regions., и . WADS, том 5664 из Lecture Notes in Computer Science, стр. 447-458. Springer, (2009)Stabbing Polygonal Chains with Rays is Hard to Approximate., , и . CCCG, Carleton University, Ottawa, Canada, (2013)Symmetric Connectivity with Directional Antennas., , и . ALGOSENSORS, том 7718 из Lecture Notes in Computer Science, стр. 18-29. Springer, (2012)Student Poster Session., , , и . WG, том 7551 из Lecture Notes in Computer Science, стр. 4-6. Springer, (2012)Settling the bound on the rectilinear link radius of a simple rectilinear polygon., и . Inf. Process. Lett., 111 (3): 103-106 (2011)A Scheme for Computing Minimum Covers within Simple Regions., и . Algorithmica, 62 (1-2): 349-360 (2012)