Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity N Chiarelli, TR Hartinger, M Johnson, M Milanič, D Paulusma Theoretical Computer Science 705, 75-83, 2018 | 27 | 2018 |

New algorithms for weighted k-domination and total k-domination problems in proper interval graphs N Chiarelli, TR Hartinger, VA Leoni, MIL Pujato, M Milanič Theoretical Computer Science 795, 128-141, 2019 | 16 | 2019 |

Linear separation of connected dominating sets in graphs N Chiarelli, M Milanič arXiv preprint arXiv:1610.06539, 2016 | 13 | 2016 |

Fair packing of independent sets N Chiarelli, M Krnc, M Milanič, U Pferschy, N Pivač, J Schauer Combinatorial Algorithms: 31st International Workshop, IWOCA 2020, Bordeaux …, 2020 | 9 | 2020 |

Fair allocation of indivisible items with conflict graphs N Chiarelli, M Krnc, M Milanič, U Pferschy, N Pivač, J Schauer Algorithmica 85 (5), 1459-1489, 2023 | 8 | 2023 |

Equistarable bipartite graphs E Boros, N Chiarelli, M Milanič Discrete mathematics 339 (7), 1960-1969, 2016 | 8 | 2016 |

Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs N Chiarelli, M Milanič Discrete Applied Mathematics 179, 1-12, 2014 | 8 | 2014 |

Strong cliques in diamond-free graphs N Chiarelli, B Martínez-Barona, M Milanič, J Monnot, P Muršič Theoretical Computer Science 858, 49-63, 2021 | 7 | 2021 |

Improved Algorithms for *k*-Domination and Total *k*-Domination in Proper Interval GraphsN Chiarelli, TR Hartinger, VA Leoni, MI Lopez Pujato, M Milanič International Symposium on Combinatorial Optimization, 290-302, 2018 | 7 | 2018 |

Linear separation of total dominating sets in graphs N Chiarelli, M Milanič Graph-Theoretic Concepts in Computer Science: 39th International Workshop …, 2013 | 5 | 2013 |

Allocating indivisible items with minimum dissatisfaction on preference graphs N Chiarelli, C Dallard, A Darmann, S Lendl, M Milanič, P Muršič, N Pivač, ... Algorithmic Decision Theory: 7th International Conference, ADT 2021 …, 2021 | 3 | 2021 |

Edge elimination and weighted graph classes J Beisegel, N Chiarelli, E Köhler, M Krnc, M Milanič, N Pivač, R Scheffler, ... Graph-Theoretic Concepts in Computer Science: 46th International Workshop …, 2020 | 3 | 2020 |

On a class of graphs between threshold and total domishold graphs N Chiarelli, M Milanič Discrete Applied Mathematics 195, 43-58, 2015 | 3 | 2015 |

The simultaneous interval number: A new width parameter that measures the similarity to interval graphs J Beisegel, N Chiarelli, E Köhler, M Milanič, P Muršič, R Scheffler arXiv preprint arXiv:2404.10670, 2024 | 2 | 2024 |

Allocation of indivisible items with individual preference graphs N Chiarelli, C Dallard, A Darmann, S Lendl, M Milanič, P Muršič, ... Discrete Applied Mathematics 334, 45-62, 2023 | 2 | 2023 |

On matching extendability of lexicographic products N Chiarelli, C Dibek, T Ekim, D Gözüpek, Š Miklavič RAIRO-Operations Research 51 (3), 857-873, 2017 | 1 | 2017 |

Burning game N Chiarelli, V Iršič, M Jakovac, WB Kinnersley, M Mikalački arXiv preprint arXiv:2409.11328, 2024 | | 2024 |

Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction N Chiarelli, C Dallard, A Darmann, S Lendl, M Milanič, P Muršič, ... arXiv preprint arXiv:2402.00921, 2024 | | 2024 |

Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph N Chiarelli, C Dallard, A Darmann, S Lendl, M Milanič, P Muršič, ... arXiv preprint arXiv:2312.01804, 2023 | | 2023 |

Fair allocation algorithms for indivisible items under structured conflict constraints N Chiarelli, M Krnc, M Milanič, U Pferschy, J Schauer Computational and Applied Mathematics 42 (7), 302, 2023 | | 2023 |