Neelima Gupta

According to our database, Neelima Gupta authored at least 61 papers between 1996 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Capacitated Facility Location with Outliers and Uniform Facility Costs.

Rajni Dabas, Naveen Garg, Neelima Gupta

Proceedings of the Integer Programming and Combinatorial Optimization, 2024

2023

FPT Approximations for Capacitated/Fair Clustering with Outliers.

Rajni Dabas, Neelima Gupta, Tanmay Inamdar

CoRR, 2023

Scalable algorithms for compact spanners on real world graphs.

Maulein Pathak, Yogish Sabharwal, Neelima Gupta

Proceedings of the 37th International Conference on Supercomputing, 2023

2022

LP-based approximation for uniform capacitated facility location problem.

Sapna Grover, Neelima Gupta, Samir Khuller

Discret. Optim., 2022

Constant factor approximations for Lower and Upper bounded Clusterings.

Neelima Gupta, Sapna Grover, Rajni Dabas

CoRR, 2022

Locating Charging Stations: Connected, Capacitated and Prize- Collecting.

Rajni Dabas, Neelima Gupta

CoRR, 2022

Locating Service and Charging Stations.

Rajni Dabas, Naveen Garg, Neelima Gupta, Dilpreet Kaur

Proceedings of the Approximation and Online Algorithms - 20th International Workshop, 2022

Capacitated Facility Location with Outliers/Penalties.

Rajni Dabas, Neelima Gupta

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021

On Variants of Facility Location Problem with Outliers.

Rajni Dabas, Neelima Gupta

CoRR, 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

Respecting Lower Bounds in Uniform Lower and Upper Bounded Facility Location Problem.

Neelima Gupta, Sapna Grover, Rajni Dabas

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020

Uniform Capacitated Facility Location Problems with Penalties/Outliers.

Rajni Dabas, Neelima Gupta, Sapna Grover

CoRR, 2020

2018

Improved Local Search Based Approximation Algorithm for Hard Uniform Capacitated k-Median Problem.

Sapna Grover, Neelima Gupta, Aditya Pancholi

Informatica (Slovenia), 2018

Improved Local Search Based Approximation Algorithm for Hard Uniform Capacitated k-Median Problem.

Neelima Gupta, Aditya Pancholi

CoRR, 2018

Constant Factor Approximation Algorithm for Uniform Hard Capacitated Knapsack Median Problem.

Sapna Grover, Neelima Gupta, Samir Khuller, Aditya Pancholi

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

A 5-Approximation for Universal Facility Location.

Manisha Bansal, Naveen Garg, Neelima Gupta

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017

BiETopti: biclustering ensemble technique using optimisation.

Geeta Aggarwal, Neelima Gupta

Int. J. Bioinform. Res. Appl., 2017

Replica Placement on Bounded Treewidth Graphs.

Anshul Aggarwal, Venkatesan T. Chakaravarthy, Neelima Gupta, Yogish Sabharwal, Sachin Sharma, Sonika Thakral

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

2016

Experimental Evaluation of Routing Schemes for Intermittently Connected Wireless Mobile Networks.

Shri Rahul Johari, Neelima Gupta, Sandhya Aneja

Wirel. Pers. Commun., 2016

Protocols for mitigating blackhole attacks in delay tolerant networks.

Preeti Nagrath, Sandhya Aneja, Neelima Gupta, Sanjay Madria

Wirel. Networks, 2016

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

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

CONCOR: context-aware community-oriented routing for intermittently connected network.

Rahul Johari, Neelima Gupta, Sandhya Aneja

EURASIP J. Wirel. Commun. Netw., 2015

The Bisection-Artificial Bee Colony algorithm to solve Fixed point problems.

Parvaneh Mansouri, Babak Asady, Neelima Gupta

Appl. Soft Comput., 2015

Fast Algorithms for Constrained Graph Density Problems.

Venkatesan T. Chakaravarthy, Neelima Gupta, Aditya Pancholi, Sambuddha Roy

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

2014

Facility location with red-blue demands.

Sonika Arora, Neelima Gupta, Samir Khuller, Yogish Sabharwal, Swati Singhal

Oper. Res. Lett., 2014

Approximation algorithms for Capacitated Facility Location Problem with Penalties.

Neelima Gupta, Shubham Gupta

CoRR, 2014

Replica Placement on Directed Acyclic Graphs.

Sonika Arora, Venkatesan T. Chakaravarthy, Kanika Gupta, Neelima Gupta, Yogish Sabharwal

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013

A 3-approximation algorithm for the facility location problem with uniform capacities.

Ankit Aggarwal, Anand Louis, Manisha Bansal, Naveen Garg, Neelima Gupta, Shubham Gupta, Surabhi Jain

Math. Program., 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

An approximation algorithm for fuzzy polynomial interpolation with Artificial Bee Colony algorithm.

Parvaneh Mansouri, Babak Asady, Neelima Gupta

Appl. Soft Comput., 2013

Solve Shortest Paths Problem by Using Artificial Bee Colony Algorithm.

Parvaneh Mansouri, Babak Asady, Neelima Gupta

Proceedings of the Third International Conference on Soft Computing for Problem Solving, 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

Proceedings of the Quality, Reliability, Security and Robustness in Heterogeneous Networks, 2013

