Related papers: The Realizable Extension Problem and the Weighted …
The free space diagram is a popular tool to compute the well-known Fr\'echet distance. As the Fr\'echet distance is used in many different fields, many variants have been established to cover the specific needs of these applications. Often,…
We study spreading processes in temporal graphs, i. e., graphs whose connections change over time. These processes naturally model real-world phenomena such as infectious diseases or information flows. More precisely, we investigate how…
We consider combinatorial problems that can be solved in polynomial time for graphs of bounded treewidth but where the order of the polynomial that bounds the running time is expected to depend on the treewidth bound. First we review some…
In the Vertex Cover Reconfiguration (VCR) problem, given a graph $G$, positive integers $k$ and $\ell$ and two vertex covers $S$ and $T$ of $G$ of size at most $k$, we determine whether $S$ can be transformed into $T$ by a sequence of at…
Links in $S^3$ as well as Legendrian links in the standard tight contact structure on $S^3$ can be encoded by grid diagrams. These consist of a collection of points on a toroidal grid, connected by vertical and horizontal edges. Blackwell,…
introduce {\sc Planar Disjoint Paths Completion}, a completion counterpart of the Disjoint Paths problem, and study its parameterized complexity. The problem can be stated as follows: given a, not necessarily connected, plane graph $G,$ $k$…
This paper formulates a necessary and sufficient condition for a generic graph matching problem to be equivalent to the maximum vertex and edge weight clique problem in a derived association graph. The consequences of this results are…
We study methods to manipulate weights in stress-graph embeddings to improve convex straight-line planar drawings of 3-connected planar graphs. Stress-graph embeddings are weighted versions of Tutte embeddings, where solving a linear system…
The expansion $G^+$ of a graph $G$ is the $3$-uniform hypergraph obtained from $G$ by enlarging each edge of $G$ with a new vertex disjoint from $V(G)$ such that distinct edges are enlarged by distinct vertices. Let $ex_3(n,F)$ denote the…
We describe constructions of infinite graphs which are not representable as integral graphs in the plane, addressing a question of Erd\H{o}s. We also mention some related problems.
A graph $G=(V,E)$ is total weight $(k,k')$-choosable if the following holds: For any list assignment $L$ which assigns to each vertex $v$ a set $L(v)$ of $k$ real numbers, and assigns to each edge $e$ a set $L(e)$ of $k'$ real numbers,…
In the classical partial vertex cover problem, we are given a graph $G$ and two positive integers $R$ and $L$. The goal is to check whether there is a subset $V'$ of $V$ of size at most $R$, such that $V'$ covers at least $L$ edges of $G$.…
A set-pair Lov\'asz extension is established to construct equivalent continuous optimization problems for graph $k$-cut problems.
We show that planar embeddable 3-connected CAD graphs are generically non-soluble. A CAD graph represents a configuration of points on the Euclidean plane with just enough distance dimensions between them to ensure rigidity. Formally, a CAD…
In this article, we discuss when one can extend an r-regular graph to an r + 1 regular by adding edges. Different conditions on the num- ber of vertices n and regularity r are developed. We derive an upper bound of r, depending on n, for…
Let $K_{s,t}^{(r)}$ denote the $r$-uniform hypergraph obtained from the graph $K_{s,t}$ by inserting $r-2$ new vertices inside each edge of $K_{s,t}$. We prove essentially tight bounds on the size of a largest $K_{s,t}^{(r)}$-subgraph of…
Graph is a useful data structure to model various real life aspects like email communications, co-authorship among researchers, interactions among chemical compounds, and so on. Supporting such real life interactions produce a knowledge…
Let R be an equivalence relation on graphs. By the strengthening of R we mean the relation R' such that graphs G and H are in the relation R' if for every graph F, the union of the graphs G and F is in the relation R with the union of the…
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…
Various kinds of spread of influence occur in real world social and virtual networks. These phenomena are formulated by activation processes and irreversible dynamic monopolies in combinatorial graphs representing the topology of the…