On Parallel Sorting and Addition with Concurrent Writes. - Sanjeev Saxena; P. C. P. Bhatt; V. C. Prasad (FSTTCS, 1988)

Efficient VLSI Parallel Algorithm for Delaunay Triangulation on Orthogonal Tree Network in Two and Three Dimensions. - Sanjeev Saxena; P. C. P. Bhatt; V. C. Prasad (IEEE Trans. Computers, 1990)

Improved Deterministic Parallel Integer Sorting - P. C. P. Bhatt; Krzysztof Diks; Torben Hagerup; V. C. Prasad; Tomasz Radzik; Sanjeev Saxena (Inf. Comput., 1991)

Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees. - G. Sajith; Sanjeev Saxena (Inf. Process. Lett., 1994)

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

On Parallel Prefix Computation. - Sanjeev Saxena; Pramod Chandra P. Bhatt; V. C. Prasad (Parallel Process. Lett., 1994)

Parallel algorithms for single row routing in narrow streets. - Saibal Das; Sanjeev Saxena (VLSI Design, 1995)

Corrigendum: Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees. - G. Sajith; Sanjeev Saxena (Inf. Process. Lett., 1995)

Parallel Algorithms for Connectivity Problems on Interval Graphs. - Sanjeev Saxena; N. Malahal Rao (Inf. Process. Lett., 1995)

Parallel Integer Sorting and Simulation Amongst CRCW Models. - Sanjeev Saxena (Acta Informatica, 1996)

Optimal Parallel Algorithm for Brooks' Colouring Bounded Degree Graphs in Logarithmic Time on EREW PRAM. - G. Sajith; Sanjeev Saxena (Discret. Appl. Math., 1996)

Parallel algorithms for the longest common subsequence problem. - K. Nandan Babu; Sanjeev Saxena (HiPC, 1997)

Parallel Algorithms for Finding the Most Vital Edge in Weighted Graphs. - Sudarshan Banerjee; Sanjeev Saxena (J. Parallel Distributed Comput., 1997)

Parallel algorithms for vehicle routing problems. - K. Jeevan Madhu; Sanjeev Saxena (HiPC, 1998)

Parallel Vertex Colouring of Interval Graphs. - G. Sajith; Sanjeev Saxena (Int. J. Found. Comput. Sci., 1999)

Optimal Sublogarithmic Time Parallel Algorithms on Rooted Forests. - G. Sajith; Sanjeev Saxena (Algorithmica, 2000)

An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs. - K. V. R. C. N. Kishore; Sanjeev Saxena (Inf. Process. Lett., 2000)

Local Nature of Brooks' Colouring for Degree 3 Graphs. - G. Sajith; Sanjeev Saxena (Graphs Comb., 2003)

Fast parallel edge colouring of graphs. - G. Sajith; Sanjeev Saxena (J. Parallel Distributed Comput., 2003)

Splay Trees. - Sanjeev Saxena (Handbook of Data Structures and Applications, 2004)

Parallel algorithms for separable permutations. - V. Yugandhar; Sanjeev Saxena (Discret. Appl. Math., 2005)

Dominance made simple. - Sanjeev Saxena (Inf. Process. Lett., 2009)

On finding fundamental cut sets. - Sanjeev Saxena (Inf. Process. Lett., 2010)

An efficient parallel algorithm for building the separating tree. - Yijie Han; Sanjeev Saxena; Xiaojun Shen (J. Parallel Distributed Comput., 2010)

Faster Replacement Paths Algorithm for Undirected, Positive Integer Weighted Graphs with Small Diameter. - Jay Mahadeokar; Sanjeev Saxena (IWOCA, 2012)

Algorithms for Testing Length Four Permutations. - Yijie Han; Sanjeev Saxena (FAW-AAIM, 2013)

Efficient solutions for finding vitality with respect to shortest paths. - Anjeneya Swami Kare; Sanjeev Saxena (IC3, 2013)

Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs. - Jay Mahadeokar; Sanjeev Saxena (J. Discrete Algorithms, 2013)

Parallel Algorithms for Testing Length Four Permutations. - Yijie Han; Sanjeev Saxena (PAAP, 2014)

