default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNeelima Gupta
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c33]Rajni Dabas
, Naveen Garg, Neelima Gupta:
Capacitated Facility Location with Outliers and Uniform Facility Costs. IPCO 2024: 85-98- 2023
- [c32]Maulein Pathak, Yogish Sabharwal, Neelima Gupta:
Scalable algorithms for compact spanners on real world graphs. ICS 2023: 386-397 - [i10]Rajni Dabas, Neelima Gupta, Tanmay Inamdar:
FPT Approximations for Capacitated/Fair Clustering with Outliers. CoRR abs/2305.01471 (2023) - 2022
- [j20]Sapna Grover, Neelima Gupta, Samir Khuller:
LP-based approximation for uniform capacitated facility location problem. Discret. Optim. 45: 100723 (2022) - [c31]Rajni Dabas, Neelima Gupta:
Capacitated Facility Location with Outliers/Penalties. COCOON 2022: 549-560 - [c30]Rajni Dabas, Naveen Garg, Neelima Gupta, Dilpreet Kaur:
Locating Service and Charging Stations. WAOA 2022: 1-19 - [i9]Rajni Dabas, Neelima Gupta:
Locating Charging Stations: Connected, Capacitated and Prize- Collecting. CoRR abs/2202.06262 (2022) - [i8]Neelima Gupta, Sapna Grover, Rajni Dabas:
Constant factor approximations for Lower and Upper bounded Clusterings. CoRR abs/2203.14058 (2022) - 2021
- [c29]Neelima Gupta, Sapna Grover, Rajni Dabas:
Respecting Lower Bounds in Uniform Lower and Upper Bounded Facility Location Problem. COCOON 2021: 463-475 - [i7]Sapna Grover, Neelima Gupta, Rajni Dabas:
First Approximation for Uniform Lower and Upper Bounded Facility Location Problem avoiding violation in Lower Bounds. CoRR abs/2106.11372 (2021) - [i6]Rajni Dabas, Neelima Gupta:
On Variants of Facility Location Problem with Outliers. CoRR abs/2107.00403 (2021) - 2020
- [i5]Rajni Dabas, Neelima Gupta, Sapna Grover:
Uniform Capacitated Facility Location Problems with Penalties/Outliers. CoRR abs/2012.07135 (2020)
2010 – 2019
- 2018
- [j19]Sapna Grover, Neelima Gupta, Aditya Pancholi:
Improved Local Search Based Approximation Algorithm for Hard Uniform Capacitated k-Median Problem. Informatica (Slovenia) 42(3) (2018) - [c28]Sapna Grover, Neelima Gupta, Samir Khuller, Aditya Pancholi:
Constant Factor Approximation Algorithm for Uniform Hard Capacitated Knapsack Median Problem. FSTTCS 2018: 23:1-23:22 - [c27]Manisha Bansal, Naveen Garg, Neelima Gupta:
A 5-Approximation for Universal Facility Location. FSTTCS 2018: 24:1-24:12 - [i4]Neelima Gupta, Aditya Pancholi:
Improved Local Search Based Approximation Algorithm for Hard Uniform Capacitated k-Median Problem. CoRR abs/1804.08948 (2018) - 2017
- [j18]Geeta Aggarwal, Neelima Gupta:
BiETopti: biclustering ensemble technique using optimisation. Int. J. Bioinform. Res. Appl. 13(2): 109-130 (2017) - [c26]Anshul Aggarwal, Venkatesan T. Chakaravarthy, Neelima Gupta, Yogish Sabharwal, Sachin Sharma, Sonika Thakral:
Replica Placement on Bounded Treewidth Graphs. WADS 2017: 13-24 - [i3]Anshul Aggarwal, Venkatesan T. Chakaravarthy, Neelima Gupta, Yogish Sabharwal, Sachin Sharma, Sonika Thakral:
Replica Placement on Bounded Treewidth Graphs. CoRR abs/1705.00145 (2017) - 2016
- [j17]Preeti Nagrath, Sandhya Aneja, Neelima Gupta, Sanjay Madria:
Protocols for mitigating blackhole attacks in delay tolerant networks. Wirel. Networks 22(1): 235-246 (2016) - [j16]Shri Rahul Johari, Neelima Gupta, Sandhya Aneja:
Experimental Evaluation of Routing Schemes for Intermittently Connected Wireless Mobile Networks. Wirel. Pers. Commun. 87(3): 897-921 (2016) - [i2]Sapna Grover, Neelima Gupta, Dipti Kakkar:
Constant factor Approximation Algorithms for Uniform Hard Capacitated Facility Location Problems: Natural LP is not too bad. CoRR abs/1606.08022 (2016) - 2015
- [j15]Parvaneh Mansouri, Babak Asady, Neelima Gupta:
The Bisection-Artificial Bee Colony algorithm to solve Fixed point problems. Appl. Soft Comput. 26: 143-148 (2015) - [j14]Rahul Johari, Neelima Gupta, Sandhya Aneja:
CONCOR: context-aware community-oriented routing for intermittently connected network. EURASIP J. Wirel. Commun. Netw. 2015: 148 (2015) - [j13]Rahul Johari, Neelima Gupta, Sandhya Aneja:
POSOP Routing Algorithm: A DTN Routing Scheme for Information Connectivity of Health Centres in Hilly State of North India. Int. J. Distributed Sens. Networks 11: 376861:1-376861:9 (2015) - [c25]Venkatesan T. Chakaravarthy, Neelima Gupta, Aditya Pancholi, Sambuddha Roy:
Fast Algorithms for Constrained Graph Density Problems. WALCOM 2015: 8-19 - 2014
- [j12]Sonika Arora, Neelima Gupta, Samir Khuller, Yogish Sabharwal, Swati Singhal:
Facility location with red-blue demands. Oper. Res. Lett. 42(6-7): 462-465 (2014) - [c24]Sonika Arora, Venkatesan T. Chakaravarthy, Kanika Gupta, Neelima Gupta, Yogish Sabharwal:
Replica Placement on Directed Acyclic Graphs. FSTTCS 2014: 213-225 - [i1]Neelima Gupta, Shubham Gupta:
Approximation algorithms for Capacitated Facility Location Problem with Penalties. CoRR abs/1408.4944 (2014) - 2013
- [j11]Parvaneh Mansouri, Babak Asady, Neelima Gupta:
An approximation algorithm for fuzzy polynomial interpolation with Artificial Bee Colony algorithm. Appl. Soft Comput. 13(4): 1997-2002 (2013) - [j10]Neelima Gupta, Sandhya Aneja:
Discovering Minimum Exposed Path to Attack in Mobile Ad hoc Networks in optimal O(jPj) time after pre-processing. Int. J. Next Gener. Comput. 4(1) (2013) - [j9]Ankit Aggarwal, Anand Louis, Manisha Bansal, Naveen Garg, Neelima Gupta, Shubham Gupta, Surabhi Jain:
A 3-approximation algorithm for the facility location problem with uniform capacities. Math. Program. 141(1-2): 527-547 (2013) - [c23]Sonika Arora, Venkatesan T. Chakaravarthy, Neelima Gupta, Koyel Mukherjee, Yogish Sabharwal:
Replica Placement via Capacitated Vertex Cover. FSTTCS 2013: 263-274 - [c22]Anirudh Chakravorty, Neelima Gupta, Neha Lawaria, Pankaj Kumar, Yogish Sabharwal:
Algorithms for the relaxed Multiple-Organization Multiple-Machine Scheduling Problem. HiPC 2013: 30-38 - [c21]Geeta Aggarwal, Neelima Gupta:
BEMI Bicluster Ensemble Using Mutual Information. ICMLA (1) 2013: 321-324 - [c20]Geeta Aggarwal, Neelima Gupta:
BiETopti-BiClustering Ensemble Using Optimization Techniques. ICDM 2013: 181-192 - [c19]Rahul Johari, Neelima Gupta, Sandhya Aneja:
CACBR: context aware community based routing for intermittently connected network. PE-WASUN 2013: 137-140 - [c18]Rahul Johari, Neelima Gupta, Sandhya Aneja:
DSG-PC: Dynamic Social Grouping Based Routing for Non-uniform Buffer Capacities in DTN Supported with Periodic Carriers. QSHINE 2013: 1-15 - [c17]Parvaneh Mansouri, Babak Asady, Neelima Gupta:
Solve Shortest Paths Problem by Using Artificial Bee Colony Algorithm. SocProS (1) 2013: 183-191 - 2012
- [j8]Sandhya Aneja, Neelima Gupta:
Reliable Distance Vector routing protocol to handle Blackhole and Selfish (RDVBS) nodes in Ad hoc Networks. Int. J. Next Gener. Comput. 3(1) (2012) - [c16]Manisha Bansal, Naveen Garg, Neelima Gupta:
A 5-Approximation for Capacitated Facility Location. ESA 2012: 133-144 - [c15]Garima Gupta, Preeti Nagrath, Sandhya Aneja, Neelima Gupta:
Reference based approach to mitigate blackhole attacks in delay tolerant networks. Q2SWinet 2012: 85-88 - [c14]Parvaneh Mansouri, Babak Asady, Neelima Gupta:
The Combination of Bisection Method and Artificial Bee Colony Algorithm for Solving Hard Fix Point Problems. SOCO 2012: 33-41 - 2011
- [j7]Sandhya Khurana, Neelima Gupta:
End-to-end protocol to secure ad hoc networks against wormhole attacks. Secur. Commun. Networks 4(9): 994-1002 (2011) - [c13]Neelima Gupta, Aditya Pancholi, Yogish Sabharwal:
Clustering with Internal Connectedness. WALCOM 2011: 158-169 - 2010
- [j6]Neelima Gupta, Seema Aggarwal:
MIB: Using mutual information for biclustering gene expression data. Pattern Recognit. 43(8): 2692-2697 (2010) - [c12]Ankit Aggarwal, Anand Louis, Manisha Bansal, Naveen Garg, Neelima Gupta, Shubham Gupta, Surabhi Jain:
A 3-Approximation for Facility Location with Uniform Capacities. IPCO 2010: 149-162
2000 – 2009
- 2009
- [c11]Vasudha Bhatnagar, Sharanjit Kaur, Neelima Gupta:
Identifying Structures with Informative Dimensions in Streams. ACIS-ICIS 2009: 375-382 - 2008
- [c10]Neelima Gupta, Seema Aggarwal:
Mib: Using Mutual Information for Biclustering High Dimensional Data. IADIS European Conf. Data Mining 2008: 119-123 - [c9]Neelima Gupta, Seema Aggarwal:
Sisa: Seeded Iterative Signature Algorithm for Biclustering Gene Expression Data. IADIS European Conf. Data Mining 2008: 124-128 - [c8]Sandhya Khurana, Neelima Gupta:
FEEPVR: First End-to-End Protocol to Secure Ad Hoc Networks with Variable Ranges against Wormhole Attacks. SECURWARE 2008: 74-79 - 2007
- [j5]Neelima Gupta, Sumit Chopra:
Output-sensitive algorithms for optimally constructing the upper envelope of straight line segments in parallel. J. Parallel Distributed Comput. 67(7): 772-782 (2007) - [c7]Sandhya Khurana, Neelima Gupta, Nagender Aneja:
Minimum Exposed Path to the Attack (MEPA) in Mobile Ad Hoc Network (MANET). ICN 2007: 16 - 2006
- [c6]Sandhya Khurana, Neelima Gupta, Nagender Aneja:
Reliable Ad-hoc On-demand Distance Vector Routing Protocol. ICN/ICONS/MCL 2006: 98 - [c5]Ashwani Garg, Ashish Mangla, Neelima Gupta, Vasudha Bhatnagar:
PBIRCH: A Scalable Parallel Clustering algorithm for Incremental Data. IDEAS 2006: 315-316 - 2003
- [j4]Neelima Gupta, Sandeep Sen:
Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima. J. Parallel Distributed Comput. 63(4): 488-500 (2003) - 2001
- [j3]Neelima Gupta, Sandeep Sen:
An Efficient Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains. Algorithmica 31(2): 179-207 (2001) - [c4]Neelima Gupta, Sumit Chopra, Sandeep Sen:
Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel. FSTTCS 2001: 183-194
1990 – 1999
- 1999
- [j2]Sandeep Sen, Neelima Gupta:
Distribution-Sensitive Algorithms. Nord. J. Comput. 6(2): 194- (1999) - 1998
- [c3]Neelima Gupta, Sandeep Sen:
An Improved Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains. IPPS/SPDP 1998: 215-219 - [c2]Sandeep Sen, Neelima Gupta:
Distribution-Sensitive Algorithms. SWAT 1998: 335-346 - 1997
- [j1]Neelima Gupta, Sandeep Sen:
Optimal, Output-sensitive Algorithms for Constructing Planar Hulls in Parallel. Comput. Geom. 8: 151-166 (1997) - 1996
- [c1]Neelima Gupta, Sandeep Sen:
Faster Output-Sensitive Parallel Convex Hulls for d<=3: Optimal Sublogarithmic Algorithms for Small Outputs. SCG 1996: 176-185
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-11-05 20:58 CET 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:
