Faster Output-Sensitive Parallel Convex Hulls for d<=3: Optimal Sublogarithmic Algorithms for Small Outputs. - Neelima Gupta; Sandeep Sen (SCG, 1996)

Optimal, Output-sensitive Algorithms for Constructing Planar Hulls in Parallel. - Neelima Gupta; Sandeep Sen (Comput. Geom., 1997)

An Improved Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains. - Neelima Gupta; Sandeep Sen (IPPS/SPDP, 1998)

Distribution-Sensitive Algorithms. - Sandeep Sen; Neelima Gupta (Nord. J. Comput., 1999)

Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel. - Neelima Gupta; Sumit Chopra; Sandeep Sen (FSTTCS, 2001)

An Efficient Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains. - Neelima Gupta; Sandeep Sen (Algorithmica, 2001)

Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima. - Neelima Gupta; Sandeep Sen (J. Parallel Distributed Comput., 2003)

Reliable Ad-hoc On-demand Distance Vector Routing Protocol. - Sandhya Khurana; Neelima Gupta; Nagender Aneja (ICN/ICONS/MCL, 2006)

PBIRCH: A Scalable Parallel Clustering algorithm for Incremental Data. - Ashwani Garg; Ashish Mangla; Neelima Gupta; Vasudha Bhatnagar (IDEAS, 2006)

Minimum Exposed Path to the Attack (MEPA) in Mobile Ad Hoc Network (MANET). - Sandhya Khurana; Neelima Gupta; Nagender Aneja (ICN, 2007)

Output-sensitive algorithms for optimally constructing the upper envelope of straight line segments in parallel. - Neelima Gupta; Sumit Chopra (J. Parallel Distributed Comput., 2007)

Mib: Using Mutual Information for Biclustering High Dimensional Data. - Neelima Gupta; Seema Aggarwal (IADIS European Conf. Data Mining, 2008)

Sisa: Seeded Iterative Signature Algorithm for Biclustering Gene Expression Data. - Neelima Gupta; Seema Aggarwal (IADIS European Conf. Data Mining, 2008)

FEEPVR: First End-to-End Protocol to Secure Ad Hoc Networks with Variable Ranges against Wormhole Attacks. - Sandhya Khurana; Neelima Gupta (SECURWARE, 2008)

Identifying Structures with Informative Dimensions in Streams. - Vasudha Bhatnagar; Sharanjit Kaur; Neelima Gupta (ACIS-ICIS, 2009)

A 3-Approximation for Facility Location with Uniform Capacities. - Ankit Aggarwal; Anand Louis; Manisha Bansal; Naveen Garg 001; Neelima Gupta; Shubham Gupta; Surabhi Jain (IPCO, 2010)

MIB: Using mutual information for biclustering gene expression data. - Neelima Gupta; Seema Aggarwal (Pattern Recognit., 2010)

Clustering with Internal Connectedness. - Neelima Gupta; Aditya Pancholi; Yogish Sabharwal (WALCOM, 2011)

End-to-end protocol to secure ad hoc networks against wormhole attacks. - Sandhya Khurana; Neelima Gupta (Secur. Commun. Networks, 2011)

A 5-Approximation for Capacitated Facility Location. - Manisha Bansal; Naveen Garg 001; Neelima Gupta (ESA, 2012)

Reference based approach to mitigate blackhole attacks in delay tolerant networks. - Garima Gupta; Preeti Nagrath; Sandhya Aneja; Neelima Gupta (Q2SWinet, 2012)

The Combination of Bisection Method and Artificial Bee Colony Algorithm for Solving Hard Fix Point Problems. - Parvaneh Mansouri; Babak Asady; Neelima Gupta (SOCO, 2012)

Reliable Distance Vector routing protocol to handle Blackhole and Selfish (RDVBS) nodes in Ad hoc Networks. - Sandhya Aneja; Neelima Gupta (Int. J. Next Gener. Comput., 2012)

