The second volume of “Advancing Uncertain Combinatorics through Graphization,
Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond” …

Graph theory is afundamental branch of mathematicsthat studiesnetworksconsisting of
nodes (vertices) and their connections (edges). Extensive research has been conducted on …

This paper deals with the complexity of some natural graph problems parameterized by
some measures that are restrictions of clique-width, such as modular-width and …

Graph theory, a branch of mathematics, explores relationships among objects using vertices
and edges [90]. A specialized area within this field, Uncertain Graph Theory, is designed to …

The parameterized complexity of problems is often studied with respect to the size of their
optimal solutions. However, for a maximization problem, the size of the optimal solution can …

A minimal separator in a graph is an inclusion-minimal set of vertices that separates some
fixed pair of nonadjacent vertices. A graph class is said to be tame if there exists a …

Abstract Independent Set Reconfiguration is one of the most well-studied problems in the
setting of combinatorial reconfiguration. It is known that the problem is PSPACE-complete …

This paper introduces a novel parameter, called iterated type partition, that can be computed
in polynomial time and nicely places between modular-width and neighborhood diversity …

We study the parameterized complexity of winner determination problems for three prevalent
k-committee selection rules, namely the minimax approval voting (MAV), the proportional …

Flow sparsification is a classic graph compression technique which, given a capacitated
graph $ G $ on $ k $ terminals, aims to construct another capacitated graph $ H $, called a …