default search action
Nina Chiarelli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c8]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: 7:1-7:20 - [i11]Nina Chiarelli, Clément Dallard
Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction. CoRR abs/2402.00921 (2024) - [i10]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 abs/2404.10670 (2024) - 2023
- [j11]Nina Chiarelli
Fair Allocation of Indivisible Items with Conflict Graphs. Algorithmica 85(5): 1459-1489 (2023) - [j10]Nina Chiarelli
Fair allocation algorithms for indivisible items under structured conflict constraints. Comput. Appl. Math. 42(7): 302 (2023) - [j9]Nina Chiarelli, Clément Dallard
Allocation of indivisible items with individual preference graphs. Discret. Appl. Math. 334: 45-62 (2023) - [i9]Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Joachim Schauer:
Fair Allocation Algorithms for Indivisible Items under Structured Conflict Constraints. CoRR abs/2308.09399 (2023) - [i8]Nina Chiarelli, Clément Dallard
Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph. CoRR abs/2312.01804 (2023) - 2022
- [i7]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 abs/2202.04465 (2022) - 2021
- [j8]Nina Chiarelli, Berenice Martínez-Barona, Martin Milanic
Strong cliques in diamond-free graphs. Theor. Comput. Sci. 858: 49-63 (2021) - [c7]Nina Chiarelli, Clément Dallard
Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs. ADT 2021: 243-257 - 2020
- [c6]Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
Fair Packing of Independent Sets. IWOCA 2020: 154-165 - [c5]Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaz Krnc, Martin Milanic, Nevena Pivac, Robert Scheffler
Edge Elimination and Weighted Graph Classes. WG 2020: 134-147 - [c4]Nina Chiarelli, Berenice Martínez-Barona, Martin Milanic, Jérôme Monnot, Peter Mursic:
Strong Cliques in Diamond-Free Graphs. WG 2020: 261-273 - [i6]Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer:
Fair packing of independent sets. CoRR abs/2003.11313 (2020)
2010 – 2019
- 2019
- [j7]Nina Chiarelli, Martin Milanic:
Linear separation of connected dominating sets in graphs. Ars Math. Contemp. 16(2): 487-525 (2019) - [j6]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. Theor. Comput. Sci. 795: 128-141 (2019) - 2018
- [j5]Nina Chiarelli, Tatiana Romina Hartinger, Matthew Johnson
Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity. Theor. Comput. Sci. 705: 75-83 (2018) - [c3]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: 290-302 - [i5]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 abs/1803.04327 (2018) - 2017
- [j4]Nina Chiarelli, Cemil Dibek
On matching extendability of lexicographic products. RAIRO Oper. Res. 51(3): 857-873 (2017) - [i4]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 abs/1706.08050 (2017) - 2016
- [j3]Endre Boros
Equistarable bipartite graphs. Discret. Math. 339(7): 1960-1969 (2016) - [i3]Nina Chiarelli, Martin Milanic:
A threshold approach to connected domination. CoRR abs/1610.06539 (2016) - 2015
- [j2]Nina Chiarelli, Martin Milanic
On a class of graphs between threshold and total domishold graphs. Discret. Appl. Math. 195: 43-58 (2015) - [i2]Endre Boros, Nina Chiarelli, Martin Milanic:
Equistarable bipartite graphs. CoRR abs/1502.06343 (2015) - 2014
- [j1]Nina Chiarelli, Martin Milanic
Total domishold graphs: A generalization of threshold graphs, with connections to threshold hypergraphs. Discret. Appl. Math. 179: 1-12 (2014) - [c2]Nina Chiarelli, Martin Milanic:
Linear Separation of Connected Dominating Sets in Graphs. ISAIM 2014 - 2013
- [c1]Nina Chiarelli, Martin Milanic:
Linear Separation of Total Dominating Sets in Graphs. WG 2013: 165-176 - [i1]Nina Chiarelli, Martin Milanic:
Linear Separation of Total Dominating Sets in Graphs. CoRR abs/1303.0944 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: