( en | de | ru )

 

Disambiguation of "Chiarelli, Nina"

Author of the publication

copydeleteadd this publication to your clipboard
Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph.

, , , , , , and . CoRR, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Anup Sam Ninan

Fernando Nina

Nina Heekerens

Untersuchungen zur Pododermatitis bei Kaninchen und Meerschweinchen. TierH Hannover, (2009)

Nina Segnitz

Effekte chronischer antipsychotischer Behandlung mit Aripiprazol auf die Expression glutamaterger und GABAerger Markergene. Uni München, (2009)

Nina Raabe

Single-shot-echoplanare, diffusionsgewichtete MRT zur Differenzierung von Erkrankungen des Pankreas: eine quantitative und qualitative Auswertung. Uni Greifswald, (2009)
 

Other publications of authors with the same name

Improved Algorithms for k-Domination and Total k-Domination in Proper Interval Graphs., , , , and . ISCO, volume 10856 of Lecture Notes in Computer Science, page 290-302. Springer, (2018)Allocation of indivisible items with individual preference graphs., , , , , , , and . Discret. Appl. Math., (July 2023)Total domishold graphs: A generalization of threshold graphs, with connections to threshold hypergraphs., and . Discret. Appl. Math., (2014)Linear Separation of Connected Dominating Sets in Graphs., and . ISAIM, (2014)Allocation of Indivisible Items with Individual Preference Graphs., , , , , , , and . CoRR, (2022)Fair allocation algorithms for indivisible items under structured conflict constraints., , , , and . Comput. Appl. Math., 42 (7): 302 (October 2023)Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity., , , , and . Theor. Comput. Sci., (2018)Linear separation of connected dominating sets in graphs., and . Ars Math. Contemp., 16 (2): 487-525 (2019)Linear Separation of Total Dominating Sets in Graphs., and . WG, volume 8165 of Lecture Notes in Computer Science, page 165-176. Springer, (2013)Minimum Connected Transversals in Graphs: New Hardness Results and Tractable Cases Using the Price of Connectivity., , , , and . CoRR, (2017)