Related papers: Weak Dominance Drawings and Linear Extension Diame…
In this paper, firstly, we introduce a higher-dimensional analogue of hypergraphs, namely $\omega$-hypergraphs. This notion is thoroughly flexible because unlike ordinary $\omega$-graphs, an n-dimensional edge called an n-cell has many…
We study a general class of quasilinear elliptic equations with nonstandard growth to prove the existence of a very weak solution to such a problem. A key ingredient in the proof is a priori global weighted gradient estimate of a very weak…
Effect of weak disorder on tunneling through a potential barrier is studied analytically. A diagrammatic approach based on the specific behavior of subbarrier wave functions is developed. The problem is shown to be equivalent to that of…
This article is devoted to questions concerning the existence of solutions for partial differential equation problems modeling granular flows. The models studied take into account the complex threshold rheology of these flows, as well as…
The concept of generalized domination unifies well-known variants of domination-like and independence problems, such as Dominating Set, Independent Set, Perfect Code, etc. A generalized domination (also called $[\sigma,\rho]$-Dominating…
In this paper, we study "robust" dominating sets of random graphs that retain the domination property even if a small \emph{deterministic} set of edges are removed. We motivate our study by illustrating with examples from wireless networks…
Hadamard diagonalizable graphs are undirected graphs for which the corresponding Laplacian is diagonalizable by a Hadamard matrix. Such graphs have been studied in the context of quantum state transfer. Recently, the concept of a weak…
Motion planning is a fundamental problem of robotics with applications in many areas of computer science and beyond. Its restriction to graphs has been investigated in the literature for it allows to concentrate on the combinatorial problem…
A weak odd dominated (WOD) set in a graph is a subset B of vertices for which there exists a distinct set of vertices C such that every vertex in B has an odd number of neighbors in C. We point out the connections of weak odd domination…
The extension complexity of a polytope measures its amenability to succinct representations via lifts. There are several versions of extension complexity, including linear, real semidefinite, and complex semidefinite. We focus on the last…
We revisit classic balancing problems for linear extensions of a partially ordered set $P$, proving results that go far beyond many of the best earlier results on this topic. For example, with $p(x\prec y)$ the probability that $x$ precedes…
We survey algorithms and bounds for constructing planar drawings of graphs in small area.
We investigate straight-line drawings of topological graphs that consist of a planar graph plus one edge, also called almost-planar graphs. We present a characterization of such graphs that admit a straight-line drawing. The…
As explained in detail in the prologue to this manuscript, boundedness of weak solutions for general classes of elliptic equations in divergence form is a classic tool for achieving higher regularity. We propose here some global boundedness…
We consider a second order gradient flow of the p-elastic energy for a planar theta-network of three curves with fixed lengths. We construct a weak solution of the flow by means of an implicit variational scheme. We show long-time existence…
We briefly summarize the equivalence of off-diagonal generalized vector dominance and the colour-dipole approach to deep-inelastic scattering (DIS) in the diffraction region of values of $x \simeq Q^2/W^2 << 1$.
We prove a distributional limit theorem conjectured in [Journal of Statistical Physics 174, No. 6, 1372-1403 (2019)] for partition functions defining models of directed polymers on diamond hierarchical graphs with disorder variables placed…
Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of Dyck reachability problems in directed and undirected graphs, where updates may add or delete…
Interval graphs are intersection graphs of closed intervals. A generalization of recognition called partial representation extension was introduced recently. The input gives an interval graph with a partial representation specifying some…
We introduce a class of plane graphs called weak near-triangulations, and prove that this class is closed under certain graph operations. Then we use the properties of weak near-triangulations to prove that every plane triangulation on…