Nina Chiarelli

34 papers B 3C 3Misc 1Journal 25Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
The burning game on graphs.
Discret. Math.
Nina Chiarelli, Vesna Irsic Chenoweth, Marko Jakovac, William B. Kinnersley, Mirjana Mikalacki
2025 J jnl
Minimizing maximum dissatisfaction in the allocation of indivisible items under a common preference graph.
Discret. Optim.
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy
2025 C conf
On {k}-Roman graphs.
LAGOS
Kenny Storgel, Nina Chiarelli, Lara Fernández, Jochen Pascal Gollin, Claire Hilaire, Valeria Leoni, Martin Milanic
2025 J jnl
Sandwich Monotonicity and the Recognition of Weighted Graph Classes.
CoRR
Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaz Krnc, Martin Milanic, Nevena Pivac, Robert Scheffler, Martin Strehler
2024 J jnl
Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction.
CoRR
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy
2024 — conf
The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs.
SWAT
Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Martin Milanic, Peter Mursic, Robert Scheffler
2024 J jnl
The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs.
CoRR
Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Martin Milanic, Peter Mursic, Robert Scheffler
2023 J jnl
Allocation of indivisible items with individual preference graphs.
Discret. Appl. Math.
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac
2023 J jnl
Fair Allocation Algorithms for Indivisible Items under Structured Conflict Constraints.
CoRR
Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Joachim Schauer
2023 J jnl
Fair Allocation of Indivisible Items with Conflict Graphs.
Algorithmica
Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
2023 J jnl
Fair allocation algorithms for indivisible items under structured conflict constraints.
Comput. Appl. Math.
Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Joachim Schauer
2023 J jnl
Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph.
CoRR
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy
2022 J jnl
Allocation of Indivisible Items with Individual Preference Graphs.
CoRR
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac
2021 — conf
Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs.
ADT
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Nevena Pivac, Ulrich Pferschy
2021 J jnl
Strong cliques in diamond-free graphs.
Theor. Comput. Sci.
Nina Chiarelli, Berenice Martínez-Barona, Martin Milanic, Jérôme Monnot, Peter Mursic
2020 B conf
Edge Elimination and Weighted Graph Classes.
WG
Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaz Krnc, Martin Milanic, Nevena Pivac, Robert Scheffler, Martin Strehler
2020 C conf
Fair Packing of Independent Sets.
IWOCA
Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
2020 J jnl
Fair packing of independent sets.
CoRR
Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
2020 B conf
Strong Cliques in Diamond-Free Graphs.
WG
Nina Chiarelli, Berenice Martínez-Barona, Martin Milanic, Jérôme Monnot, Peter Mursic
2019 J jnl
Linear separation of connected dominating sets in graphs.
Ars Math. Contemp.
Nina Chiarelli, Martin Milanic
2019 J jnl
New algorithms for weighted
Theor. Comput. Sci.
Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, María Inés Lopez Pujato, Martin Milanic
2018 C conf
Improved Algorithms for k-Domination and Total k-Domination in Proper Interval Graphs.
ISCO
Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, María Inés Lopez Pujato, Martin Milanic
2018 J jnl
Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity.
Theor. Comput. Sci.
Nina Chiarelli, Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma
2018 J jnl
New Algorithms for Weighted k-Domination and Total k-Domination Problems in Proper Interval Graphs.
CoRR
Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, María Inés Lopez Pujato, Martin Milanic
2017 J jnl
Minimum Connected Transversals in Graphs: New Hardness Results and Tractable Cases Using the Price of Connectivity.
CoRR
Nina Chiarelli, Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma
2017 J jnl
On matching extendability of lexicographic products.
RAIRO Oper. Res.
Nina Chiarelli, Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Stefko Miklavic
2016 J jnl
A threshold approach to connected domination.
CoRR
Nina Chiarelli, Martin Milanic
2016 J jnl
Equistarable bipartite graphs.
Discret. Math.
Endre Boros, Nina Chiarelli, Martin Milanic
2015 J jnl
Equistarable bipartite graphs.
CoRR
Endre Boros, Nina Chiarelli, Martin Milanic
2015 J jnl
On a class of graphs between threshold and total domishold graphs.
Discret. Appl. Math.
Nina Chiarelli, Martin Milanic
2014 Misc conf
Linear Separation of Connected Dominating Sets in Graphs.
ISAIM
Nina Chiarelli, Martin Milanic
2014 J jnl
Total domishold graphs: A generalization of threshold graphs, with connections to threshold hypergraphs.
Discret. Appl. Math.
Nina Chiarelli, Martin Milanic
2013 J jnl
Linear Separation of Total Dominating Sets in Graphs
CoRR
Nina Chiarelli, Martin Milanic
2013 B conf
Linear Separation of Total Dominating Sets in Graphs.
WG
Nina Chiarelli, Martin Milanic