Algorithms for Ham Sandwich Cuts.
Almost Tight Bounds for e-Nets.
Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions.
An worst case bounded special knapsack with two constraints
An algorithm for reduction of complexity of relations in a system of variables
Let us have a system of variables, among which there are complicated dependences. Assuming reflexivity and transitivity of the relation " depends on ", a simple algorithm is proposed which produces all dependences in an optimized way, without losing information.
An algorithm to calculate the kernel of certain polynomial ring homomorphisms.
An almost naive algorithm for finding relative neighbourhood graphs in metrics
An approach to parallel algorithm design
An efficient algorithm for computing real powers of a matrix and a related matrix function
The paper is devoted to an algorithm for computing matrices and for a given square matrix and a real . The algorithm uses the binary expansion of and has the logarithmic computational complexity with respect to . The problem stems from the control theory.
An Efficient Motion-Planning Algorithm for a Convex Polygonal Object in Two-Dimensional Polygonal Space.
An exact performance bound for an time greedy matching procedure.
An extension of the MS pivoting rule to capacitated network flow problems
An Improved Algorithm for a Bicriteria Batching Scheduling Problem
This note is concerned with the bicriteria scheduling problem on a series-batching machine to minimize maximum cost and makespan. An O(n5) algorithm has been established previously. Here is an improved algorithm which solves the problem in O(n3) time.
An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem
Here is presented a 6-states non minimal-time solution which is intrinsically Minsky-like and solves the three following problems: unrestricted version on a line, with one initiator at each end of a line and the problem on a ring. We also give a complete proof of correctness of our solution, which was never done in a publication for Minsky's solutions.
An O(n log n) Algorithm for the All-Nearest-Neighbors Problem.
An O(n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments.
An operation with languages occurring in the linguistic approach to the management
An Optimal Convex Hull Algorithm in Any Fixed Dimension.
An Upper Bound for Conforming Delaunay Triangulations.
An Upper Bound on the Number of Planar K-Sets.