Login
Lupa
First page / Search the repository

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


1 - 10 / 13
First pagePrevious page12Next pageLast page
1.
Classes of graphs with tree-independence number at most two : master's thesis
Mirza Redžić, 2022, master's thesis

Keywords: tree decomposition, treewidth, tree-independence number, induced minor, H-free graph, series parallel graph
Published in RUP: 20.09.2022; Views: 1524; Downloads: 18
URL Link to full text

2.
Treewidth versus clique number. I. graph classes with a forbidden structure
Clément Jean Dallard, Martin Milanič, Kenny Štorgel, 2021, original scientific article

Keywords: graph class, treewidth, clique number
Published in RUP: 09.11.2021; Views: 1722; Downloads: 32
URL Link to full text

3.
Allocating indivisible items with minimum dissatisfaction on preference graphs
Nina Chiarelli, Clément Jean Dallard, Andreas Darmann, Stefan Lendl, Martin Milanič, Peter Muršič, Nevena Pivač, Ulrich Pferschy, 2021, published scientific conference contribution

Keywords: fair division, partial order, preference graph
Published in RUP: 29.10.2021; Views: 2794; Downloads: 24
URL Link to full text

4.
Bonsma, Paul; Paulusma, Daniël: Using contracted solution graphs for solving reconfiguration problems. (English summary) Acta Inform. 56 (2019), no. 7-8, 619-648.
Clément Jean Dallard, 2021, review, book review, critique

Keywords: reconfiguration, dynamic programming, graph coloring
Published in RUP: 26.10.2021; Views: 2279; Downloads: 10
URL Link to full text

5.
Colourful components in k-caterpillars and planar graphs
Janka Chlebíková, Clément Jean Dallard, 2021, original scientific article

Keywords: colorful component, caterpillar, binary tree, planar subcubic graph
Published in RUP: 18.10.2021; Views: 1821; Downloads: 26
URL Link to full text

6.
A complexitystudy of distance variants of covering and domination problems in H-free graphs : master's thesis
Mirza Krbezlija, 2021, master's thesis

Keywords: distance-k dominating set, distance-k edge dominating set, distance-k vertex cover, distance k-edge cover, H-free graph, polynomial-time algorithm, NP-complete problem, dichotomy theorem
Published in RUP: 18.10.2021; Views: 3216; Downloads: 21
URL Link to full text

7.
On girth and the parameterized complexity of token sliding and token jumping
Valentin Bartier, Nicolas Bousquet, Clément Jean Dallard, Kyle Lomer, Amer E. Mouawad, 2021, original scientific article

Keywords: combinatorial reconfiguration, independent set, token jumping, token sliding, parameterized complexity
Published in RUP: 16.07.2021; Views: 1651; Downloads: 28
URL Link to full text

8.
Vertex cover at distance on H-free graphs
Clément Jean Dallard, Mirza Krbezlija, Martin Milanič, 2021, published scientific conference contribution

Keywords: distance-k vertex cover, H-free graph, np-completeness, polynomial-time algorithm, dichotomy
Published in RUP: 16.07.2021; Views: 2707; Downloads: 32
URL Link to full text

9.
On girth and the parameterized complexity of token sliding and token jumping
Valentin Bartier, Nicolas Bousquet, Clément Jean Dallard, Kyle Lomer, Amer E. Mouawad, 2020, published scientific conference contribution

Keywords: combinatorial reconfiguration, independent set, token jumping, token sliding, parameterized complexity
Published in RUP: 17.12.2020; Views: 1859; Downloads: 35
URL Link to full text

10.
Treewidth versus clique number in graph classes with a forbidden structure
Clément Jean Dallard, Martin Milanič, Kenny Štorgel, 2020, published scientific conference contribution

Keywords: graph class, treewidth, clique number
Published in RUP: 10.11.2020; Views: 2130; Downloads: 37
URL Link to full text
Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica