Related papers: An Algorithm taking Kirby diagrams to Trisection d…
We present an algorithm for finding a perfect matching in a $3$-edge-connected cubic graph that intersects every $3$-edge cut in exactly one edge. Specifically, we propose an algorithm with a time complexity of $O(n \log^4 n)$, which…
Triangulation of a three-dimensional point from at least two noisy 2-D images can be formulated as a quadratically constrained quadratic program. We propose an algorithm to extract candidate solutions to this problem from its semidefinite…
The importance of classifying connections in large graphs has been the motivation for a rich line of work on distributed subgraph finding that has led to exciting recent breakthroughs. A crucial aspect that remained open was whether…
We describe an algorithm which has enabled us to give a complete list, without repetitions, of all closed oriented irreducible 3-manifolds of complexity up to 9. More interestingly, we have actually been able to give a "name" to each such…
Let $G$ be a finite group, and let $X$ be a smooth, orientable, connected, closed 4-dimensional $G$-manifold. Let $\mathcal{S}$ be a smooth, embedded, $G$-invariant surface in $X$. We introduce the concept of a $G$-equivariant trisection of…
Triangle listing is an important topic significant in many practical applications. Efficient algorithms exist for the task of triangle listing. Recent algorithms leverage an orientation framework, which can be thought of as mapping an…
Shapes of four dimensional spaces can be studied effectively via maps to standard surfaces. We explain, and illustrate by quintessential examples, how to simplify such generic maps on 4-manifolds topologically, in order to derive simple…
Generalizing Heegaard splittings of 3-manifolds and trisections of 4-manifolds, we consider multisections of higher-dimensional smooth (or PL) closed orientable manifolds, namely decompositions into 1-handlebodies whose subcollections…
Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time…
We give a linear-time algorithm to decide 3-colorability of a triangle-free graph embedded in a fixed surface, and a quadratic-time algorithm to output a 3-coloring in the affirmative case. The algorithms also allow to prescribe the…
For a linear equality constrained convex optimization problem involving two objective functions with a ``nonsmooth" + ``nonsmooth" composite structure, we study two algorithms derived from a mixed-order dynamical system which incorporates…
This paper presents a quantum algorithm for triangle finding over sparse graphs that improves over the previous best quantum algorithm for this task by Buhrman et al. [SIAM Journal on Computing, 2005]. Our algorithm is based on the recent…
We give a procedure to construct (quasi-)trisection diagrams for closed (pseudo-)manifolds generated by colored tensor models without restrictions on the number of simplices in the triangulation, therefore generalizing previous works in the…
The crushing operation of Jaco and Rubinstein is a powerful technique in algorithmic 3-manifold topology: it enabled the first practical implementations of 3-sphere recognition and prime decomposition of orientable manifolds, and it plays a…
A model of a geometric algorithm is introduced and methodology of its operation is presented for the dynamic partitioning of data spaces.
A connected graph is 4-connected if it contains at least five vertices and removing any three of them does not disconnect it. A frequent preprocessing step in graph drawing is to decompose a plane graph into its 4-connected components and…
In this paper, we present two approximation algorithms for the directed multi-multiway cut and directed multicut problems. The so called region growing paradigm \cite{1} is modified and used for these two cut problems on directed graphs. By…
We present the first linear-time algorithm that computes the $4$-edge-connected components of an undirected graph. Hence, we also obtain the first linear-time algorithm for testing $4$-edge connectivity. Our results are based on a…
Despite the recent progress in genome sequencing and assembly, many of the currently available assembled genomes come in a draft form. Such draft genomes consist of a large number of genomic fragments (scaffolds), whose order and/or…
The discrete cosine transform is a valuable tool in analysis of data on undirected rectangular grids, like images. In this paper it is shown how one can define an analogue of the discrete cosine transform on triangles. This is done by…