Related papers: Extending Partial Representations of Unit Circular…
The graph partitioning problem (GPP) is a representative combinatorial optimization problem which is NP-hard. Currently, various approaches to solve GPP have been introduced. Among these, the GPP solution using evolutionary computation (EC)…
Many challenges from natural world can be formulated as a graph matching problem. Previous deep learning-based methods mainly consider a full two-graph matching setting. In this work, we study the more general partial matching problem with…
We study several extensions of the notion of perfect graphs to $k$-uniform hypergraphs.
We consider the problem of classifying those graphs that arise as an undirected square of an oriented graph by generalising the notion of quasi-transitive directed graphs to mixed graphs. We fully classify those graphs of maximum degree…
In a confluence of combinatorics and geometry, simultaneous representations provide a way to realize combinatorial objects that share common structure. A standard case in the study of simultaneous representations is the sunflower case where…
It is well-known that the Vertex Cover problem is in P on bipartite graphs, however; the computational complexity of the Partial Vertex Cover problem on bipartite graphs is open. In this paper, we first show that the Partial Vertex Cover…
A set-pair Lov\'asz extension is established to construct equivalent continuous optimization problems for graph $k$-cut problems.
Simple drawings of graphs are those in which each pair of edges share at most one point, either a common endpoint or a proper crossing. In this paper we study the problem of extending a simple drawing $D(G)$ of a graph $G$ by inserting a…
For graph classes $P_1,...,P_k$, Generalized Graph Coloring is the problem of deciding whether the vertex set of a given graph $G$ can be partitioned into subsets $V_1,...,V_k$ so that $V_j$ induces a graph in the class $P_j$…
Planar graphs can be represented as intersection graphs of different types of geometric objects in the plane, e.g., circles (Koebe, 1936), line segments (Chalopin \& Gon{\c{c}}alves, 2009), \textsc{L}-shapes (Gon{\c{c}}alves et al, 2018).…
The class of 2-interval graphs has been introduced for modelling scheduling and allocation problems, and more recently for specific bioinformatic problems. Some of those applications imply restrictions on the 2-interval graphs, and justify…
In this paper we study the computational complexity of the Upward Planarity Extension problem, which takes in input an upward planar drawing $\Gamma_H$ of a subgraph $H$ of a directed graph $G$ and asks whether $\Gamma_H$ can be extended to…
In the area of beyond-planar graphs, i.e. graphs that can be drawn with some local restrictions on the edge crossings, the recognition problem is prominent next to the density question for the different graph classes. For 1-planar graphs,…
In [HJLLZ24], we proposed a new conjecture on the structure of the unitary dual of connected reductive groups over non-Archimedean local fields of characteristic zero based on their Arthur representations and verified it for all the known…
An $\ell$-page stack layout (also known as an $\ell$-page book embedding) of a graph is a linear order of the vertex set together with a partition of the edge set into $\ell$ stacks (or pages), such that the endpoints of no two edges on the…
Time series clustering poses a significant challenge with diverse applications across domains. A prominent drawback of existing solutions lies in their limited interpretability, often confined to presenting users with centroids. In…
Graph neural networks have been widely used for learning representations of nodes for many downstream tasks on graph data. Existing models were designed for the nodes on a single graph, which would not be able to utilize information across…
Myasnikov et al. have introduced the knapsack problem for arbitrary finitely generated groups. In previous work, the authors proved that for each graph group, the knapsack problem can be solved in $\mathsf{NP}$. Here, we determine the exact…
We introduce the problem of Weak Dominance Drawing for general directed acyclic graphs and we show the connection with the linear extension diameter of a partial order P. We present complexity results and bounds.
Testing if a given graph $G$ contains the $k$-vertex path $P_k$ as a minor or as an induced minor is trivial for every fixed integer $k\geq 1$. However, the situation changes for the problem of checking if a graph can be modified into $P_k$…