Related papers: Completion problem for extension of m- isometric w…
The Edge Multicut problem is a classical cut problem where given an undirected graph $G$, a set of pairs of vertices $\mathcal{P}$, and a budget $k$, the goal is to determine if there is a set $S$ of at most $k$ edges such that for each…
We consider the max-cut and max-$k$-cut problems under graph-based constraints. Our approach can handle any constraint specified using monadic second-order (MSO) logic on graphs of constant treewidth. We give a $\frac{1}{2}$-approximation…
In this work we study the essential spectra of composition operators on weighted Bergman spaces of analytic functions which might be termed as "quasi-parabolic." This is the class of composition operators on $A_{\alpha}^{2}$ with symbols…
We study Schr\"odinger operators given by positive quadratic forms on infinite graphs. From there, we develop a criticality theory for Schr\"odinger operators on general weighted graphs.
Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show how a number of easily-defined expansions on finite semigroups…
Corresponding to any $(m-1)$-tuple of semi-spectral measures on the unit circle, a weighted Dirichlet-type space is introduced and studied. We prove that the operator of multiplication by the coordinate function on these weighted…
We study the \emph{{interval completion}} problem, which asks for the insertion of a set of at most $k$ edges to make a graph of $n$ vertices into an interval graph. We focus on chordal graphs with no small obstructions, where every…
Weighted independent domination is an NP-hard graph problem, which remains computationally intractable in many restricted graph classes. In particular, the problem is NP-hard in the classes of sat-graphs and chordal graphs. We strengthen…
This article presents examples of an application of the finite field method for the computation of the characteristic polynomial of the matching arrangement of a graph. Weight functions on edges of a graph with weights from a finite field…
In this work it is shown that the SD-KE decomposition is multiplicative under determinantal-type functions for graphs with perfect matchings, providing a new tool for the study of unimodular and singular matchable graphs.
In this paper, we study a set of combinatorial optimization problems on weighted graphs: the shortest path problem with negative weights, the weighted perfect bipartite matching problem, the unit-capacity minimum-cost maximum flow problem…
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…
In the Directed Disjoint Paths problem ($k$-DDP), we are given a digraph $k$ pairs of terminals, and the goal is to find $k$ pairwise vertex-disjoint paths connecting each pair of terminals. Bang-Jensen and Thomassen [SIAM J. Discrete Math.…
Numerous approximation algorithms for problems on unit disk graphs have been proposed in the literature, exhibiting a sharp trade-off between running times and approximation ratios. We introduce a variation of the known shifting strategy…
A finite dimensional operator that commutes with some symmetry group admits quotient operators, which are determined by the choice of associated representation. Taking the quotient isolates the part of the spectrum supporting the chosen…
We extend the graphical calculus developed in the first part of this paper to the parametrising spaces of quantum vertex operators. This involves a graphical implementation of the dynamical twist functor, which is a strict monoidal functor…
We describe recent achievements in the theory of weight systems, which are functions on chord diagrams satisfying so-called $4$-term relations. Our main attention is devoted to constructions of weight systems. The two main sources of these…
In this paper we present linear time approximation schemes for several generalized matching problems on nonbipartite graphs. Our results include $O_\epsilon(m)$-time algorithms for $(1-\epsilon)$-maximum weight $f$-factor and…
We consider abstract Banach spaces of analytic functions on general bounded domains that satisfy only a minimum number of axioms. We describe all invertible (equivalently, surjective) weighted composition operators acting on such spaces.…
The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, characterize digraphs comprising $k$ disjoint branchings $B_i$…