Neelima Gupta

Orcid: 0000-0002-0870-0824

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Capacitated Facility Location with Outliers and Uniform Facility Costs.
Proceedings of the Integer Programming and Combinatorial Optimization, 2024

2023
FPT Approximations for Capacitated/Fair Clustering with Outliers.
CoRR, 2023

Scalable algorithms for compact spanners on real world graphs.
Proceedings of the 37th International Conference on Supercomputing, 2023

2022
LP-based approximation for uniform capacitated facility location problem.
Discret. Optim., 2022

Constant factor approximations for Lower and Upper bounded Clusterings.
CoRR, 2022

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

Locating Service and Charging Stations.
Proceedings of the Approximation and Online Algorithms - 20th International Workshop, 2022

Capacitated Facility Location with Outliers/Penalties.
Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021
On Variants of Facility Location Problem with Outliers.
CoRR, 2021

First Approximation for Uniform Lower and Upper Bounded Facility Location Problem avoiding violation in Lower Bounds.
CoRR, 2021

Respecting Lower Bounds in Uniform Lower and Upper Bounded Facility Location Problem.
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020
Uniform Capacitated Facility Location Problems with Penalties/Outliers.
CoRR, 2020

2018
Improved Local Search Based Approximation Algorithm for Hard Uniform Capacitated k-Median Problem.
Informatica (Slovenia), 2018

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

Constant Factor Approximation Algorithm for Uniform Hard Capacitated Knapsack Median Problem.
Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

A 5-Approximation for Universal Facility Location.
Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017
BiETopti: biclustering ensemble technique using optimisation.
Int. J. Bioinform. Res. Appl., 2017

Replica Placement on Bounded Treewidth Graphs.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

2016
Experimental Evaluation of Routing Schemes for Intermittently Connected Wireless Mobile Networks.
Wirel. Pers. Commun., 2016

Protocols for mitigating blackhole attacks in delay tolerant networks.
Wirel. Networks, 2016

Constant factor Approximation Algorithms for Uniform Hard Capacitated Facility Location Problems: Natural LP is not too bad.
CoRR, 2016

2015
POSOP Routing Algorithm: A DTN Routing Scheme for Information Connectivity of Health Centres in Hilly State of North India.
Int. J. Distributed Sens. Networks, 2015

CONCOR: context-aware community-oriented routing for intermittently connected network.
EURASIP J. Wirel. Commun. Netw., 2015

The Bisection-Artificial Bee Colony algorithm to solve Fixed point problems.
Appl. Soft Comput., 2015

Fast Algorithms for Constrained Graph Density Problems.
Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

2014
Facility location with red-blue demands.
Oper. Res. Lett., 2014

Approximation algorithms for Capacitated Facility Location Problem with Penalties.
CoRR, 2014

Replica Placement on Directed Acyclic Graphs.
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.
Math. Program., 2013

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

An approximation algorithm for fuzzy polynomial interpolation with Artificial Bee Colony algorithm.
Appl. Soft Comput., 2013

Solve Shortest Paths Problem by Using Artificial Bee Colony Algorithm.
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.
Proceedings of the Quality, Reliability, Security and Robustness in Heterogeneous Networks, 2013

CACBR: context aware community based routing for intermittently connected network.
Proceedings of the 10th ACM Symposium on Performance Evaluation of Wireless Ad Hoc, 2013

BiETopti-BiClustering Ensemble Using Optimization Techniques.
Proceedings of the Advances in Data Mining. Applications and Theoretical Aspects, 2013

BEMI Bicluster Ensemble Using Mutual Information.
Proceedings of the 12th International Conference on Machine Learning and Applications, 2013

Algorithms for the relaxed Multiple-Organization Multiple-Machine Scheduling Problem.
Proceedings of the 20th Annual International Conference on High Performance Computing, 2013

Replica Placement via Capacitated Vertex Cover.
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.
Int. J. Next Gener. Comput., 2012

The Combination of Bisection Method and Artificial Bee Colony Algorithm for Solving Hard Fix Point Problems.
Proceedings of the Soft Computing Models in Industrial and Environmental Applications, 2012

Reference based approach to mitigate blackhole attacks in delay tolerant networks.
Proceedings of the Q2SWinet'12, 2012

A 5-Approximation for Capacitated Facility Location.
Proceedings of the Algorithms - ESA 2012, 2012

2011
End-to-end protocol to secure <i>ad hoc</i> networks against wormhole attacks.
Secur. Commun. Networks, 2011

Clustering with Internal Connectedness.
Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

2010
MIB: Using mutual information for biclustering gene expression data.
Pattern Recognit., 2010

A 3-Approximation for Facility Location with Uniform Capacities.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2009
Identifying Structures with Informative Dimensions in Streams.
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.
Proceedings of the Second International Conference on Emerging Security Information, 2008

Sisa: Seeded Iterative Signature Algorithm for Biclustering Gene Expression Data.
Proceedings of the IADIS European Conference on Data Mining 2008, 2008

Mib: Using Mutual Information for Biclustering High Dimensional Data.
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.
J. Parallel Distributed Comput., 2007

Minimum Exposed Path to the Attack (MEPA) in Mobile Ad Hoc Network (MANET).
Proceedings of the Sixth International Conference on Networking (ICN 2007), 2007

2006
PBIRCH: A Scalable Parallel Clustering algorithm for Incremental Data.
Proceedings of the Tenth International Database Engineering and Applications Symposium (IDEAS 2006), 2006

Reliable Ad-hoc On-demand Distance Vector Routing Protocol.
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.
J. Parallel Distributed Comput., 2003

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

Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel.
Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

1999
Distribution-Sensitive Algorithms.
Nord. J. Comput., 1999

1998
An Improved Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains.
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.
Comput. Geom., 1997

1996
Faster Output-Sensitive Parallel Convex Hulls for <i>d</i><=3: Optimal Sublogarithmic Algorithms for Small Outputs.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996


  Loading...