Related papers: Tightening Curves on Surfaces Monotonically with A…
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our dynamic-programming algorithms for general and…
We show that the existence of a homomorphism from an $n$-vertex graph $G$ to an $h$-vertex graph $H$ can be decided in time $2^{O(n)}h^{O(1)}$ and polynomial space if $H$ comes from a family of graphs that excludes a topological minor. The…
In this paper, we consider deformations of singular complex curves on complex surfaces. Despite the fundamental nature of the problem, little seems to be known for curves on general surfaces. Let $C\subset S$ be a complete integral curve on…
In Graph Theory a number of results were devoted to studying the computational complexity of the number modulo 2 of a graph's edge set decompositions of various kinds, first of all including its Hamiltonian decompositions, as well as the…
The minimum number of bicliques needed to cover the edge set of the complete graph on $n$ vertices is $\lceil \log_2 n \rceil$. The Graham-Pollak theorem states that at least $n-1$ bicliques are required to partition the edge set of the…
Let $S$ be a closed orientable hyperbolic surface, and let $\mathcal{O}(K,S)$ denote the number of mapping class group orbits of curves on $S$ with at most $K$ self-intersections. Building on work of Sapir [16], we give upper and lower…
We investigate oriented graphs based on the curve complex $C(S)$ of a closed surface $S$ and induced by functions on the vertex set of $C(S)$. In particular, we introduce the Dehn quasi-homothetic functions, which behave similarly to…
We give an algorithm for finding the arboricity of a weighted, undirected graph, defined as the minimum number of spanning forests that cover all edges of the graph, in $\sqrt{n} m^{1+o(1)}$ time. This improves on the previous best bound of…
Extremal graph theory studies the maximum or minimum number of subgraphs isomorphic to a prescribed graph under given constraints. \textit{Localization} has recently emerged as a framework that refines such problems by assigning extremal…
Bidimensionality is the most common technique to design subexponential-time parameterized algorithms on special classes of graphs, particularly planar graphs. The core engine behind it is a combinatorial lemma of Robertson, Seymour and…
Dumas, Foucaud, Perez and Todinca (2024) recently proved that every graph whose edges can be covered by $k$ shortest paths has pathwidth at most $O(3^k)$. In this paper, we improve this upper bound on the pathwidth to a polynomial one;…
We study the query complexity of geodesically convex (g-convex) optimization on a manifold. To isolate the effect of that manifold's curvature, we primarily focus on hyperbolic spaces. In a variety of settings (smooth or not; strongly…
In this paper we investigate the flow of surfaces by a class of symmetric functions of the principal curvatures with a mixed volume constraint. We consider compact surfaces without boundary that can be written as a graph over a sphere. The…
In the author's earlier work there appeared a new way to specify any smooth closed 4-manifold by a surface diagram, which consists of an orientable surface decorated with simple closed curves. These curves are cyclically indexed, and each…
Scarf's algorithm--a pivoting procedure that finds a dominating extreme point in a down-monotone polytope--can be used to show the existence of a fractional stable matching in hypergraphs. The problem of finding a fractional stable matching…
A smooth curve in the real projective plane is hyperbolic if its ovals are maximally nested. By the Helton-Vinnikov Theorem, any such curve admits a definite symmetric determinantal representation. We use polynomial homotopy continuation to…
In any attempt at designing an efficient algorithm for the minimum vertex cover problem, obtaining good upper and lower bounds for the vertex cover number could be crucial. In this article we present a modified greedy algorithm of…
This work is the extension of the results by the author in [7] and [6] for low-genus surfaces. Let $S$ be an orientable, connected surface of finite topological type, with genus $g \leq 2$, empty boundary, and complexity at least $2$; as a…
We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique applies to general families of problems where standard dynamic…
A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…