Andreas Darmann

1. CHIARELLI, Nina, DALLARD, Clément Jean, DARMANN, Andreas, LENDL, Stefan, MILANIČ, Martin, MURŠIČ, Peter, PIVAČ, Nevena, PFERSCHY, Ulrich. Allocating indivisible items with minimum dissatisfaction on preference graphs. V: FOTAKIS, Dimitris (ur.), INSUA, David Rios (ur.). Algorithmic decision theory : proceedings. 7th International Conference, ADT 2021, Toulouse, France, November 3-5, 2021. Cham: Springer, cop. 2021. Str. 243-257, ilustr. Lecture notes in computer science, 13023. ISBN 978-3-030-87755-2, ISBN 978-3-030-87756-9. ISSN 0302-9743. https://link.springer.com/chapter/10.1007%2F978-3-030-87756-9_16, Repozitorij Univerze na Primorskem - RUP, DOI: 10.1007/978-3-030-87756-9_16. [COBISS.SI-ID 82723075]

2. CHIARELLI, Nina, DALLARD, Clément Jean, DARMANN, Andreas, LENDL, Stefan, MILANIČ, Martin, MURŠIČ, Peter, PFERSCHY, Ulrich, PIVAČ, Nevena. Allocation of indivisible items with individual preference graphs. Discrete applied mathematics. [Print ed.]. 2023, vol. 334, str. 45-62, ilustr. ISSN 0166-218X. https://www.sciencedirect.com/science/article/pii/S0166218X23000550?via%3Dihub, https://doi.org/10.1016/j.dam.2023.02.010, DOI: 10.1016/j.dam.2023.02.010. [COBISS.SI-ID 149106947]

3. CHIARELLI, Nina, DALLARD, Clément Jean, DARMANN, Andreas, LENDL, Stefan, MILANIČ, Martin, MURŠIČ, Peter, PFERSCHY, Ulrich. Minimizing maximum dissatisfaction in the allocation of indivisible items under a common preference graph. Discrete optimization. Nov. 2025, vol. 58, article 100913, str. 1-14, ilustr. ISSN 1572-5286. https://www.sciencedirect.com/science/article/pii/S1572528625000362?via%3Dihub, DOI: 10.1016/j.disopt.2025.100913. [COBISS.SI-ID 254230787]