Related papers: Placing Green Bridges Optimally, with Habitats Ind…
We study graph classes modeled by families of non-crossing (NC) connected sets. Two classic graph classes in this context are disk graphs and proper interval graphs. We focus on the cases when the sets are paths and the host is a tree…
Phylogenetic networks are used to represent the evolutionary history of species. Recently, the new class of orchard networks was introduced, which were later shown to be interpretable as trees with additional horizontal arcs. This makes the…
A metapopulations network is a multi-patch habitat system, where populations live and interact in the habitat patches, and individuals disperse from one patch to the other via dispersal connections. The loss of dispersal connections among…
Aligning protein interaction networks (PPI) of two or more organisms consists of finding a mapping of the nodes (proteins) of the networks that captures important structural and functional associations (similarity). It is a well studied but…
Several variants of the Constraint Satisfaction Problem have been proposed and investigated in the literature for modelling those scenarios where solutions are associated with some given costs. Within these frameworks computing an optimal…
A drawback of the classic approach for complexity analysis of distributed graph problems is that it mostly informs about the complexity of notorious classes of ``worst case'' graphs. Algorithms that are used to prove a tight (existential)…
The decline in ecological connections signifies the potential extinction of species, which can be attributed to disruptions and alterations. The decrease in interconnections among species reflects their susceptibility to changes. For…
We study a variation of the graph colouring problem on random graphs of finite average connectivity. Given the number of colours, we aim to maximise the number of different colours at neighbouring vertices (i.e. one edge distance) of any…
The identification of nodes occupying important positions in a network structure is crucial for the understanding of the associated real-world system. Usually, betweenness centrality is used to evaluate a node capacity to connect different…
Distributed gathering algorithms aim to achieve complete visibility graphs via a "never lose a neighbour" policy. We suggest a method to maintain connected graph topologies, while reducing the number of effective edges in the graph to order…
The problems studied in this paper originate from Graph Motif, a problem introduced in 2006 in the context of biological networks. Informally speaking, it consists in deciding if a multiset of colors occurs in a connected subgraph of a…
Undocumented species represent one of the largest hurdles for conservation efforts due to the uncertainty they introduce into conservation planning. Until the distribution of earth's biodiversity is better understood, substantial conjecture…
Optimization problems consist of either maximizing or minimizing an objective function. Instead of looking for a maximum solution (resp. minimum solution), one can find a minimum maximal solution (resp. maximum minimal solution). Such…
We introduce the \emph{pipeline intervention} problem, defined by a layered directed acyclic graph and a set of stochastic matrices governing transitions between successive layers. The graph is a stylized model for how people from different…
The comprehensive characterization of the structure of complex networks is essential to understand the dynamical processes which guide their evolution. The discovery of the scale-free distribution and the small world property of real…
Many complex systems involve interactions between more than two agents. Hypergraphs capture these higher-order interactions through hyperedges that may link more than two nodes. We consider the problem of embedding a hypergraph into…
Accurate biodiversity monitoring is essential for effective environmental policy, yet current practices often rely on arbitrarily defined ecosystems, communities, and ad-hoc indicator species, limiting cost-efficiency and reproducibility.…
The paper considers the NP-hard graph vertex coloring problem, which differs from traditional problems in which it is required to color vertices with a given (or minimal) number of colors so that adjacent vertices have different colors. In…
Chernyshev, Rauch and Rautenbach [Discrete Math., 2025] introduce forest cuts, i.e., vertex separators that induce a forest. They conjecture that, similar to a result by Chen and Yu [Discrete Math., 2002], every $n$-vertex graph with less…
We introduce a hybrid metaphor for the visualization of the reconciliations of co-phylogenetic trees, that are mappings among the nodes of two trees. The typical application is the visualization of the co-evolution of hosts and parasites in…