2 citations · 6 across the 14 of their papers we have counts for
14 papers
Storage in Computational Geometry
Yijie Han, Sanjeev Saxena
We show that real numbers can be stored in a constant number of real numbers such that each original real number can be fetched in time. Although our result has imp…
Dominance for Containment Problems
Waseem Akram, Sanjeev Saxena
In a containment problem, the goal is to preprocess a set of geometric objects so that, given a geometric query object, we can report all the objects containing the query object. W…
Simpler O(1) Query Algorithm for Level Ancestors
Sanjeev Saxena
This note describes a very simple O(1) query time algorithm for finding level ancestors. This is basically a serial (re)-implementation of the parallel algorithm of Berkman and Vis…
Point Enclosure Problem for Homothetic Polygons
Waseem Akram, Sanjeev Saxena
In this paper, we investigate the homothetic point enclosure problem: given a set of triangles with sides parallel to three fixed directions, find a data structure for …
Sorted Range Reporting and Range Minima Queries
Waseem Akram, Sanjeev Saxena
Given an array A[1: n] of n elements drawn from an ordered set, the sorted range selection problem is to build a data structure that can be used to answer the following type of que…
On seat allocation problem with multiple merit lists
Rahul Kumar Singh, Sanjeev Saxena
In this note, we present a simpler algorithm for joint seat allocation problem in case there are two or more merit lists. In case of two lists (the current situation for Engineerin…
Zone Theorem for Arrangements in three dimensions
Sanjeev Saxena
In this note, a simple description of zone theorem in three dimensions is given.Arrangements in three dimensions are useful for constructing higher-order Voronoi diagrams in plane.…
Edge colouring Game on Trees with maximum degree
Akshay Singh, Sanjeev Saxena
Consider the following game. We are given a tree and two players (say) Alice and Bob who alternately colour an edge of a tree (using one of colours). If all edges of the tr…
A simple introduction to Karmarkar's Algorithm for Linear Programming
Sanjeev Saxena
An extremely simple, description of Karmarkar's algorithm with very few technical terms is given.
Ellipsoid Method for Linear Programming made simple
Sanjeev Saxena
In this paper, ellipsoid method for linear programming is derived using only minimal knowledge of algebra and matrices. Unfortunately, most authors first describe the algorithm, th…
A Still Simpler Way of Introducing the Interior-Point Method for Linear Programming
Kurt Mehlhorn, Sanjeev Saxena
Linear programming is now included in algorithm undergraduate and postgraduate courses for computer science majors. We give a self-contained treatment of an interior-point method w…
Maximal Independent Sets in Generalised Caterpillar Graphs
Neethi K. S., Sanjeev Saxena
A caterpillar graph is a tree which on removal of all its pendant vertices leaves a chordless path. The chordless path is called the backbone of the graph. The edges from the backb…
Still Simpler Way of Introducing Interior-Point method for Linear Programming
Sanjeev Saxena
Linear Programming is now included in Algorithm undergraduate and postgraduate courses for Computer Science majors. It is possible to teach interior-point methods directly with jus…
Maximum Cardinality Neighbourly Sets in Quadrilateral Free Graphs
Neethi K. S., Sanjeev Saxena
Neighbourly set of a graph is a subset of edges which either share an end point or are joined by an edge of that graph. The maximum cardinality neighbourly set problem is known to…