On selfish creation of robust networks A Chauhan, P Lenzner, A Melnichenko, M Münn Algorithmic Game Theory: 9th International Symposium, SAGT 2016, Liverpool …, 2016 | 21 | 2016 |
Selfish network creation with non-uniform edge cost A Chauhan, P Lenzner, A Melnichenko, L Molitor Algorithmic Game Theory: 10th International Symposium, SAGT 2017, L’Aquila …, 2017 | 19 | 2017 |
Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming T Kötzing, JAG Lagodzinski, J Lengler, A Melnichenko Theoretical Computer Science 816, 96-113, 2020 | 12 | 2020 |
Geometric network creation games D Bilò, T Friedrich, P Lenzner, A Melnichenko The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 323-332, 2019 | 10 | 2019 |
Selfish creation of social networks D Bilò, T Friedrich, P Lenzner, S Lowski, A Melnichenko Proceedings of the AAAI Conference on Artificial Intelligence 35 (6), 5185-5193, 2021 | 9 | 2021 |
Flow-based network creation games H Echzell, T Friedrich, P Lenzner, A Melnichenko arXiv preprint arXiv:2006.14964, 2020 | 6 | 2020 |
Network creation with homophilic agents M Bullinger, P Lenzner, A Melnichenko arXiv preprint arXiv:2204.13757, 2022 | 4 | 2022 |
Social distancing network creation T Friedrich, H Gawendowicz, P Lenzner, A Melnichenko Algorithmica, 1-44, 2023 | 2 | 2023 |
Efficiency and stability in euclidean network design W Friedemann, T Friedrich, H Gawendowicz, P Lenzner, A Melnichenko, ... Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and …, 2021 | 2 | 2021 |
Fair tree connection games with topology-dependent edge cost D Bilò, T Friedrich, P Lenzner, A Melnichenko, L Molitor arXiv preprint arXiv:2009.10988, 2020 | 2 | 2020 |
Analyzing search heuristics with differential equations T Friedrich, T Kötzing, A Melnichenko Proceedings of the Genetic and Evolutionary Computation Conference Companion …, 2017 | 1 | 2017 |
Selfish Creation of Realistic Networks A Melnichenko Universität Potsdam, 2022 | | 2022 |