E-LIB Suche - Ergebnisse für: Krnc, Matjaž

1

Graphs with at most two moplexes:

Dallard, Clément ; Ganian, Robert ; Hatzel, Meike..
Journal of Graph Theory. 107 (2024) 1 - p. 38-69 , 2024

Link: https://doi.org/10.1002/..

2

Dataset of Edmonds' bi-vectors and tri-vectors with realiza..:

Boros, Endre ; Gurvich, Vladimir ; Krnc, Matjaž..
Data in Brief. , 2024

Link: https://doi.org/10.1016/..

3

Sprague–Grundy values and complexity for LCTR:

Gottlieb, Eric ; Krnc, Matjaž ; Muršič, Peter
Discrete Applied Mathematics. 346 (2024) - p. 154-169 , 2024

Link: https://doi.org/10.1016/..

4

Multiset-Trie Data Structure:

Akulich, Mikita ; Savnik, Iztok ; Krnc, Matjaž.
Algorithms. 16 (2023) 3 - p. 170 , 2023

Link: https://doi.org/10.3390/..

5

Fair allocation algorithms for indivisible items under stru..:

Chiarelli, Nina ; Krnc, Matjaž ; Milanič, Martin..
Computational and Applied Mathematics. 42 (2023) 7 - p. , 2023

Link: https://doi.org/10.1007/..

6

Fair Allocation of Indivisible Items with Conflict Graphs:

Chiarelli, Nina ; Krnc, Matjaž ; Milanič, Martin...
Algorithmica. 85 (2022) 5 - p. 1459-1489 , 2022

Link: https://doi.org/10.1007/..

7

Toward characterizing locally common graphs:

Hancock, Robert ; Král', Daniel ; Krnc, Matjaž.
Random Structures & Algorithms. 62 (2022) 1 - p. 181-218 , 2022

Link: https://doi.org/10.1002/..

8

Shifting paths to avoidable ones:

Gurvich, Vladimir ; Krnc, Matjaž ; Milanič, Martin.
Journal of Graph Theory. 100 (2021) 1 - p. 69-83 , 2021

Link: https://doi.org/10.1002/..

9

The Recognition Problem of Graph Search Trees:

Beisegel, Jesse ; Denkert, Carolin ; Köhler, Ekkehard...
SIAM Journal on Discrete Mathematics. 35 (2021) 2 - p. 1418-1446 , 2021

Link: https://doi.org/10.1137/..

10

Graphs Where Search Methods Are Indistinguishable:

, In: Trends in Mathematics; Extended Abstracts EuroComb 2021,

Krnc, Matjaž ; Pivač, Nevena - p. 351-358 , 2021

Link: https://doi.org/10.1007/..

11

Distinguishing Graphs via Cycles:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,

Klobas, Nina ; Krnc, Matjaž - p. 387-398 , 2021

Link: https://doi.org/10.1007/..

12

Graphs with Two Moplexes:

Dallard, Clément ; Ganian, Robert ; Hatzel, Meike..
Procedia Computer Science. 195 (2021) - p. 248-256 , 2021

Link: https://doi.org/10.1016/..

13

Data structure set-trie for storing and querying sets: Theo..:

Savnik, Iztok ; Akulich, Mikita ; Krnc, Matjaž..
PLOS ONE. 16 (2021) 2 - p. e0245122 , 2021

Link: https://doi.org/10.1371/..

14

Edge Elimination and Weighted Graph Classes:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Beisegel, Jesse ; Chiarelli, Nina ; Köhler, Ekkehard... - p. 134-147 , 2020

Link: https://doi.org/10.1007/..

15

Fair Packing of Independent Sets:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,

Chiarelli, Nina ; Krnc, Matjaž ; Milanič, Martin... - p. 154-165 , 2020

Link: https://doi.org/10.1007/..