Sanjeev Saxena

Publication Activity (10 Years)

Years Active: 1988-2024
Publications (10 Years): 26

Top Topics

Linear Programming

Optimization Algorithm

Top Venues

J. Comb. Optim.

Publications

Waseem Akram, Sanjeev Saxena
Dominance for Enclosure Problems. IWOCA (2024)
Waseem Akram, Sanjeev Saxena
Consecutive Occurrences with Distance Constraints. CALDAM (2024)
Waseem Akram, Sanjeev Saxena
Maximizing Weighted Dominance in the Plane. CoRR (2024)
Waseem Akram, Sanjeev Saxena
Point Enclosure Problem for Homothetic Polygons. IWOCA (2023)
Yijie Han, Sanjeev Saxena
Storage in Computational Geometry. CoRR (2023)
Sanjeev Saxena
Simple O(1) Query Algorithm for Level Ancestors. CoRR (2022)
Sanjeev Saxena, Mausumi Pohit
Improved Particle Swarm Optimization With Spiral Updating Mechanism for Multimodal Image Registration. Int. J. Swarm Intell. Res. 13 (1) (2022)
Sanjeev Saxena, Mausumi Pohit
Near Infrared and Visible Image Registration Using Whale Optimization Algorithm. Int. J. Appl. Metaheuristic Comput. 13 (1) (2022)
Waseem Akram, Sanjeev Saxena
Dominance for Containment Problems. CoRR (2022)
Gopalan Sajith, Sanjeev Saxena
On Brooks' Theorem. CoRR (2022)
Sanjeev Saxena
Zone theorem for arrangements in dimension three. Inf. Process. Lett. 172 (2021)
Waseem Akram, Sanjeev Saxena
Sorted Range Reporting. CoRR (2021)
Waseem Akram, Sanjeev Saxena
Point Enclosure Problem for Homothetic Polygons. CoRR (2021)
Sanjeev Saxena
All Nearest Smallers Made Simple. Parallel Process. Lett. 30 (2) (2020)
Sanjeev Saxena
Zone Theorem for Arrangements in three dimensions. CoRR (2020)
Rahul Kumar Singh, Sanjeev Saxena
On seat allocation problem with multiple merit lists. CoRR (2020)
Akshay Singh, Sanjeev Saxena
Edge colouring Game on Trees with maximum degree Δ=4. CoRR (2020)
Yijie Han, Sanjeev Saxena
Algorithms for testing occurrences of length 4 patterns in permutations. J. Comb. Optim. 35 (1) (2018)
Sanjeev Saxena
A simple introduction to Karmarkar's Algorithm for Linear Programming. CoRR (2017)
Sanjeev Saxena
Ellipsoid Method for Linear Programming made simple. CoRR (2017)
Neethi K. S., Sanjeev Saxena
Maximum cardinality neighbourly sets in quadrilateral free graphs. J. Comb. Optim. 33 (2) (2017)
Neethi K. S., Sanjeev Saxena
Maximal independent sets in a generalisation of caterpillar graph. J. Comb. Optim. 33 (1) (2017)
Niloy Chakrabarti, Sagar Kalra, Sanjeev Saxena, M. R. Tripathy
Ultra-wideband antenna for a ground penetrating radar. WOCN (2016)
Kurt Mehlhorn, Sanjeev Saxena
A still simpler way of introducing interior-point method for linear programming. Comput. Sci. Rev. 22 (2016)
Anamika Banwari, Ridhi Garg, Sanjeev Saxena
Design of H-Plane Tee Junction in RSIW for Ku-Band Applications. SoCPaR (2016)
Anamika Banwari, Richa Shreyam, Shailza Gotra, Sanjeev Saxena
Design of E-Plane Tee Junction in RSIW for C-Band Applications. SoCPaR (2016)
Neethi K. S., Sanjeev Saxena
Maximal Independent Sets in Generalised Caterpillar Graphs. CoRR (2015)
Kurt Mehlhorn, Sanjeev Saxena
A Still Simpler Way of Introducing the Interior-Point Method for Linear Programming. CoRR (2015)
Neethi K. S., Sanjeev Saxena
Maximum Cardinality Neighbourly Sets in Quadrilateral Free Graphs. CoRR (2014)
Yijie Han, Sanjeev Saxena
Parallel Algorithms for Testing Length Four Permutations. PAAP (2014)
Anjeneya Swami Kare, Sanjeev Saxena
Swap Edges of Shortest Path Tree in Parallel. RAIT (2014)
Jay Mahadeokar, Sanjeev Saxena
Faster algorithm to find anti-risk path between two nodes of an undirected graph. J. Comb. Optim. 27 (4) (2014)
Sanjeev Saxena
Still Simpler Way of Introducing Interior-Point method for Linear Programming. CoRR (2014)
Yijie Han, Sanjeev Saxena
Algorithms for Testing Length Four Permutations. FAW-AAIM (2013)
Jay Mahadeokar, Sanjeev Saxena
Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs. J. Discrete Algorithms 23 (2013)
Anjeneya Swami Kare, Sanjeev Saxena
Efficient solutions for finding vitality with respect to shortest paths. IC3 (2013)
Jay Mahadeokar, Sanjeev Saxena
Faster Replacement Paths Algorithm for Undirected, Positive Integer Weighted Graphs with Small Diameter. IWOCA (2012)
Sanjeev Saxena
On finding fundamental cut sets. Inf. Process. Lett. 110 (4) (2010)
Yijie Han, Sanjeev Saxena, Xiaojun Shen
An efficient parallel algorithm for building the separating tree. J. Parallel Distributed Comput. 70 (6) (2010)
Sanjeev Saxena
Dominance made simple. Inf. Process. Lett. 109 (9) (2009)
V. Yugandhar, Sanjeev Saxena
Parallel algorithms for separable permutations. Discret. Appl. Math. 146 (3) (2005)
G. Sajith, Sanjeev Saxena
Local Nature of Brooks' Colouring for Degree 3 Graphs. Graphs Comb. 19 (4) (2003)
G. Sajith, Sanjeev Saxena
Fast parallel edge colouring of graphs. J. Parallel Distributed Comput. 63 (9) (2003)
K. V. R. C. N. Kishore, Sanjeev Saxena
An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs. Inf. Process. Lett. 75 (4) (2000)
G. Sajith, Sanjeev Saxena
Optimal Sublogarithmic Time Parallel Algorithms on Rooted Forests. Algorithmica 27 (2) (2000)
G. Sajith, Sanjeev Saxena
Parallel Vertex Colouring of Interval Graphs. Int. J. Found. Comput. Sci. 10 (1) (1999)
K. Jeevan Madhu, Sanjeev Saxena
Parallel algorithms for vehicle routing problems. HiPC (1998)
K. Nandan Babu, Sanjeev Saxena
Parallel algorithms for the longest common subsequence problem. HiPC (1997)
Sudarshan Banerjee, Sanjeev Saxena
Parallel Algorithms for Finding the Most Vital Edge in Weighted Graphs. J. Parallel Distributed Comput. 46 (1) (1997)
G. Sajith, Sanjeev Saxena
Optimal Parallel Algorithm for Brooks' Colouring Bounded Degree Graphs in Logarithmic Time on EREW PRAM. Discret. Appl. Math. 64 (3) (1996)
Sanjeev Saxena
Parallel Integer Sorting and Simulation Amongst CRCW Models. Acta Informatica 33 (7) (1996)
G. Sajith, Sanjeev Saxena
Corrigendum: Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees. Inf. Process. Lett. 54 (5) (1995)
Sanjeev Saxena, N. Malahal Rao
Parallel Algorithms for Connectivity Problems on Interval Graphs. Inf. Process. Lett. 56 (1) (1995)
Saibal Das, Sanjeev Saxena
Parallel algorithms for single row routing in narrow streets. VLSI Design (1995)
Sanjeev Saxena
Two-Coloring Linked Lists is NC^1-Complete for Logarithmic Space. Inf. Process. Lett. 49 (2) (1994)
G. Sajith, Sanjeev Saxena
Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees. Inf. Process. Lett. 49 (6) (1994)
Sanjeev Saxena, Pramod Chandra P. Bhatt, V. C. Prasad
On Parallel Prefix Computation. Parallel Process. Lett. 4 (1994)
P. C. P. Bhatt, Krzysztof Diks, Torben Hagerup, V. C. Prasad, Tomasz Radzik, Sanjeev Saxena
Improved Deterministic Parallel Integer Sorting Inf. Comput. 94 (1) (1991)
Sanjeev Saxena, P. C. P. Bhatt, V. C. Prasad
Efficient VLSI Parallel Algorithm for Delaunay Triangulation on Orthogonal Tree Network in Two and Three Dimensions. IEEE Trans. Computers 39 (3) (1990)
Sanjeev Saxena, P. C. P. Bhatt, V. C. Prasad
On Parallel Sorting and Addition with Concurrent Writes. FSTTCS (1988)