相关论文: Least-perimeter partitions of the disk into three …

We prove the existence of at least two distinct short, simple orthogonal geodesic chords on a Riemannian 2-disk $M$ with convex boundary. The lengths of these curves are bounded in terms of the length of $\partial M$, the diameter of $M$,…

We consider $L^2$ minimizing geodesics along the group of volume preserving maps $SDiff(D)$ of a given 3-dimensional domain $D$. The corresponding curves describe the motion of an ideal incompressible fluid inside $D$ and are (formally)…

Optimal surface segmentation is a state-of-the-art method used for segmentation of multiple globally optimal surfaces in volumetric datasets. The method is widely used in numerous medical image segmentation applications. However, nodes in…

We introduced an asymptotic quantity that counts area-minimizing surfaces in negatively curved closed 3-manifolds and show that quantity to only be minimized, among all metrics of sectional curvature less than or equal -1, by the hyperbolic…

Recent research on computing the diameter of geometric intersection graphs has made significant strides, primarily focusing on the 2D case where truly subquadratic-time algorithms were given for simple objects such as unit-disks and…

The area of judicious partitioning considers the general family of partitioning problems in which one seeks to optimize several parameters simultaneously, and these problems have been widely studied in various combinatorial contexts. In…

We prove existence of equal area partitions of the unit sphere via optimal transport methods, accompanied by diameter bounds written in terms of Monge--Kantorovich distances. This can be used to obtain bounds on the expectation of the…

In this paper we consider the problem of prescribing the Gaussian and geodesic curvature on a disk and its boundary, respectively, via a conformal change of the metric. This leads us to a Liouville-type equation with a nonlinear Neumann…

The problem of graph Reachability is to decide whether there is a path from one vertex to another in a given graph. In this paper, we study the Reachability problem on three distinct graph families - intersection graphs of Jordan regions,…

We consider the problem of partitioning the edges of a graph into as few paths as possible. This is a~subject of the classic conjecture of Gallai and a recurring topic in combinatorics. Regarding the complexity of partitioning a graph…

We consider the Minimum Convex Partition problem: Given a set P of n points in the plane, draw a plane graph G on P, with positive minimum degree, such that G partitions the convex hull of P into a minimum number of convex faces. We show…

Recently it has been shown that the unique locally perimeter minimizing partitioning of the plane into three regions, where one region has finite area and the other two have infinite measure, is given by the so-called standard lens…

Quantitative estimates related to the classical Borsuk problem of splitting set in Euclidean space into subsets of smaller diameter are considered. For a given $k$ there is a minimal diameter of subsets at which there exists a covering with…

We consider a system of three surfaces, graphs over a bounded domain in ${\mathbb R}^2$, intersecting along a time-dependent curve and moving by mean curvature while preserving the pairwise angles at the curve of intersection (equal to…

Balanced partitioning is often a crucial first step in solving large-scale graph optimization problems, e.g., in some cases, a big graph can be chopped into pieces that fit on one machine to be processed independently before stitching the…

In this paper we study 1/k geodesics, those closed geodesics that minimize on all subintervals of length $L/k$, where $L$ is the length of the geodesic. We develop new techniques to study the minimizing properties of these curves on doubled…

A classical result of Dowker (Bull. Amer. Math. Soc. 50: 120-122, 1944) states that for any plane convex body $K$, the areas of the maximum (resp. minimum) area convex $n$-gons inscribed (resp. circumscribed) in $K$ is a concave (resp.…

An exact algorithm is presented for solving edge weighted graph partitioning problems. The algorithm is based on a branch and bound method applied to a continuous quadratic programming formulation of the problem. Lower bounds are obtained…

In this short article, we consider a problem about $2$-partition of the vertices of a graph. If a graph admits such a partition into some 'small' graphs, then the number of edges cross an arbitrary cut of the graph $e(S,S^{c})$ has a nice…

Consider an orientable compact surface in three dimensional Euclidean space with minimum total absolute curvature. If the Gaussian curvature changes sign to finite order and satisfies a nondegeneracy condition along closed asymptotic…