Matjaž Krnc

From MaRDI portal
Revision as of 11:10, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:608286

Available identifiers

zbMath Open krnc.matjazWikidataQ114318559 ScholiaQ114318559MaRDI QIDQ608286

List of research outcomes





PublicationDate of PublicationType
Characterization of generalised Petersen graphs that are Kronecker covers2024-10-18Paper
Graphs with at most two moplexes2024-08-30Paper
Sprague-Grundy values and complexity for LCTR2024-02-14Paper
Toward characterizing locally common graphs2023-10-17Paper
Shifting paths to avoidable ones2023-10-05Paper
Fair allocation algorithms for indivisible items under structured conflict constraints2023-10-02Paper
Some results on LCTR, an impartial game on partitions2023-08-17Paper
Fair allocation of indivisible items with conflict graphs2023-04-28Paper
Distinguishing graphs via cycles2023-03-30Paper
Edge elimination and weighted graph classes2022-12-21Paper
Fair Packing of Independent Sets2022-10-13Paper
Avoidability beyond paths2022-08-26Paper
Multiset-trie data structure - datasets2022-08-17Dataset
Recognizing graph search trees2022-04-27Paper
Graphs where Search Methods are Indistinguishable2021-08-31Paper
The Recognition Problem of Graph Search Trees2021-06-28Paper
Graphs with at most two moplexes2021-06-18Paper
Positive Aging Admits Fast Asynchronous Plurality Consensus2021-03-15Paper
Eccentricity of networks with structural constraints2020-08-26Paper
Fast recognition of some parametric graph families2020-08-20Paper
Recognizing generalized Petersen graphs in linear time2020-06-29Paper
Fair allocation of indivisible items with conflict graphs2020-03-25Paper
https://portal.mardi4nfdi.de/entity/Q52078512020-01-13Paper
https://portal.mardi4nfdi.de/entity/Q52268332019-08-01Paper
Characterization of generalized Petersen graphs that are Kronecker covers2018-02-20Paper
https://portal.mardi4nfdi.de/entity/Q52799902017-07-19Paper
Closeness Centralization Measure for Two-mode Data of Prescribed Sizes2016-08-14Paper
Centralization of transmission in networks2015-08-05Paper
Group centralization of network indices2015-05-22Paper
https://portal.mardi4nfdi.de/entity/Q28567112013-10-30Paper
Extending Fractional Precolorings2012-09-12Paper
Cyclic colorings of plane graphs with independent faces2012-02-11Paper
Improved induced matchings in sparse graphs2010-11-25Paper
Cyclic 7-edge-cuts in fullerene graphs2010-03-02Paper
Improved Induced Matchings in Sparse Graphs2010-01-14Paper
Growing Trees and Amoebas' ReplicationsN/APaper
Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced starN/APaper
Ramsey multiplicity of apices of treesN/APaper

Research outcomes over time

This page was built for person: Matjaž Krnc