DIKUL - logo

Search results

Basic search    Expert search   

Currently you are NOT authorised to access e-resources UL. For full access, REGISTER.

1 2 3 4 5
hits: 44
1.
  • Minimum connected transvers... Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity
    Chiarelli, Nina; Hartinger, Tatiana R.; Johnson, Matthew ... Theoretical computer science, 01/2018, Volume: 705
    Journal Article
    Peer reviewed
    Open access

    We perform a systematic study in the computational complexity of the connected variant of three related transversal problems: Vertex Cover, Feedback Vertex Set, and Odd Cycle Transversal. Just like ...
Full text
Available for: UL

PDF
2.
Full text
Available for: UL

PDF
3.
  • Strong cliques in diamond-f... Strong cliques in diamond-free graphs
    Chiarelli, Nina; Martínez-Barona, Berenice; Milanič, Martin ... Theoretical computer science, 02/2021, Volume: 858
    Journal Article
    Peer reviewed

    A strong clique in a graph is a clique intersecting all inclusion-maximal stable sets. Strong cliques play an important role in the study of perfect graphs. We study strong cliques in the class of ...
Full text
Available for: UL

PDF
4.
  • Fair Allocation of Indivisi... Fair Allocation of Indivisible Items with Conflict Graphs
    Chiarelli, Nina; Krnc, Matjaž; Milanič, Martin ... Algorithmica, 05/2023, Volume: 85, Issue: 5
    Journal Article
    Peer reviewed
    Open access

    We consider the fair allocation of indivisible items to several agents and add a graph theoretical perspective to this classical problem. Namely, we introduce an incompatibility relation between ...
Full text
Available for: UL
5.
  • Allocation of indivisible i... Allocation of indivisible items with individual preference graphs
    Chiarelli, Nina; Dallard, Clément; Darmann, Andreas ... Discrete Applied Mathematics, 07/2023, Volume: 334
    Journal Article
    Peer reviewed
    Open access

    This paper studies the allocation of indivisible items to agents, when each agent’s preferences are expressed by means of a directed acyclic graph. The vertices of each preference graph represent the ...
Full text
Available for: UL
6.
  • On a class of graphs betwee... On a class of graphs between threshold and total domishold graphs
    Chiarelli, Nina; Milanič, Martin Discrete Applied Mathematics, 11/2015, Volume: 195
    Journal Article
    Peer reviewed
    Open access

    A total dominating set in a graph is a subset of vertices such that every vertex in the graph has a neighbor in it. A graph is said to be total domishold if it admits a total domishold structure, ...
Full text
Available for: UL

PDF
7.
  • Total domishold graphs: A g... Total domishold graphs: A generalization of threshold graphs, with connections to threshold hypergraphs
    Chiarelli, Nina; Milanič, Martin Discrete Applied Mathematics, 12/2014, Volume: 179
    Journal Article
    Peer reviewed
    Open access

    A total dominating set in a graph is a set of vertices such that every vertex of the graph has a neighbor in the set. We introduce and study graphs that admit non-negative real weights associated to ...
Full text
Available for: UL

PDF
8.
  • New algorithms for weighted... New algorithms for weighted k-domination and total k-domination problems in proper interval graphs
    Chiarelli, Nina; Hartinger, Tatiana Romina; Leoni, Valeria Alejandra ... Theoretical computer science, 11/2019, Volume: 795
    Journal Article
    Peer reviewed
    Open access

    Given a positive integer k, a k-dominating set in a graph G is a set of vertices such that every vertex not in the set has at least k neighbors in the set. A total k-dominating set is a set of ...
Full text
Available for: UL

PDF
9.
  • Equistarable bipartite graphs Equistarable bipartite graphs
    Boros, Endre; Chiarelli, Nina; Milanič, Martin Discrete mathematics, 07/2016, Volume: 339, Issue: 7
    Journal Article
    Peer reviewed
    Open access

    Recently, Milanič and Trotignon introduced the class of equistarable graphs as graphs without isolated vertices admitting positive weights on the edges such that a subset of edges is of total weight ...
Full text
Available for: UL

PDF
10.
  • Fair allocation algorithms ... Fair allocation algorithms for indivisible items under structured conflict constraints
    Chiarelli, Nina; Krnc, Matjaž; Milanič, Martin ... Computational & Applied Mathematics, 10/2023, Volume: 42, Issue: 7
    Journal Article
    Peer reviewed
    Open access

    We consider the fair allocation of indivisible items to several agents with additional conflict constraints. These are represented by a conflict graph where each item corresponds to a vertex of the ...
Full text
Available for: UL
1 2 3 4 5
hits: 44

Load filters