default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSanjeev Saxena
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Waseem Akram
, Sanjeev Saxena:
Consecutive Occurrences with Distance Constraints. CALDAM 2024: 3-13- [c14]Waseem Akram, Sanjeev Saxena:
Dominance for Enclosure Problems. IWOCA 2024: 408-420 - [i16]Waseem Akram, Sanjeev Saxena:
Maximizing Weighted Dominance in the Plane. CoRR abs/2405.15811 (2024) - 2023
- [c13]Waseem Akram, Sanjeev Saxena:
Point Enclosure Problem for Homothetic Polygons. IWOCA 2023: 13-24 - [i15]Yijie Han, Sanjeev Saxena:
Storage in Computational Geometry. CoRR abs/2302.11821 (2023) - 2022
- [j29]Sanjeev Saxena, Mausumi Pohit:
Near Infrared and Visible Image Registration Using Whale Optimization Algorithm. Int. J. Appl. Metaheuristic Comput. 13(1): 1-14 (2022) - [j28]Sanjeev Saxena, Mausumi Pohit:
Improved Particle Swarm Optimization With Spiral Updating Mechanism for Multimodal Image Registration. Int. J. Swarm Intell. Res. 13(1): 1-20 (2022) - [i14]Sanjeev Saxena:
Simple O(1) Query Algorithm for Level Ancestors. CoRR abs/2207.11954 (2022) - [i13]Gopalan Sajith, Sanjeev Saxena:
On Brooks' Theorem. CoRR abs/2208.02186 (2022) - [i12]Waseem Akram, Sanjeev Saxena:
Dominance for Containment Problems. CoRR abs/2212.10247 (2022) - 2021
- [j27]Sanjeev Saxena:
Zone theorem for arrangements in dimension three. Inf. Process. Lett. 172: 106161 (2021) - [i11]Waseem Akram, Sanjeev Saxena:
Sorted Range Reporting. CoRR abs/2104.02461 (2021) - [i10]Waseem Akram, Sanjeev Saxena:
Point Enclosure Problem for Homothetic Polygons. CoRR abs/2112.01860 (2021) - 2020
- [j26]Sanjeev Saxena:
All Nearest Smallers Made Simple. Parallel Process. Lett. 30(2): 2050008:1-2050008:23 (2020) - [i9]Akshay Singh, Sanjeev Saxena:
Edge colouring Game on Trees with maximum degree Δ=4. CoRR abs/2002.03816 (2020) - [i8]Sanjeev Saxena:
Zone Theorem for Arrangements in three dimensions. CoRR abs/2006.01428 (2020) - [i7]Rahul Kumar Singh, Sanjeev Saxena:
On seat allocation problem with multiple merit lists. CoRR abs/2008.05844 (2020)
2010 – 2019
- 2018
- [j25]Yijie Han, Sanjeev Saxena:
Algorithms for testing occurrences of length 4 patterns in permutations. J. Comb. Optim. 35(1): 189-208 (2018) - 2017
- [j24]Neethi K. S., Sanjeev Saxena:
Maximal independent sets in a generalisation of caterpillar graph. J. Comb. Optim. 33(1): 326-332 (2017) - [j23]Neethi K. S., Sanjeev Saxena:
Maximum cardinality neighbourly sets in quadrilateral free graphs. J. Comb. Optim. 33(2): 422-444 (2017) - [i6]Sanjeev Saxena:
Ellipsoid Method for Linear Programming made simple. CoRR abs/1712.04637 (2017) - [i5]Sanjeev Saxena:
A simple introduction to Karmarkar's Algorithm for Linear Programming. CoRR abs/1712.08328 (2017) - 2016
- [j22]Kurt Mehlhorn, Sanjeev Saxena:
A still simpler way of introducing interior-point method for linear programming. Comput. Sci. Rev. 22: 1-11 (2016) - [c12]Anamika Banwari, Ridhi Garg, Sanjeev Saxena:
Design of H-Plane Tee Junction in RSIW for Ku-Band Applications. SoCPaR 2016: 450-459 - [c11]Anamika Banwari, Richa Shreyam, Shailza Gotra, Sanjeev Saxena:
Design of E-Plane Tee Junction in RSIW for C-Band Applications. SoCPaR 2016: 547-556 - [c10]Niloy Chakrabarti, Sagar Kalra, Sanjeev Saxena, Malay Ranjan Tripathy:
Ultra-wideband antenna for a ground penetrating radar. WOCN 2016: 1-6 - 2015
- [i4]Neethi K. S., Sanjeev Saxena:
Maximal Independent Sets in Generalised Caterpillar Graphs. CoRR abs/1502.04514 (2015) - [i3]Kurt Mehlhorn, Sanjeev Saxena:
A Still Simpler Way of Introducing the Interior-Point Method for Linear Programming. CoRR abs/1510.03339 (2015) - 2014
- [j21]Jay Mahadeokar, Sanjeev Saxena:
Faster algorithm to find anti-risk path between two nodes of an undirected graph. J. Comb. Optim. 27(4): 798-807 (2014) - [c9]Yijie Han, Sanjeev Saxena:
Parallel Algorithms for Testing Length Four Permutations. PAAP 2014: 81-86 - [c8]Anjeneya Swami Kare, Sanjeev Saxena:
Swap Edges of Shortest Path Tree in Parallel. RAIT 2014: 77-85 - [i2]Sanjeev Saxena:
Still Simpler Way of Introducing Interior-Point method for Linear Programming. CoRR abs/1412.0652 (2014) - [i1]Neethi K. S., Sanjeev Saxena:
Maximum Cardinality Neighbourly Sets in Quadrilateral Free Graphs. CoRR abs/1412.8338 (2014) - 2013
- [j20]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: 54-62 (2013) - [c7]Yijie Han, Sanjeev Saxena:
Algorithms for Testing Length Four Permutations. FAW-AAIM 2013: 17-23 - [c6]Anjeneya Swami Kare, Sanjeev Saxena:
Efficient solutions for finding vitality with respect to shortest paths. IC3 2013: 70-75 - 2012
- [c5]Jay Mahadeokar, Sanjeev Saxena:
Faster Replacement Paths Algorithm for Undirected, Positive Integer Weighted Graphs with Small Diameter. IWOCA 2012: 81-85 - 2010
- [j19]Sanjeev Saxena:
On finding fundamental cut sets. Inf. Process. Lett. 110(4): 168-170 (2010) - [j18]Yijie Han, Sanjeev Saxena, Xiaojun Shen:
An efficient parallel algorithm for building the separating tree. J. Parallel Distributed Comput. 70(6): 625-629 (2010)
2000 – 2009
- 2009
- [j17]Sanjeev Saxena:
Dominance made simple. Inf. Process. Lett. 109(9): 419-421 (2009) - 2005
- [j16]V. Yugandhar, Sanjeev Saxena:
Parallel algorithms for separable permutations. Discret. Appl. Math. 146(3): 343-364 (2005) - 2004
- [r1]Sanjeev Saxena:
Splay Trees. Handbook of Data Structures and Applications 2004 - 2003
- [j15]G. Sajith, Sanjeev Saxena:
Local Nature of Brooks' Colouring for Degree 3 Graphs. Graphs Comb. 19(4): 551-565 (2003) - [j14]G. Sajith, Sanjeev Saxena:
Fast parallel edge colouring of graphs. J. Parallel Distributed Comput. 63(9): 775-785 (2003) - 2000
- [j13]G. Sajith, Sanjeev Saxena:
Optimal Sublogarithmic Time Parallel Algorithms on Rooted Forests. Algorithmica 27(2): 187-197 (2000) - [j12]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): 145-151 (2000)
1990 – 1999
- 1999
- [j11]G. Sajith, Sanjeev Saxena:
Parallel Vertex Colouring of Interval Graphs. Int. J. Found. Comput. Sci. 10(1): 19-32 (1999) - 1998
- [c4]K. Jeevan Madhu, Sanjeev Saxena:
Parallel algorithms for vehicle routing problems. HiPC 1998: 171-178 - 1997
- [j10]Sudarshan Banerjee, Sanjeev Saxena:
Parallel Algorithms for Finding the Most Vital Edge in Weighted Graphs. J. Parallel Distributed Comput. 46(1): 101-104 (1997) - [c3]K. Nandan Babu, Sanjeev Saxena:
Parallel algorithms for the longest common subsequence problem. HiPC 1997: 120-125 - 1996
- [j9]Sanjeev Saxena:
Parallel Integer Sorting and Simulation Amongst CRCW Models. Acta Informatica 33(7): 607-619 (1996) - [j8]G. Sajith, Sanjeev Saxena:
Optimal Parallel Algorithm for Brooks' Colouring Bounded Degree Graphs in Logarithmic Time on EREW PRAM. Discret. Appl. Math. 64(3): 249-265 (1996) - 1995
- [j7]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): 305 (1995) - [j6]Sanjeev Saxena, N. Malahal Rao:
Parallel Algorithms for Connectivity Problems on Interval Graphs. Inf. Process. Lett. 56(1): 37-44 (1995) - [c2]Saibal Das, Sanjeev Saxena:
Parallel algorithms for single row routing in narrow streets. VLSI Design 1995: 13-18 - 1994
- [j5]Sanjeev Saxena:
Two-Coloring Linked Lists is NC^1-Complete for Logarithmic Space. Inf. Process. Lett. 49(2): 73-76 (1994) - [j4]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): 303-308 (1994) - [j3]Sanjeev Saxena, Pramod Chandra P. Bhatt, V. C. Prasad:
On Parallel Prefix Computation. Parallel Process. Lett. 4: 429-436 (1994) - 1991
- [j2]P. C. P. Bhatt, Krzysztof Diks, Torben Hagerup, V. C. Prasad, Tomasz Radzik, Sanjeev Saxena:
Improved Deterministic Parallel Integer Sorting. Inf. Comput. 94(1): 29-47 (1991) - 1990
- [j1]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): 400-404 (1990)
1980 – 1989
- 1988
- [c1]Sanjeev Saxena, P. C. P. Bhatt, V. C. Prasad:
On Parallel Sorting and Addition with Concurrent Writes. FSTTCS 1988: 143-153
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