CACBR: context aware community based routing for intermittently connected network.

Rahul Johari, Neelima Gupta, Sandhya Aneja

Proceedings of the 10th ACM Symposium on Performance Evaluation of Wireless Ad Hoc, 2013

BiETopti-BiClustering Ensemble Using Optimization Techniques.

Geeta Aggarwal, Neelima Gupta

Proceedings of the Advances in Data Mining. Applications and Theoretical Aspects, 2013

BEMI Bicluster Ensemble Using Mutual Information.

Geeta Aggarwal, Neelima Gupta

Proceedings of the 12th International Conference on Machine Learning and Applications, 2013

Algorithms for the relaxed Multiple-Organization Multiple-Machine Scheduling Problem.

Anirudh Chakravorty, Neelima Gupta, Neha Lawaria, Pankaj Kumar, Yogish Sabharwal

Proceedings of the 20th Annual International Conference on High Performance Computing, 2013

Replica Placement via Capacitated Vertex Cover.

Sonika Arora, Venkatesan T. Chakaravarthy, Neelima Gupta, Koyel Mukherjee, Yogish Sabharwal

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

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

The Combination of Bisection Method and Artificial Bee Colony Algorithm for Solving Hard Fix Point Problems.

Parvaneh Mansouri, Babak Asady, Neelima Gupta

Proceedings of the Soft Computing Models in Industrial and Environmental Applications, 2012

Reference based approach to mitigate blackhole attacks in delay tolerant networks.

Garima Gupta, Preeti Nagrath, Sandhya Aneja, Neelima Gupta

Proceedings of the Q2SWinet'12, 2012

A 5-Approximation for Capacitated Facility Location.

Manisha Bansal, Naveen Garg, Neelima Gupta

Proceedings of the Algorithms - ESA 2012, 2012

2011

End-to-end protocol to secure <i>ad hoc</i> networks against wormhole attacks.

Sandhya Khurana, Neelima Gupta

Secur. Commun. Networks, 2011

Clustering with Internal Connectedness.

Neelima Gupta, Aditya Pancholi, Yogish Sabharwal

Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

2010

MIB: Using mutual information for biclustering gene expression data.

Neelima Gupta, Seema Aggarwal

Pattern Recognit., 2010

A 3-Approximation for Facility Location with Uniform Capacities.

Ankit Aggarwal, Anand Louis, Manisha Bansal, Naveen Garg, Neelima Gupta, Shubham Gupta, Surabhi Jain

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2009

Identifying Structures with Informative Dimensions in Streams.

Vasudha Bhatnagar, Sharanjit Kaur, Neelima Gupta

Proceedings of the 8th IEEE/ACIS International Conference on Computer and Information Science, 2009

2008

FEEPVR: First End-to-End Protocol to Secure Ad Hoc Networks with Variable Ranges against Wormhole Attacks.

Sandhya Khurana, Neelima Gupta

Proceedings of the Second International Conference on Emerging Security Information, 2008

Sisa: Seeded Iterative Signature Algorithm for Biclustering Gene Expression Data.

Neelima Gupta, Seema Aggarwal

Proceedings of the IADIS European Conference on Data Mining 2008, 2008

Mib: Using Mutual Information for Biclustering High Dimensional Data.

Neelima Gupta, Seema Aggarwal

Proceedings of the IADIS European Conference on Data Mining 2008, 2008

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

Minimum Exposed Path to the Attack (MEPA) in Mobile Ad Hoc Network (MANET).

Sandhya Khurana, Neelima Gupta, Nagender Aneja

Proceedings of the Sixth International Conference on Networking (ICN 2007), 2007

2006

PBIRCH: A Scalable Parallel Clustering algorithm for Incremental Data.

Ashwani Garg, Ashish Mangla, Neelima Gupta, Vasudha Bhatnagar

Proceedings of the Tenth International Database Engineering and Applications Symposium (IDEAS 2006), 2006

Reliable Ad-hoc On-demand Distance Vector Routing Protocol.

Sandhya Khurana, Neelima Gupta, Nagender Aneja

Proceedings of the Fifth International Conference on Networking and the International Conference on Systems (ICN / ICONS / MCL 2006), 2006

2003

Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima.

Neelima Gupta, Sandeep Sen

J. Parallel Distributed Comput., 2003

2001

An Efficient Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains.

Neelima Gupta, Sandeep Sen

Algorithmica, 2001

Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel.

Neelima Gupta, Sumit Chopra, Sandeep Sen

Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

1999

Distribution-Sensitive Algorithms.

Sandeep Sen, Neelima Gupta

Nord. J. Comput., 1999

1998

An Improved Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains.

Neelima Gupta, Sandeep Sen

Proceedings of the 12th International Parallel Processing Symposium / 9th Symposium on Parallel and Distributed Processing (IPPS/SPDP '98), March 30, 1998

1997

Optimal, Output-sensitive Algorithms for Constructing Planar Hulls in Parallel.

Neelima Gupta, Sandeep Sen

Comput. Geom., 1997

1996

Faster Output-Sensitive Parallel Convex Hulls for <i>d</i><=3: Optimal Sublogarithmic Algorithms for Small Outputs.

Neelima Gupta, Sandeep Sen

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996