( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies.

, , , и . J. Discrete Algorithms, 4 (3): 433-454 (2006)

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.

Paul-G Behler

Paul G Lankisch

Paul G Lankisch

Giuseppe G G Manzardo

G Verch

 

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

Potential Functions in Strategic Games., и . CSR, том 7913 из Lecture Notes in Computer Science, стр. 283-297. Springer, (2013)The Complexity of Optimal Design of Temporally Connected Graphs., , , и . Theory Comput. Syst., 61 (3): 907-944 (2017)Scheduling tasks with dependencies on asymmetric multiprocessors., , и . PODC, стр. 454. ACM, (2008)Fundamental Control Algorithms in Mobile Networks., , , , и . SPAA, стр. 251-260. ACM, (1999)Efficient Approximation Algorithms in Random Intersection Graphs., , и . Handbook of Approximation Algorithms and Metaheuristics (2), Chapman and Hall/CRC, (2018)Randomized Approximation Techniques., и . Handbook of Approximation Algorithms and Metaheuristics (1), Chapman and Hall/CRC, (2018)Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs., , и . MFCS, том 7464 из Lecture Notes in Computer Science, стр. 728-739. Springer, (2012)Mutants and Residents with Different Connection Graphs in the Moran Process., , , и . LATIN, том 10807 из Lecture Notes in Computer Science, стр. 790-804. Springer, (2018)The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs., , и . ICALP, том 3142 из Lecture Notes in Computer Science, стр. 1029-1040. Springer, (2004)Stably Computing Order Statistics with Arithmetic Population Protocols., , , и . MFCS, том 58 из LIPIcs, стр. 68:1-68:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)