Replica Placement via Capacitated Vertex Cover. - Sonika Arora; Venkatesan T. Chakaravarthy; Neelima Gupta; Koyel Mukherjee; Yogish Sabharwal (FSTTCS, 2013)

Algorithms for the relaxed Multiple-Organization Multiple-Machine Scheduling Problem. - Anirudh Chakravorty; Neelima Gupta; Neha Lawaria; Pankaj Kumar; Yogish Sabharwal (HiPC, 2013)

BEMI Bicluster Ensemble Using Mutual Information. - Geeta Aggarwal 001; Neelima Gupta (ICMLA (1), 2013)

BiETopti-BiClustering Ensemble Using Optimization Techniques. - Geeta Aggarwal 001; Neelima Gupta (ICDM, 2013)

CACBR: context aware community based routing for intermittently connected network. - Rahul Johari; Neelima Gupta; Sandhya Aneja (PE-WASUN, 2013)

DSG-PC: Dynamic Social Grouping Based Routing for Non-uniform Buffer Capacities in DTN Supported with Periodic Carriers. - Rahul Johari; Neelima Gupta; Sandhya Aneja (QSHINE, 2013)

Solve Shortest Paths Problem by Using Artificial Bee Colony Algorithm. - Parvaneh Mansouri; Babak Asady; Neelima Gupta (SocProS (1), 2013)

An approximation algorithm for fuzzy polynomial interpolation with Artificial Bee Colony algorithm. - Parvaneh Mansouri; Babak Asady; Neelima Gupta (Appl. Soft Comput., 2013)

Discovering Minimum Exposed Path to Attack in Mobile Ad hoc Networks in optimal O(jPj) time after pre-processing. - Neelima Gupta; Sandhya Aneja (Int. J. Next Gener. Comput., 2013)

A 3-approximation algorithm for the facility location problem with uniform capacities. - Ankit Aggarwal; Anand Louis; Manisha Bansal; Naveen Garg 001; Neelima Gupta; Shubham Gupta; Surabhi Jain (Math. Program., 2013)

Replica Placement on Directed Acyclic Graphs. - Sonika Arora; Venkatesan T. Chakaravarthy; Kanika Gupta; Neelima Gupta; Yogish Sabharwal (FSTTCS, 2014)

Approximation algorithms for Capacitated Facility Location Problem with Penalties. - Neelima Gupta; Shubham Gupta (CoRR, 2014)

Facility location with red-blue demands. - Sonika Arora; Neelima Gupta; Samir Khuller; Yogish Sabharwal; Swati Singhal (Oper. Res. Lett., 2014)

Fast Algorithms for Constrained Graph Density Problems. - Venkatesan T. Chakaravarthy; Neelima Gupta; Aditya Pancholi; Sambuddha Roy (WALCOM, 2015)

The Bisection-Artificial Bee Colony algorithm to solve Fixed point problems. - Parvaneh Mansouri; Babak Asady; Neelima Gupta (Appl. Soft Comput., 2015)

CONCOR: context-aware community-oriented routing for intermittently connected network. - Rahul Johari; Neelima Gupta; Sandhya Aneja (EURASIP J. Wirel. Commun. Netw., 2015)

POSOP Routing Algorithm: A DTN Routing Scheme for Information Connectivity of Health Centres in Hilly State of North India. - Rahul Johari; Neelima Gupta; Sandhya Aneja (Int. J. Distributed Sens. Networks, 2015)

Constant factor Approximation Algorithms for Uniform Hard Capacitated Facility Location Problems: Natural LP is not too bad. - Sapna Grover; Neelima Gupta; Dipti Kakkar (CoRR, 2016)

Protocols for mitigating blackhole attacks in delay tolerant networks. - Preeti Nagrath; Sandhya Aneja; Neelima Gupta; Sanjay Madria (Wirel. Networks, 2016)

Experimental Evaluation of Routing Schemes for Intermittently Connected Wireless Mobile Networks. - Shri Rahul Johari; Neelima Gupta; Sandhya Aneja (Wirel. Pers. Commun., 2016)

