Sanjeev Saxena

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