Related papers: Two Colored Diagrams for Central Configurations of…
We explore singular second-order boundary value problems with mixed boundary conditions on a general time scale. Using the lower and upper solutions method combined with the Brouwer fixed point theorem we demonstrate the existence of a…
This paper presents a novel methodology for evaluating the boundedness, stability, and instability of some vector nonlinear systems with multiple time-varying delays and variable coefficients. The proposed technique develops two scalar…
We study a graph coloring problem that is otherwise easy but becomes quite non-trivial in the one-pass streaming model. In contrast to previous graph coloring problems in streaming that try to find an assignment of colors to vertices, our…
Many discrete optimization problems are amenable to constrained shortest-path reformulations in an extended network space, a technique that has been key in convexification, bound strengthening, and search. In this paper, we propose a…
In the Selective Coloring problem, we are given an integer $k$, a graph $G$, and a partition of $V(G)$ into $p$ parts, and the goal is to decide whether or not we can pick exactly one vertex of each part and obtain a $k$-colorable induced…
This article is devoted to the properties of the planar triangulations. The conjugated planar triangulation will be introduced and on the base of the properties, which were achieved by the other authors there will be proved some theorems,…
This work focuses on the study of monodromic singularities in planar analytic families of vector fields whose Newton diagram consists of exactly two edges. We begin by analyzing the desingularization scheme of a minimal model of polynomial…
The Colour Refinement procedure and its generalisation to higher dimensions, the Weisfeiler-Leman algorithm, are central subroutines in approaches to the graph isomorphism problem. In an iterative fashion, Colour Refinement computes a…
Golovach, Paulusma and Song (Inf. Comput. 2014) asked to determine the parameterized complexity of the following problems parameterized by $k$: (1) Given a graph $G$, a clique modulator $D$ (a clique modulator is a set of vertices, whose…
Consider a graph whose vertices are colored in one of two colors, say black or white. A white vertex is called integrated if it has at least as many black neighbors as white neighbors, and similarly for a black vertex. The coloring as a…
A common problem to all applications of linear finite dynamical systems is analyzing the dynamics without enumerating every possible state transition. Of particular interest is the long term dynamical behaviour. In this paper, we study the…
We present a methodology that extends invariant manifold theory to a class of autonomous piecewise linear systems with nonsmoothness at the equilibrium, providing a framework for model order reduction in mechanical structures with compliant…
We describe all possible topological structures of typical one-parameter bifurcations of gradient flows on the 2-sphere with holes in the case that the number of singular point of flows is at most six. To describe structures, we separatrix…
A singularly perturbed linear system of second order ordinary differential equations of reaction-diffusion type with given boundary conditions is considered. The leading term of each equation is multiplied by a small positive parameter.…
We exhibit planar, rational curves of large degree over ${\mathbb F}_2$ that have a unique singular point, which has multiplicity 2. In characteristic 0 such curves exist only for degrees up to $6$. v.2: references updated and examples of…
In this paper we introduce and study the strip planarity testing problem, which takes as an input a planar graph $G(V,E)$ and a function $\gamma:V \rightarrow \{1,2,\dots,k\}$ and asks whether a planar drawing of $G$ exists such that each…
A recent analysis has revealed singular but physically relevant 2D localized vortex states with density ~ 1/r^{4/3} at r --> 0 and a convergent total norm, which are maintained by the interplay of the potential of the attraction to the…
In this paper, we study a first order solution method for a particular class of set optimization problems where the solution concept is given by the set approach. We consider the case in which the set-valued objective mapping is identified…
Van der Waerden's (VDW) colouring theorem in combinatoric number theory [1] has scope for physical applications.The solution of the two colour case has enabled the construction of an explicit mapping of an infinite, one dimensional…
This report addresses the boundary value problem for a second-order linear singularly perturbed FIDE. Traditional methods for solving these equations often face stability issues when dealing with small perturbation parameters. We propose an…