Swap Edges of Shortest Path Tree in Parallel. - Anjeneya Swami Kare; Sanjeev Saxena (RAIT, 2014)

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

Faster algorithm to find anti-risk path between two nodes of an undirected graph. - Jay Mahadeokar; Sanjeev Saxena (J. Comb. Optim., 2014)

Maximal Independent Sets in Generalised Caterpillar Graphs. - Neethi K. S.; Sanjeev Saxena (CoRR, 2015)

Design of H-Plane Tee Junction in RSIW for Ku-Band Applications. - Anamika Banwari; Ridhi Garg; Sanjeev Saxena (SoCPaR, 2016)

Design of E-Plane Tee Junction in RSIW for C-Band Applications. - Anamika Banwari; Richa Shreyam; Shailza Gotra; Sanjeev Saxena (SoCPaR, 2016)

Ultra-wideband antenna for a ground penetrating radar. - Niloy Chakrabarti; Sagar Kalra; Sanjeev Saxena; Malay Ranjan Tripathy (WOCN, 2016)

A still simpler way of introducing interior-point method for linear programming. - Kurt Mehlhorn; Sanjeev Saxena (Comput. Sci. Rev., 2016)

Ellipsoid Method for Linear Programming made simple. - Sanjeev Saxena (CoRR, 2017)

A simple introduction to Karmarkar's Algorithm for Linear Programming. - Sanjeev Saxena (CoRR, 2017)

Maximal independent sets in a generalisation of caterpillar graph. - Neethi K. S.; Sanjeev Saxena (J. Comb. Optim., 2017)

Maximum cardinality neighbourly sets in quadrilateral free graphs. - Neethi K. S.; Sanjeev Saxena (J. Comb. Optim., 2017)

Algorithms for testing occurrences of length 4 patterns in permutations. - Yijie Han; Sanjeev Saxena (J. Comb. Optim., 2018)

Edge colouring Game on Trees with maximum degree Δ=4. - Akshay Singh; Sanjeev Saxena (CoRR, 2020)

Zone Theorem for Arrangements in three dimensions. - Sanjeev Saxena (CoRR, 2020)

On seat allocation problem with multiple merit lists. - Rahul Kumar Singh; Sanjeev Saxena (CoRR, 2020)

All Nearest Smallers Made Simple. - Sanjeev Saxena (Parallel Process. Lett., 2020)

Sorted Range Reporting. - Waseem Akram 002; Sanjeev Saxena (CoRR, 2021)

Zone theorem for arrangements in dimension three. - Sanjeev Saxena (Inf. Process. Lett., 2021)

Simple O(1) Query Algorithm for Level Ancestors. - Sanjeev Saxena (CoRR, 2022)

On Brooks' Theorem. - Gopalan Sajith; Sanjeev Saxena (CoRR, 2022)

Dominance for Containment Problems. - Waseem Akram 002; Sanjeev Saxena (CoRR, 2022)

Near Infrared and Visible Image Registration Using Whale Optimization Algorithm. - Sanjeev Saxena; Mausumi Pohit (Int. J. Appl. Metaheuristic Comput., 2022)

Improved Particle Swarm Optimization With Spiral Updating Mechanism for Multimodal Image Registration. - Sanjeev Saxena; Mausumi Pohit (Int. J. Swarm Intell. Res., 2022)

Storage in Computational Geometry. - Yijie Han; Sanjeev Saxena (CoRR, 2023)

Consecutive Occurrences with Distance Constraints. - Waseem Akram 002; Sanjeev Saxena (CALDAM, 2024)

Maximizing Weighted Dominance in the Plane. - Waseem Akram 002; Sanjeev Saxena (ICTAC, 2024)

Dominance for Enclosure Problems. - Waseem Akram 002; Sanjeev Saxena (IWOCA, 2024)

Top-k Stabbing Interval Queries. - Waseem Akram 002; Sanjeev Saxena (CoRR, 2024)

Sorted Range Selection and Range Minima Queries. - Waseem Akram 002; Sanjeev Saxena (ICAA, 2025)

Point enclosure problem for homothetic polygons. - Waseem Akram 002; Sanjeev Saxena (Theor. Comput. Sci., 2025)

Duality between Lines and Points. - Sanjeev Saxena (CoRR, 2025)