( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Gerrymandering Planar Graphs.

, , , , и . AAMAS, стр. 463-471. International Foundation for Autonomous Agents and Multiagent Systems / ACM, (2024)

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.

Peter Dippel

Max Dippel

Cordula Dippel

Rainer Dippel

Peter Dippel

 

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

One Dollar Each Eliminates Envy., , , , и . CoRR, (2019)One n Remains to Settle the Tree Conjecture., и . CoRR, (2023)An Improved Bound for the Tree Conjecture in Network Creation Games., и . CoRR, (2021)Gerrymandering Planar Graphs., , , , и . AAMAS, стр. 463-471. International Foundation for Autonomous Agents and Multiagent Systems / ACM, (2024)An Improved Approximation Algorithm for the Matching Augmentation Problem., , , и . ISAAC, том 212 из LIPIcs, стр. 38:1-38:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)An Improved Approximation Algorithm for the Matching Augmentation Problem., , , и . SIAM J. Discret. Math., 37 (1): 163-190 (марта 2023)An Improved Bound for the Tree Conjecture in Network Creation Games., и . SAGT, том 13584 из Lecture Notes in Computer Science, стр. 241-257. Springer, (2022)One Dollar Each Eliminates Envy., , , , и . EC, стр. 23-39. ACM, (2020)Eliminating Majority Illusion is Easy., , , , и . CoRR, (2024)One n Remains to Settle the Tree Conjecture., и . STACS, том 289 из LIPIcs, стр. 28:1-28:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)