Replica Placement on Bounded Treewidth Graphs. - Anshul Aggarwal; Venkatesan T. Chakaravarthy; Neelima Gupta; Yogish Sabharwal; Sachin Sharma 002; Sonika Thakral (WADS, 2017)

BiETopti: biclustering ensemble technique using optimisation. - Geeta Aggarwal 001; Neelima Gupta (Int. J. Bioinform. Res. Appl., 2017)

A 5-Approximation for Universal Facility Location. - Manisha Bansal; Naveen Garg 001; Neelima Gupta (FSTTCS, 2018)

Constant Factor Approximation Algorithm for Uniform Hard Capacitated Knapsack Median Problem. - Sapna Grover; Neelima Gupta; Samir Khuller; Aditya Pancholi (FSTTCS, 2018)

Improved Local Search Based Approximation Algorithm for Hard Uniform Capacitated k-Median Problem. - Neelima Gupta; Aditya Pancholi (CoRR, 2018)

Improved Local Search Based Approximation Algorithm for Hard Uniform Capacitated k-Median Problem. - Sapna Grover; Neelima Gupta; Aditya Pancholi (Informatica (Slovenia), 2018)

Uniform Capacitated Facility Location Problems with Penalties/Outliers. - Rajni Dabas; Neelima Gupta; Sapna Grover (CoRR, 2020)

Respecting Lower Bounds in Uniform Lower and Upper Bounded Facility Location Problem. - Neelima Gupta; Sapna Grover; Rajni Dabas (COCOON, 2021)

First Approximation for Uniform Lower and Upper Bounded Facility Location Problem avoiding violation in Lower Bounds. - Sapna Grover; Neelima Gupta; Rajni Dabas (CoRR, 2021)

On Variants of Facility Location Problem with Outliers. - Rajni Dabas; Neelima Gupta (CoRR, 2021)

Capacitated Facility Location with Outliers/Penalties. - Rajni Dabas; Neelima Gupta (COCOON, 2022)

Locating Service and Charging Stations. - Rajni Dabas; Naveen Garg 001; Neelima Gupta; Dilpreet Kaur (WAOA, 2022)

Locating Charging Stations: Connected, Capacitated and Prize- Collecting. - Rajni Dabas; Neelima Gupta (CoRR, 2022)

Constant factor approximations for Lower and Upper bounded Clusterings. - Neelima Gupta; Sapna Grover; Rajni Dabas (CoRR, 2022)

LP-based approximation for uniform capacitated facility location problem. - Sapna Grover; Neelima Gupta; Samir Khuller (Discret. Optim., 2022)

Scalable algorithms for compact spanners on real world graphs. - Maulein Pathak; Yogish Sabharwal; Neelima Gupta (ICS, 2023)

Online Dynamic Path Planner for UAVs. - Manisha Wadhwa; Neelima Gupta; Sanjay Madria (MobiQuitous (2), 2023)

FPT Approximations for Capacitated/Fair Clustering with Outliers. - Rajni Dabas; Neelima Gupta; Tanmay Inamdar 002 (CoRR, 2023)

Evaluating the Influence of Graph Characteristics on Parallel Algorithms for Derived Graph Structures. - Maulein Pathak; Samarth Kapila; Yogish Sabharwal; Neelima Gupta (HIPCW, 2024)

Spanners in Hypergraphs. - Maulein Pathak; Yogish Sabharwal; Neelima Gupta (HIPCW, 2024)

Capacitated Facility Location with Outliers and Uniform Facility Costs. - Rajni Dabas; Naveen Garg 001; Neelima Gupta (IPCO, 2024)

Uniform capacitated facility location with outliers/penalties. - Rajni Dabas; Neelima Gupta (Discret. Optim., 2025)

FPT approximation for capacitated clustering with outliers. - Rajni Dabas; Neelima Gupta; Tanmay Inamdar 002 (Theor. Comput. Sci., 2025)