Linear Separation of Total Dominating Sets in Graphs. - Nina Chiarelli; Martin Milanic (WG, 2013)

Linear Separation of Connected Dominating Sets in Graphs. - Nina Chiarelli; Martin Milanic (ISAIM, 2014)

Total domishold graphs: A generalization of threshold graphs, with connections to threshold hypergraphs. - Nina Chiarelli; Martin Milanic (Discret. Appl. Math., 2014)

On a class of graphs between threshold and total domishold graphs. - Nina Chiarelli; Martin Milanic (Discret. Appl. Math., 2015)

A threshold approach to connected domination. - Nina Chiarelli; Martin Milanic (CoRR, 2016)

Equistarable bipartite graphs. - Endre Boros; Nina Chiarelli; Martin Milanic (Discret. Math., 2016)

On matching extendability of lexicographic products. - Nina Chiarelli; Cemil Dibek; Tínaz Ekim; Didem Gözüpek; Stefko Miklavic (RAIRO Oper. Res., 2017)

Improved Algorithms for k-Domination and Total k-Domination in Proper Interval Graphs. - Nina Chiarelli; Tatiana Romina Hartinger; Valeria Alejandra Leoni; María Inés Lopez Pujato; Martin Milanic (ISCO, 2018)

New Algorithms for Weighted k-Domination and Total k-Domination Problems in Proper Interval Graphs. - Nina Chiarelli; Tatiana Romina Hartinger; Valeria Alejandra Leoni; María Inés Lopez Pujato; Martin Milanic (CoRR, 2018)

Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity. - Nina Chiarelli; Tatiana Romina Hartinger; Matthew Johnson 002; Martin Milanic; Daniël Paulusma (Theor. Comput. Sci., 2018)

New algorithms for weighted k-domination and total k-domination problems in proper interval graphs. - Nina Chiarelli; Tatiana Romina Hartinger; Valeria Alejandra Leoni; María Inés Lopez Pujato; Martin Milanic (Theor. Comput. Sci., 2019)

Fair Packing of Independent Sets. - Nina Chiarelli; Matjaz Krnc; Martin Milanic; Ulrich Pferschy; Nevena Pivac; Joachim Schauer (IWOCA, 2020)

Edge Elimination and Weighted Graph Classes. - Jesse Beisegel; Nina Chiarelli; Ekkehard Köhler; Matjaz Krnc; Martin Milanic; Nevena Pivac; Robert Scheffler 001; Martin Strehler 001 (WG, 2020)

Strong Cliques in Diamond-Free Graphs. - Nina Chiarelli; Berenice Martínez-Barona; Martin Milanic; Jérôme Monnot; Peter Mursic (WG, 2020)

Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs. - Nina Chiarelli; Clément Dallard; Andreas Darmann; Stefan Lendl; Martin Milanic; Peter Mursic; Nevena Pivac; Ulrich Pferschy (ADT, 2021)

Fair Allocation of Indivisible Items with Conflict Graphs. - Nina Chiarelli; Matjaz Krnc; Martin Milanic; Ulrich Pferschy; Nevena Pivac; Joachim Schauer (Algorithmica, 2023)

Allocation of indivisible items with individual preference graphs. - Nina Chiarelli; Clément Dallard; Andreas Darmann; Stefan Lendl; Martin Milanic; Peter Mursic; Ulrich Pferschy; Nevena Pivac (Discret. Appl. Math., 2023)

Fair allocation algorithms for indivisible items under structured conflict constraints. - Nina Chiarelli; Matjaz Krnc; Martin Milanic; Ulrich Pferschy; Joachim Schauer (Comput. Appl. Math., 2023)

The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs. - Jesse Beisegel; Nina Chiarelli; Ekkehard Köhler; Martin Milanic; Peter Mursic; Robert Scheffler 001 (SWAT, 2024)

Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction. - Nina Chiarelli; Clément Dallard; Andreas Darmann; Stefan Lendl; Martin Milanic; Peter Mursic; Ulrich Pferschy (CoRR, 2024)

Minimizing maximum dissatisfaction in the allocation of indivisible items under a common preference graph. - Nina Chiarelli; Clément Dallard; Andreas Darmann; Stefan Lendl; Martin Milanic; Peter Mursic; Ulrich Pferschy (Discret. Optim., 2025)

Sandwich Monotonicity and the Recognition of Weighted Graph Classes. - Jesse Beisegel; Nina Chiarelli; Ekkehard Köhler; Matjaz Krnc; Martin Milanic; Nevena Pivac; Robert Scheffler 001; Martin Strehler 001 (CoRR, 2025)