11. Data from the Researcher Mental Health Observatory STAIRCASE surveyJana Lasser, Stefan T. Mol, Alja Čontala, Ana Slavec, Andreja Zulim de Swarte, Anna Khachatryan, Anna Maria Eleuteri, Anupoma Haque, Baiba Jansone, Blerina Vrenozi, Mateja Erce Paoli, 2025, drugi znanstveni članki Opis: The data presented here derives from the STAIRCASE survey on researcher mental health. The survey reached 4,296 researchers predominantly from European countries who completed an online questionnaire about mental health outcomes such as depression, anxiety, stress, burnout, and well-being, as well as working conditions and leadership behaviour. Data and materials of the study are available at https://doi.org/10.21249/DZHW:remo:1.0.0 as a fully anonymised downloadable Campus Use File and a pseudonymised Scientific Use File, accessible in a secure remote analysis environment. Data can be reused for secondary analyses, educational purposes, or combined with similar data sets.
Ključne besede: mental health, occupational health, researchers, working conditions
Objavljeno v RUP: 19.12.2025; Ogledov: 153; Prenosov: 9
 Celotno besedilo (1,77 MB)
Gradivo ima več datotek! Več... |
12. |
13. First EST-SSRs of Helichrysum italicum (Roth) G. Don (Asteraceae) revealed insights into the genetic diversity and population structure in CorsicaPetra Gabrovšek, Matjaž Hladnik, Dunja Bandelj, Zala Jenko Pražnikar, Saša Kenig, Félix Tomi, Marc Gibernau, Slavko Brana, Alenka Baruca Arbeiter, 2025, izvirni znanstveni članek Opis: Helichrysum italicum (Roth) G. Don (Asteraceae) is a valuable medicinal and aromatic plant native to a variety of habitats across the Mediterranean region. However, genetic studies of this morphologically diverse species have been limited by the scarcity of species-specific DNA markers. To address this limitation, we generated the first de novo transcriptome assembly comprising 24,806 transcripts from young shoots containing leaves and flowers, developed EST-SSR markers, and evaluated their utility in population genetic analysis. Seventy-eight primer pairs were designed, of which 23 showed successful amplification, polymorphism, and transferability to Helichrysum litoreum Guss. and Helichrysum arenarium (L.) Moench. A subset of 12 EST-SSRs was used to genotype 270 individuals from 12 natural populations of H. italicum in Corsica (France), along with one outgroup population from Croatia. The polymorphic information content ranged from 0.250 to 0.796, and Shannon’s information index ranged from 0.588 to 1.843, indicating the markers’ suitability for popu- lation genetic studies. Analysis of molecular variance revealed that 15% of the total genetic variation was attributable to differences among populations. Discriminant analysis of principal components and Bayesian clustering in STRUCTURE identified distinct popu- lation clusters corresponding to geographic locations. Notably, the southernmost coastal populations were clearly differentiated from the others.
Ključne besede: Helichrysum italicum, immortelle, de novo transcriptome, genic microsatellite markers, EST-SSRs, population study, Corsica, Mediterranean Basin
Objavljeno v RUP: 17.12.2025; Ogledov: 172; Prenosov: 6
Celotno besedilo (4,87 MB)
Gradivo ima več datotek! Več... |
14. Computing tree decompositions with small independence numberClément Jean Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanič, 2026, izvirni znanstveni članek Opis: The independence number of a tree decomposition is the maximum of the independence numbers of the subgraphs induced by its bags. The tree-independence number of a graph is the minimum independence number of a tree decomposition of it. Several NP-hard graph problems, like maximum-weight independent set, can be solved in time n^O(k) if the input n-vertex graph is given together with a tree decomposition of independence number k. Yolov, in SODA 2018, gave an algorithm that, given an n-vertex graph G and an integer k, in time n^O(k^3) either constructs a tree decomposition of G whose independence number is O(k^3) or correctly reports that the tree-independence number of G is larger than k. In this article, we first give an algorithm for computing the tree-independence number with a better approximation ratio and running time and then prove that our algorithm is, in some sense, the best one can hope for. Our second result is that the exact computation of the tree-independence number is para-NP-hard: We show that for every constant k ≥ 4 it is NP-complete to decide whether a given graph has the tree-independence number at most k.
Ključne besede: tree-independence number, approximation, parameterized algorithm
Objavljeno v RUP: 16.12.2025; Ogledov: 224; Prenosov: 3
Celotno besedilo (1,45 MB)
Gradivo ima več datotek! Več... |
15. Conformality of minimal transversals of maximal cliquesEndre Boros, Vladimir Gurvich, Martin Milanič, Dmitry Tikhanovsky, Yushi Uno, 2026, izvirni znanstveni članek Opis: Given a hypergraph ℋ, the dual hypergraph of ℋis the hypergraph of all minimal transversals of ℋ. A hypergraph is conformal if it is the family of maximal cliques of a graph. In a recent work, Boros, Gurvich, Milanič, and Uno (Journal of Graph Theory, 2025) studied conformality of dual hypergraphs and proved several results related to this property, leading in particular to a polynomial-time algorithm for recognizing graphs in which, for any fixed k, all minimal transversals of maximal cliques have size at most k. In this follow-up work, we provide a novel aspect to the study of graph clique transversals, by considering the dual conformality property from the perspective of graphs. More precisely, we study graphs for which the family of minimal transversals of maximal cliques is conformal. Such graphs are called clique dually conformal (CDC for short). It turns out that the class of CDC graphs is a rich generalization of the class of P4-free graphs. As our main results, we completely completely characterize CDC graphs within the families of triangle-free graphs and split graphs. Both characterizations lead to polynomial-time recognition algorithms. Generalizing the fact that every P4-free graph is CDC, we also show that the class of CDC graphs is closed under substitution, in the strong sense that substituting a graph H for a vertex of a graph G results in a CDC graph if and only if both G and H are CDC.
Ključne besede: maximal clique, minimal transversal, conformal hypergraph, triangle-free graph, split graph
Objavljeno v RUP: 16.12.2025; Ogledov: 197; Prenosov: 2
Celotno besedilo (1,65 MB)
Gradivo ima več datotek! Več... |
16. Induced minor models : Structural properties and algorithmic consequencesNicolas Bousquet, Clément Jean Dallard, Maël Dumas, Claire Hilaire, Martin Milanič, Anthony Perez, Nicolas Trotignon, 2026, izvirni znanstveni članek Opis: A graph H is an induced minor of G if there exists an induced minor model of H in G, that is, a collection of pairwise disjoint subsets of vertices of G labeled by the vertices of H, each inducing a connected subgraph in G, such that two vertices of H are adjacent if and only if there is an edge in G between the corresponding subsets. In this paper, we investigate structural properties of induced minor models, including bounds on treewidth and chromatic number of the subgraphs induced by minimal induced minor models. As algorithmic applications of our structural results, we make use of recent developments regarding tree-independence number to show that if H is the 4-wheel, the 5-vertex complete graph minus an edge, or a complete bipartite graph K2,q , then there is a polynomial-time algorithm to find in a given graph G an induced minor model of H in G, if there is one. We also develop an alternative polynomial-time algorithm for recognizing graphs that do not contain K2,3 as an induced minor, which revolves around the idea of detecting the induced subgraphs whose presence is forced when the input graph contains K2,3 as an induced minor. It turns out that all these induced subgraphs are Truemper configurations.
Ključne besede: induced minor, treewidth, chromatic number, tree-independence number, Truemper configuration
Objavljeno v RUP: 16.12.2025; Ogledov: 179; Prenosov: 3
Celotno besedilo (1,44 MB)
Gradivo ima več datotek! Več... |
17. On {k}-Roman graphsKenny Bešter Štorgel, Nina Chiarelli, Lara Fernández, J. Pascal Gollin, Claire Hilaire, Valeria Alejandra Leoni, Martin Milanič, 2025, objavljeni znanstveni prispevek na konferenci Opis: For a positive integer k, a {k}-Roman dominating function of a graph G = (V, E) is a function f : V → {0, 1, . . . , k} satisfying f (N(v)) ≥ k for each vertex v ∈ V with f (v) = 0. Every graph G satisfies γ{Rk}(G) ≤ kγ(G), where γ{Rk}(G) denotes the minimum weight of a {k}-Roman dominating function of G and γ(G) is the domination number of G. In this work we study graphs for which the equality is reached, called {k}-Roman graphs. This extends the concept of {k}-Roman trees studied by Wang et al. in 2021 to gen- eral graphs. We prove that for every k ≥ 3, the problem of recognizing {k}-Roman graphs is NP-hard, even when restricted to split graphs. We provide partial answers to the question of which split graphs are {2}-Roman: we characterize {2}-Roman split graphs that can be decomposed with respect to the split join operation into two smaller split graphs and classify the {k}-Roman property within two specific families of split graphs that are prime with respect to the split join operation: suns and their complements.
Ključne besede: graph domination, {k}-Roman domination, {k}-Roman graph, split graph, split join, NP-completeness
Objavljeno v RUP: 16.12.2025; Ogledov: 201; Prenosov: 2
Celotno besedilo (395,09 KB)
Gradivo ima več datotek! Več... |
18. Plants in danger : floral and other plant traits as drivers of vulnerability in Mediterranean countriesAmparo Lázaro, Anastasia Stefanaki, Martha Charitonidou, Joana Cursach, Maria Panitsa, Ioannis Bazos, Rosa Ranalli, Mauro Fois, Marta Galloni, Gianluigi Bacchetta, Živa Fišer, 2026, izvirni znanstveni članek Opis: Plants with complex floral morphologies are adapted to be pollinated by restricted pollinator assemblages and may suffer pollinator limitation. Understanding how floral traits and other variables relate to plant vulnerability can provide a powerful tool for predicting the conservation status and prioritizing the assessment of plants with scarce field data. Using circa 3000 records of rare and threatened (sensu IUCN) entomophilous plant taxa from seven Mediterranean countries, we evaluated how six floral traits and other eight intrinsic and extrinsic variables were related to plant vulnerability (less vs. more threatened plants). Besides, we analyzed 29 experts' opinions regarding the floral traits most related to floral complexity. Floral shape, reproductive unit, and flowering duration were good vulnerability indicators. Taxa with lip- and flag-shaped flowers were the most threatened, which agrees with the opinion of experts who considered lip- and flag-shaped flowers to have more complex morphologies. Also, plants with cylindrical inflorescences or solitary flowers were more threatened than those with flat-spherical inflorescences; and longer flowering durations reduced the probability of being threatened. Regarding extrinsic variables, coastal and freshwater habitats, i.e. habitats heavily impacted by human activities, had the highest percentage of highly threatened taxa. Yet, plant vulnerability decreased with maximum elevation and total distribution range. These results may serve as a basis for managers and practitioners when field data are scarce or unavailable, so that, depending on their traits, species could be provisionally listed in Red Lists as deserving priority for assessment to ascertain conservation status and actions.
Ključne besede: floral complexity, floral shape, flowering duration, functional reproductive unit, plant conservation, red data books, threatened Mediterranean vascular flora
Objavljeno v RUP: 02.12.2025; Ogledov: 220; Prenosov: 3
Celotno besedilo (5,45 MB)
Gradivo ima več datotek! Več... |
19. Nut graphs with a given automorphism groupNino Bašić, Patrick W. Fowler, 2025, izvirni znanstveni članek Opis: A nut graph is a simple graph of order 2 or more for which the adjacency matrix has a single zero eigenvalue such that all nonzero kernel eigenvectors have no zero entry (i.e. are full). It is shown by construction that every finite group can be represented as the group of automorphisms of infinitely many nut graphs. It is further shown that such nut graphs exist even within the class of regular graphs; the cases where the degree is 8, 12, 16, 20 or 24 are realised explicitly.
Ključne besede: nut graph, graph automorphism, automorphism group, nullity, graph spectra, f-universal
Objavljeno v RUP: 25.11.2025; Ogledov: 422; Prenosov: 4
Celotno besedilo (526,71 KB)
Gradivo ima več datotek! Več... |
20. BIM-based framework for estimating service life duration of wood construction elements under environmental exposureRichard Acquah, Jonas Niklewski, Anna Malgorzata Sandak, Jakub Michal Sandak, 2026, izvirni znanstveni članek Opis: As the construction industry adopts more data-driven and sustainable practices, Building Information Modelling (BIM) is increasingly used for energy analysis, lifecycle management, and maintenance planning. However, its integration with service life performance analysis especially for wood, a material susceptible to environmental degradation remains limited. This study presents a BIM-based framework that incorporates wood-specific parameters such as environmental exposure, material properties, and design detailing to estimate the service life of wood construction elements. The framework is structured using ISO 15,686–4 principles and implemented through custom Industry Foundation Classes (IFC) property sets. A Revit plugin developed in C# integrates the model into the BIM environment. A case study of a wooden playhouse is used as a proof-of-concept to demonstrates the framework’s ability to evaluate the impact of design, material, and environmental factors on service life. The results confirm that the framework supports service life prediction and enhances decision-making for wood-based construction. Twenty-one-month observations align with predicted results. However, long-term (2–9 year) predictions remain unvalidated, requiring extended monitoring. By integration of the service life prediction for fungal decay into BIM it offers a practical and scalable tool to support service life–informed design and planning for wood structures.
Ključne besede: service life prediction, wood material durability, environmental exposure, wood 28 construction, sustainable construction, building information modelling (BIM)
Objavljeno v RUP: 24.11.2025; Ogledov: 306; Prenosov: 9
Celotno besedilo (9,65 MB)
Gradivo ima več datotek! Več... |
