Spremljaj
Nina Chiarelli
Nina Chiarelli
Preverjeni e-poštni naslov na famnit.upr.si - Domača stran
Naslov
Navedeno
Navedeno
Leto
Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
N Chiarelli, TR Hartinger, M Johnson, M Milanič, D Paulusma
Theoretical Computer Science 705, 75-83, 2018
222018
New algorithms for weighted k-domination and total k-domination problems in proper interval graphs
N Chiarelli, TR Hartinger, VA Leoni, MIL Pujato, M Milanič
Theoretical Computer Science 795, 128-141, 2019
132019
Linear separation of connected dominating sets in graphs
N Chiarelli, M Milanič
arXiv preprint arXiv:1610.06539, 2016
122016
Improved Algorithms for k-Domination and Total k-Domination in Proper Interval Graphs
N Chiarelli, TR Hartinger, VA Leoni, MI Lopez Pujato, M Milanič
International Symposium on Combinatorial Optimization, 290-302, 2018
72018
Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs
N Chiarelli, M Milanič
Discrete Applied Mathematics 179, 1-12, 2014
72014
Fair packing of independent sets
N Chiarelli, M Krnc, M Milanič, U Pferschy, N Pivač, J Schauer
International Workshop on Combinatorial Algorithms, 154-165, 2020
62020
Equistarable bipartite graphs
E Boros, N Chiarelli, M Milanič
Discrete mathematics 339 (7), 1960-1969, 2016
62016
Linear separation of total dominating sets in graphs
N Chiarelli, M Milanič
International Workshop on Graph-Theoretic Concepts in Computer Science, 165-176, 2013
52013
Strong cliques in diamond-free graphs
N Chiarelli, B Martínez-Barona, M Milanič, J Monnot, P Muršič
Theoretical Computer Science 858, 49-63, 2021
42021
On a class of graphs between threshold and total domishold graphs
N Chiarelli, M Milanič
Discrete Applied Mathematics 195, 43-58, 2015
22015
Allocating indivisible items with minimum dissatisfaction on preference graphs
N Chiarelli, C Dallard, A Darmann, S Lendl, M Milanič, P Muršič, N Pivač, ...
International Conference on Algorithmic Decision Theory, 243-257, 2021
12021
On matching extendability of lexicographic products
N Chiarelli, C Dibek, T Ekim, D Gözüpek, Š Miklavič
RAIRO-Operations Research 51 (3), 857-873, 2017
12017
Allocation of Indivisible Items with Individual Preference Graphs
N Chiarelli, C Dallard, A Darmann, S Lendl, M Milanič, P Muršič, ...
arXiv preprint arXiv:2202.04465, 2022
2022
Edge Elimination and Weighted Graph Classes
J Beisegel, N Chiarelli, E Köhler, M Krnc, M Milanič, N Pivač, R Scheffler, ...
International Workshop on Graph-Theoretic Concepts in Computer Science, 134-147, 2020
2020
Fair allocation of indivisible goods under conflict constraints
N Chiarelli, M Krnc, M Milanič, U Pferschy, N Pivač, J Schauer
arXiv preprint arXiv:2003.11313, 2020
2020
Edge elimination schemes of weighted graph classes, Workshop on Graph Modification algorithms, experiments and new problems, 23rd-24th January 2020, Bergen, Norway
M Milanič, J Beisegel, N Chiarelli, E Köhler, M Krnc, N Pivač, R Scheffler, ...
Univerza na Primorskem, Inštitut Andrej Marušič, 2020
2020
A threshold approach to connected domination
N Chiarelli, M Milanic
arXiv preprint arXiv:1610.06539, 2016
2016
Novi koncepti in rezultati v teoriji dominacije in prirejanj v grafih: doktorska disertacija
N Chiarelli
Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in …, 2016
2016
Vizingov izrek in snarki
N Chiarelli
Univerza na Primorskem, Pedagoška fakulteta, 2011
2011
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–19