Nina Chiarelli

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 26

Top Topics

Tractable Cases

Bipartite Graph

Connected Dominating Set

Top Venues

Theor. Comput. Sci.

Discret. Appl. Math.

Publications

Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Martin Milanic, Peter Mursic, Robert Scheffler
The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs. SWAT (2024)
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy
Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction. CoRR (2024)
Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Martin Milanic, Peter Mursic, Robert Scheffler
The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs. CoRR (2024)
Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Joachim Schauer
Fair Allocation Algorithms for Indivisible Items under Structured Conflict Constraints. CoRR (2023)
Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
Fair Allocation of Indivisible Items with Conflict Graphs. Algorithmica 85 (5) (2023)
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy
Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph. CoRR (2023)
Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Joachim Schauer
Fair allocation algorithms for indivisible items under structured conflict constraints. Comput. Appl. Math. 42 (7) (2023)
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac
Allocation of indivisible items with individual preference graphs. Discret. Appl. Math. 334 (2023)
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac
Allocation of Indivisible Items with Individual Preference Graphs. CoRR (2022)
Nina Chiarelli, Berenice Martínez-Barona, Martin Milanic, Jérôme Monnot, Peter Mursic
Strong cliques in diamond-free graphs. Theor. Comput. Sci. 858 (2021)
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Nevena Pivac, Ulrich Pferschy
Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs. ADT (2021)
Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
Fair Packing of Independent Sets. IWOCA (2020)
Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaz Krnc, Martin Milanic, Nevena Pivac, Robert Scheffler, Martin Strehler
Edge Elimination and Weighted Graph Classes. WG (2020)
Nina Chiarelli, Berenice Martínez-Barona, Martin Milanic, Jérôme Monnot, Peter Mursic
Strong Cliques in Diamond-Free Graphs. WG (2020)
Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
Fair packing of independent sets. CoRR (2020)
Nina Chiarelli, Martin Milanic
Linear separation of connected dominating sets in graphs. Ars Math. Contemp. 16 (2) (2019)
Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, Maria Inés Lopez Pujato, Martin Milanic
-domination problems in proper interval graphs. Theor. Comput. Sci. 795 (2019)
Nina Chiarelli, Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma
Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity. Theor. Comput. Sci. 705 (2018)
Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, Maria Inés Lopez Pujato, Martin Milanic
New Algorithms for Weighted k-Domination and Total k-Domination Problems in Proper Interval Graphs. CoRR (2018)
Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, Maria Inés Lopez Pujato, Martin Milanic
Improved Algorithms for k-Domination and Total k-Domination in Proper Interval Graphs. ISCO (2018)
Nina Chiarelli, Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma
Minimum Connected Transversals in Graphs: New Hardness Results and Tractable Cases Using the Price of Connectivity. CoRR (2017)
Nina Chiarelli, Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Stefko Miklavic
On matching extendability of lexicographic products. RAIRO Oper. Res. 51 (3) (2017)
Endre Boros, Nina Chiarelli, Martin Milanic
Equistarable bipartite graphs. Discret. Math. 339 (7) (2016)
Nina Chiarelli, Martin Milanic
A threshold approach to connected domination. CoRR (2016)
Endre Boros, Nina Chiarelli, Martin Milanic
Equistarable bipartite graphs. CoRR (2015)
Nina Chiarelli, Martin Milanic
On a class of graphs between threshold and total domishold graphs. Discret. Appl. Math. 195 (2015)
Nina Chiarelli, Martin Milanic
Linear Separation of Connected Dominating Sets in Graphs. ISAIM (2014)
Nina Chiarelli, Martin Milanic
Total domishold graphs: A generalization of threshold graphs, with connections to threshold hypergraphs. Discret. Appl. Math. 179 (2014)
Nina Chiarelli, Martin Milanic
Linear Separation of Total Dominating Sets in Graphs CoRR (2013)
Nina Chiarelli, Martin Milanic
Linear Separation of Total Dominating Sets in Graphs. WG (2013)