Researcher Portfolio
Kleer, Pieter
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Researcher Profile
Position: Algorithms and Complexity, MPI for Informatics, Max Planck Society
Researcher ID: https://pure.mpg.de/cone/persons/resource/persons250027
Publications
: Kleer, P., & Simon, H. U. (2023). Primal and Dual Combinatorial Dimensions. Discrete Applied Mathematics, 327, 185-196. doi:10.1016/j.dam.2022.11.010. [PubMan] : Antoniadis, A., Gouleakis, T., Kleer, P., & Kolev, P. (2023). Secretary and Online Matching Problems with Machine Learned Advice. Discrete Optimization, 48(2): 100778. doi:10.1016/j.disopt.2023.100778. [PubMan] : Amanatidis, G., & Kleer, P. (2022). Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices. SIAM Journal on Discrete Mathematics, 36(1), 118-146. doi:10.1137/20M1352697. [PubMan] : Kleer, P. (2021). Sampling from the Gibbs Distribution in Congestion Games. In P. Biró, S. Chawla, F. Echenique, & E. Sodomka (Eds. ), EC '21 (pp. 679-680). New York, NY: ACM. doi:10.1145/3465456.3467597. [PubMan] : Kleer, P., & Simon, H. U. (2021). Primal and Dual Combinatorial Dimensions. Retrieved from https://arxiv.org/abs/2108.10037. [PubMan] : Dyer, M., Greenhill, C., Kleer, P., Ross, J., & Stougie, L. (2021). Sampling Hypergraphs with Given Degrees. Discrete Mathematics, 344(11): 112566. doi:10.1016/j.disc.2021.112566. [PubMan] : Kleer, P. (2021). Sampling from the Gibbs Distribution in Congestion Games. Retrieved from https://arxiv.org/abs/2105.12982. [PubMan] : Amanatidis, G., & Kleer, P. (2021). Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals. Retrieved from https://arxiv.org/abs/2110.09068. [PubMan] : Kleer, P., & Schäfer, G. (2021). Computation and Efficiency of Potential Function Minimizers of Combinatorial Congestion Games. Mathematical Programming, 190(1), 523-560. doi:10.1007/s10107-020-01546-6. [PubMan] : Kleer, P., Patel, V., & Stroh, F. (2020). Switch-Based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs. The Electronic Journal of Combinatorics, 27(4): P4.29. doi:10.37236/9503. [PubMan] : Antoniadis, A., Gouleakis, T., Kleer, P., & Kolev, P. (2020). Secretary and Online Matching Problems with Machine Learned Advice. In H. Larochelle, M. Ranzato, R. Hadsell, M. F. Balcan, & H. Lin (Eds. ), Advances in Neural Information Processing Systems 33 (pp. 7933-7944). Curran Associates, Inc. [PubMan] : Amanatidis, G., & Kleer, P. (2020). Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences. Random Structures and Algorithms, 57(3), 637-657. doi:10.1002/rsa.20949. [PubMan] : Kleer, P., & Schäfer, G. (2020). Topological Price of Anarchy Bounds for Clustering Games on Networks. doi:10.1007/978-3-030-35389-6_18. [PubMan] : Dyer, M., Greenhill, C., Kleer, P., Ross, J., & Stougie, L. (2020). Sampling Hypergraphs with Given Degrees. Retrieved from https://arxiv.org/abs/2006.12021. [PubMan] : Antoniadis, A., Gouleakis, T., Kleer, P., & Kolev, P. (2020). Secretary and Online Matching Problems with Machine Learned Advice. Retrieved from https://arxiv.org/abs/2006.01026. [PubMan]