相关论文: The optimal way of folding a bond notebook page in…
The main objects of the paper are $z$-oriented triangulations of connected closed $2$-dimensional surfaces. A $z$-orientation of a map is a minimal collection of zigzags which double covers the set of edges. We have two possibilities for an…
Circular layouts are a popular graph drawing style, where vertices are placed on a circle and edges are drawn as straight chords. Crossing minimization in circular layouts is \NP-hard. One way to allow for fewer crossings in practice are…
Our first experience of dimension typically comes in the intuitive Euclidean sense: a line is one dimensional, a plane is two-dimensional, and a volume is three-dimensional. However, following the work of Mandelbrot \cite{mandelbrot},…
We analyzed folding routes predicted by a variational model in terms of a generalized formalism of the capillarity scaling theory for 28 two-state proteins. The scaling exponent ranged from 0.2 to 0.45 with an average of 0.33. This average…
We describe a new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation. Most importantly, this algorithm runs in polynomial time in the bit-size of the two edge vectors.…
We develop a new method to determine the acceleration of a block sliding down along the face of a moving wedge. We have been able to link the solution of this problem to that of the inclined plane problem of elementary physics, thus…
We consider the problem of packing a family of disks "on a shelf", that is, such that each disk touches the $x$-axis from above and such that no two disks overlap. We prove that the problem of minimizing the distance between the leftmost…
The mechanical properties of thermally excited two-dimensional crystalline membranes can depend dramatically on their geometry and topology. A particularly relevant example is the effect on the crumpling transition of holes in the membrane.…
We show that there is no $(1+\eps)$-approximation algorithm for the problem of covering points in the plane by minimum number of fat triangles of similar size (with the minimum angle of the triangles being close to 45 degrees). Here, the…
The page number of a directed acyclic graph $G$ is the minimum $k$ for which there is a topological ordering of $G$ and a $k$-coloring of the edges such that no two edges of the same color cross, i.e., have alternating endpoints along the…
The purpose of modeling document relevance for search engines is to rank better in subsequent searches. Document-specific historical click-through rates can be important features in a dynamic ranking system which updates as we accumulate…
Given an undirected graph G, the edge orientation problem asks for assigning a direction to each edge to convert G into a directed graph. The aim is to minimize the maximum out degree of a vertex in the resulting directed graph. This…
The study on the relationship between the spheres and voids in packing system suggests that the edge effect at the interface between the container and the particles is an important factor lowering the packing ratio. To pack spheres in a…
We consider applications involving a large set of instances of projecting points to polytopes. We develop an intuition guided by theoretical and empirical analysis to show that when these instances follow certain structures, a large…
Untangling is a process in which some vertices of a planar graph are moved to obtain a straight-line plane drawing. The aim is to move as few vertices as possible. We present an algorithm that untangles the cycle graph C_n while keeping at…
Faceted browsing is a commonly supported feature of user interfaces for access to information. Existing interfaces generally treat facet values selected by a user as hard filters and respond to the user by only displaying information items…
A book embedding of a graph is a drawing that maps vertices onto a line and edges to simple pairwise non-crossing curves drawn into pages, which are half-planes bounded by that line. Two-page book embeddings, i.e., book embeddings into 2…
Graph modification problems with the goal of optimizing some measure of a given node's network position have a rich history in the algorithms literature. Less commonly explored are modification problems with the goal of equalizing…
The paper is concerned with a node-based, gradient-driven, continuous adjoint two-phase flow procedure to optimize the shapes of free-floating vessels and discusses three topics. First, we aim to convey that elements of a Cahn-Hilliard…
Tag recommendation is a major aspect of collaborative tagging systems. It aims to recommend tags to a user for tagging an item. In this paper we present a part of our work in progress which is a novel improvement of recommendations by…