Sanjeev Saxena

According to our database1, Sanjeev Saxena
  • authored at least 42 papers between 1988 and 2018.
  • has a "Dijkstra number"2 of four.



In proceedings 
PhD thesis 




Algorithms for testing occurrences of length 4 patterns in permutations.
J. Comb. Optim., 2018

Maximum cardinality neighbourly sets in quadrilateral free graphs.
J. Comb. Optim., 2017

Maximal independent sets in a generalisation of caterpillar graph.
J. Comb. Optim., 2017

A simple introduction to Karmarkar's Algorithm for Linear Programming.
CoRR, 2017

Ellipsoid Method for Linear Programming made simple.
CoRR, 2017

A still simpler way of introducing interior-point method for linear programming.
Computer Science Review, 2016

Ultra-wideband antenna for a ground penetrating radar.
Proceedings of the Thirteenth International Conference on Wireless and Optical Communications Networks, 2016

Maximal Independent Sets in Generalised Caterpillar Graphs.
CoRR, 2015

A Still Simpler Way of Introducing the Interior-Point Method for Linear Programming.
CoRR, 2015

Faster algorithm to find anti-risk path between two nodes of an undirected graph.
J. Comb. Optim., 2014

Still Simpler Way of Introducing Interior-Point method for Linear Programming.
CoRR, 2014

Maximum Cardinality Neighbourly Sets in Quadrilateral Free Graphs.
CoRR, 2014

Swap Edges of Shortest Path Tree in Parallel.
Proceedings of the Recent Advances in Information Technology, 2014

Parallel Algorithms for Testing Length Four Permutations.
Proceedings of the Sixth International Symposium on Parallel Architectures, 2014

Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs.
J. Discrete Algorithms, 2013

Efficient solutions for finding vitality with respect to shortest paths.
Proceedings of the Sixth International Conference on Contemporary Computing, 2013

Algorithms for Testing Length Four Permutations.
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

Faster Replacement Paths Algorithm for Undirected, Positive Integer Weighted Graphs with Small Diameter.
Proceedings of the Combinatorial Algorithms, 23rd International Workshop, 2012

An efficient parallel algorithm for building the separating tree.
J. Parallel Distrib. Comput., 2010

On finding fundamental cut sets.
Inf. Process. Lett., 2010

Dominance made simple.
Inf. Process. Lett., 2009

Parallel algorithms for separable permutations.
Discrete Applied Mathematics, 2005

Splay Trees.
Proceedings of the Handbook of Data Structures and Applications., 2004

Fast parallel edge colouring of graphs.
J. Parallel Distrib. Comput., 2003

Local Nature of Brooks' Colouring for Degree 3 Graphs.
Graphs and Combinatorics, 2003

An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs.
Inf. Process. Lett., 2000

Optimal Sublogarithmic Time Parallel Algorithms on Rooted Forests.
Algorithmica, 2000

Parallel Vertex Colouring of Interval Graphs.
Int. J. Found. Comput. Sci., 1999

Parallel algorithms for vehicle routing problems.
Proceedings of the 5th International Conference On High Performance Computing, 1998

Parallel Algorithms for Finding the Most Vital Edge in Weighted Graphs.
J. Parallel Distrib. Comput., 1997

Parallel algorithms for the longest common subsequence problem.
Proceedings of the Fourth International on High-Performance Computing, 1997

Optimal Parallel Algorithm for Brooks' Colouring Bounded Degree Graphs in Logarithmic Time on EREW PRAM.
Discrete Applied Mathematics, 1996

Parallel Integer Sorting and Simulation Amongst CRCW Models.
Acta Inf., 1996

Parallel Algorithms for Connectivity Problems on Interval Graphs.
Inf. Process. Lett., 1995

Corrigendum: Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees.
Inf. Process. Lett., 1995

Parallel algorithms for single row routing in narrow streets.
Proceedings of the 8th International Conference on VLSI Design (VLSI Design 1995), 1995

On Parallel Prefix Computation.
Parallel Processing Letters, 1994

Two-Coloring Linked Lists is NC^1-Complete for Logarithmic Space.
Inf. Process. Lett., 1994

Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees.
Inf. Process. Lett., 1994

Improved Deterministic Parallel Integer Sorting
Inf. Comput., September, 1991

Efficient VLSI Parallel Algorithm for Delaunay Triangulation on Orthogonal Tree Network in Two and Three Dimensions.
IEEE Trans. Computers, 1990

On Parallel Sorting and Addition with Concurrent Writes.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1988