Neelima Gupta

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 22

Top Topics

Facility Location

Bounded Treewidth

Constant Factor Approximation Algorithm

Top Venues

Publications

Rajni Dabas, Naveen Garg, Neelima Gupta
Capacitated Facility Location with Outliers and Uniform Facility Costs. IPCO (2024)
Maulein Pathak, Yogish Sabharwal, Neelima Gupta
Scalable algorithms for compact spanners on real world graphs. ICS (2023)
Rajni Dabas, Neelima Gupta, Tanmay Inamdar
FPT Approximations for Capacitated/Fair Clustering with Outliers. CoRR (2023)
Rajni Dabas, Naveen Garg, Neelima Gupta, Dilpreet Kaur
Locating Service and Charging Stations. WAOA (2022)
Sapna Grover, Neelima Gupta, Samir Khuller
LP-based approximation for uniform capacitated facility location problem. Discret. Optim. 45 (2022)
Rajni Dabas, Neelima Gupta
Locating Charging Stations: Connected, Capacitated and Prize- Collecting. CoRR (2022)
Rajni Dabas, Neelima Gupta
Capacitated Facility Location with Outliers/Penalties. COCOON (2022)
Neelima Gupta, Sapna Grover, Rajni Dabas
Constant factor approximations for Lower and Upper bounded Clusterings. CoRR (2022)
Rajni Dabas, Neelima Gupta
On Variants of Facility Location Problem with Outliers. CoRR (2021)
Neelima Gupta, Sapna Grover, Rajni Dabas
Respecting Lower Bounds in Uniform Lower and Upper Bounded Facility Location Problem. COCOON (2021)
Sapna Grover, Neelima Gupta, Rajni Dabas
First Approximation for Uniform Lower and Upper Bounded Facility Location Problem avoiding violation in Lower Bounds. CoRR (2021)
Rajni Dabas, Neelima Gupta, Sapna Grover
Uniform Capacitated Facility Location Problems with Penalties/Outliers. CoRR (2020)
Neelima Gupta, Aditya Pancholi
Improved Local Search Based Approximation Algorithm for Hard Uniform Capacitated k-Median Problem. CoRR (2018)
Sapna Grover, Neelima Gupta, Samir Khuller, Aditya Pancholi
Constant Factor Approximation Algorithm for Uniform Hard Capacitated Knapsack Median Problem. FSTTCS (2018)
Manisha Bansal, Naveen Garg, Neelima Gupta
A 5-Approximation for Universal Facility Location. FSTTCS (2018)
Sapna Grover, Neelima Gupta, Aditya Pancholi
Improved Local Search Based Approximation Algorithm for Hard Uniform Capacitated k-Median Problem. Informatica (Slovenia) 42 (3) (2018)
Geeta Aggarwal, Neelima Gupta
BiETopti: biclustering ensemble technique using optimisation. Int. J. Bioinform. Res. Appl. 13 (2) (2017)
Anshul Aggarwal, Venkatesan T. Chakaravarthy, Neelima Gupta, Yogish Sabharwal, Sachin Sharma, Sonika Thakral
Replica Placement on Bounded Treewidth Graphs. CoRR (2017)
Anshul Aggarwal, Venkatesan T. Chakaravarthy, Neelima Gupta, Yogish Sabharwal, Sachin Sharma, Sonika Thakral
Replica Placement on Bounded Treewidth Graphs. WADS (2017)
Preeti Nagrath, Sandhya Aneja, Neelima Gupta, Sanjay Madria
Protocols for mitigating blackhole attacks in delay tolerant networks. Wirel. Networks 22 (1) (2016)
Sapna Grover, Neelima Gupta, Dipti Kakkar
Constant factor Approximation Algorithms for Uniform Hard Capacitated Facility Location Problems: Natural LP is not too bad. CoRR (2016)
Shri Rahul Johari, Neelima Gupta, Sandhya Aneja
Experimental Evaluation of Routing Schemes for Intermittently Connected Wireless Mobile Networks. Wirel. Pers. Commun. 87 (3) (2016)
Rahul Johari, Neelima Gupta, Sandhya Aneja
CONCOR: context-aware community-oriented routing for intermittently connected network. EURASIP J. Wirel. Commun. Netw. 2015 (2015)
Venkatesan T. Chakaravarthy, Neelima Gupta, Aditya Pancholi, Sambuddha Roy
Fast Algorithms for Constrained Graph Density Problems. WALCOM (2015)
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 (2015)
Sonika Arora, Venkatesan T. Chakaravarthy, Kanika Gupta, Neelima Gupta, Yogish Sabharwal
Replica Placement on Directed Acyclic Graphs. FSTTCS (2014)
Sonika Arora, Neelima Gupta, Samir Khuller, Yogish Sabharwal, Swati Singhal
Facility location with red-blue demands. Oper. Res. Lett. 42 (6-7) (2014)
Neelima Gupta, Shubham Gupta
Approximation algorithms for Capacitated Facility Location Problem with Penalties. CoRR (2014)
Sonika Arora, Venkatesan T. Chakaravarthy, Neelima Gupta, Koyel Mukherjee, Yogish Sabharwal
Replica Placement via Capacitated Vertex Cover. FSTTCS (2013)
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)
Anirudh Chakravorty, Neelima Gupta, Neha Lawaria, Pankaj Kumar, Yogish Sabharwal
Algorithms for the relaxed Multiple-Organization Multiple-Machine Scheduling Problem. HiPC (2013)
Rahul Johari, Neelima Gupta, Sandhya Aneja
CACBR: context aware community based routing for intermittently connected network. PE-WASUN (2013)
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)
Geeta Aggarwal, Neelima Gupta
BiETopti-BiClustering Ensemble Using Optimization Techniques. ICDM (2013)
Geeta Aggarwal, Neelima Gupta
BEMI Bicluster Ensemble Using Mutual Information. ICMLA (1) (2013)
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) (2013)
Garima Gupta, Preeti Nagrath, Sandhya Aneja, Neelima Gupta
Reference based approach to mitigate blackhole attacks in delay tolerant networks. Q2SWinet (2012)
Manisha Bansal, Naveen Garg, Neelima Gupta
A 5-Approximation for Capacitated Facility Location. ESA (2012)
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)
Sandhya Khurana, Neelima Gupta
networks against wormhole attacks. Secur. Commun. Networks 4 (9) (2011)
Neelima Gupta, Aditya Pancholi, Yogish Sabharwal
Clustering with Internal Connectedness. WALCOM (2011)
Neelima Gupta, Seema Aggarwal
MIB: Using mutual information for biclustering gene expression data. Pattern Recognit. 43 (8) (2010)
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)
Vasudha Bhatnagar, Sharanjit Kaur, Neelima Gupta
Identifying Structures with Informative Dimensions in Streams. ACIS-ICIS (2009)
Sandhya Khurana, Neelima Gupta
FEEPVR: First End-to-End Protocol to Secure Ad Hoc Networks with Variable Ranges against Wormhole Attacks. SECURWARE (2008)
Neelima Gupta, Seema Aggarwal
Mib: Using Mutual Information for Biclustering High Dimensional Data. IADIS European Conf. Data Mining (2008)
Neelima Gupta, Seema Aggarwal
Sisa: Seeded Iterative Signature Algorithm for Biclustering Gene Expression Data. IADIS European Conf. Data Mining (2008)
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) (2007)
Sandhya Khurana, Neelima Gupta, Nagender Aneja
Minimum Exposed Path to the Attack (MEPA) in Mobile Ad Hoc Network (MANET). ICN (2007)
Ashwani Garg, Ashish Mangla, Neelima Gupta, Vasudha Bhatnagar
PBIRCH: A Scalable Parallel Clustering algorithm for Incremental Data. IDEAS (2006)
Sandhya Khurana, Neelima Gupta, Nagender Aneja
Reliable Ad-hoc On-demand Distance Vector Routing Protocol. ICN/ICONS/MCL (2006)
Neelima Gupta, Sandeep Sen
Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima. J. Parallel Distributed Comput. 63 (4) (2003)
Neelima Gupta, Sandeep Sen
An Efficient Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains. Algorithmica 31 (2) (2001)
Neelima Gupta, Sumit Chopra, Sandeep Sen
Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel. FSTTCS (2001)
Sandeep Sen, Neelima Gupta
Distribution-Sensitive Algorithms. Nord. J. Comput. 6 (2) (1999)
Neelima Gupta, Sandeep Sen
An Improved Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains. IPPS/SPDP (1998)
Sandeep Sen, Neelima Gupta
Distribution-Sensitive Algorithms. SWAT (1998)
Neelima Gupta, Sandeep Sen
Optimal, Output-sensitive Algorithms for Constructing Planar Hulls in Parallel. Comput. Geom. 8 (1997)
Neelima Gupta, Sandeep Sen
<=3: Optimal Sublogarithmic Algorithms for Small Outputs. SCG (1996)