( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Efficient Approximation Algorithms in Random Intersection Graphs.

, , и . Handbook of Approximation Algorithms and Metaheuristics (2), Chapman and Hall/CRC, (2018)

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 Wahl

 

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

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)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)Mutants and Residents with Different Connection Graphs in the Moran Process., , , и . CoRR, (2017)Rationality authority for provable rational behavior., , , , и . PODC, стр. 289-290. ACM, (2011)Distributed communication algorithms for ad hoc mobile networks., , и . J. Parallel Distributed Comput., 63 (1): 58-74 (2003)Stably Computing Order Statistics with Arithmetic Population Protocols., , , и . MFCS, том 58 из LIPIcs, стр. 68:1-68:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Introduction to the special issue on foundations of adaptive networked societies of tiny artefacts., и . Comput. Sci. Rev., 5 (1): 4-6 (2011)