Bhaskar DasGupta

  • University of Illinois at Chicago, USA

According to our database1, Bhaskar DasGupta authored at least 112 papers between 1989 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:



On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering.
J. Comb. Optim., 2020

Maximizing coverage while ensuring fairness: a tale of conflicting objective.
CoRR, 2020

Why Did the Shape of Your Network Change? (On Detecting Network Anomalies via Non-local Curvatures).
Algorithmica, 2020

On the computational complexities of three problems related to a privacy measure for large networks under active attack.
Theor. Comput. Sci., 2019

A survey of some tensor analysis techniques for biological systems.
Quant. Biol., 2019

On analyzing and evaluating privacy measures for social networks under active attack.
Inf. Sci., 2019

On partisan bias in redistricting: computational complexity meets the science of gerrymandering.
CoRR, 2019

Spatio-Temporal Matching for Urban Transportation Applications.
ACM Trans. Spatial Algorithms Syst., 2018

How did the shape of your network change? (On detecting anomalies in static and dynamic networks via change of non-local curvatures).
CoRR, 2018

Alleviating partisan gerrymandering: can math and computers help to eliminate wasted votes?
CoRR, 2018

Effect of Gromov-Hyperbolicity Parameter on Cuts and Expansions in Graphs and Some Algorithmic Implications.
Algorithmica, 2018

Topological implications of negative curvature for biological networks.
Proceedings of the 8th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2018

Neural Networks.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

A decomposition theorem and two algorithms for reticulation-visible networks.
Inf. Comput., 2017

On optimal approximability results for computing the strong metric dimension.
Discret. Appl. Math., 2017

Nearest Neighbor Interchange and Related Distances.
Encyclopedia of Algorithms, 2016

Locating a Phylogenetic Tree in a Reticulation-Visible Network in Quadratic Time.
CoRR, 2016

On the Computational Complexities of Three Privacy Measures for Large Networks Under Active Attack.
CoRR, 2016

Locating a Tree in a Reticulation-Visible Network in Cubic Time.
Proceedings of the Research in Computational Molecular Biology - 20th Annual Conference, 2016

Column-Generation Framework of Nonlinear Similarity Model for Reconstructing Sibling Groups.
INFORMS J. Comput., 2015

Stability Implies Computational Tractability: Locating a Tree in a Stable Network is Easy.
CoRR, 2015

Node Expansions and Cuts in Gromov-hyperbolic Graphs.
CoRR, 2015

Merging Query Results From Local Search Engines for Georeferenced Objects.
ACM Trans. Web, 2014

J. Bioinform. Comput. Biol., 2014

On a connection between small set expansions and modularity clustering.
Inf. Process. Lett., 2014

Densely Entangled Financial Systems.
CoRR, 2014

Topological implications of negative curvature for biological and social networks.
CoRR, 2014

On global stability of financial networks.
J. Complex Networks, 2014

On the Computational Complexity of Measuring Global Stability of Banking Networks.
Algorithmica, 2014

On the complexity of Newman's community finding approach for biological and social networks.
J. Comput. Syst. Sci., 2013

Foreword to the Special Issue on Selected Papers from the 5th International Conference on Bioinformatics and Computational Biology (Bicob 2013).
J. Bioinform. Comput. Biol., 2013

Some Perspectives on Network Modeling in Therapeutic Target Prediction.
CoRR, 2013

Algorithmic Perspectives of Network Transitive Reduction Problems and their Applications to Synthesis and Analysis of Biological Networks.
CoRR, 2013

Stochastic Budget Optimization in Internet Advertising.
Algorithmica, 2013

YumiInt - A deep Web integration system for local search engines for Geo-referenced objects.
Proceedings of the 29th IEEE International Conference on Data Engineering, 2013

On communication protocols that compute almost privately.
Theor. Comput. Sci., 2012

Global Stability of Financial Networks Against Contagion: Measure, Evaluation and Implications
CoRR, 2012

Capacitated clustering problem in computational biology: Combinatorial and statistical approach for sibling reconstruction.
Comput. Oper. Res., 2012

Parking in Competitive Settings: A Gravitational Approach.
Proceedings of the 13th IEEE International Conference on Mobile Data Management, 2012

Models and Algorithmic Tools for Computational Processes in Cellular Biology: Recent Developments and Future Directions - (Invited Keynote Talk).
Proceedings of the Bioinformatics Research and Applications - 8th International Symposium, 2012

Spatio-temporal matching algorithms for road networks.
Proceedings of the SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), 2012

Pricing of parking for congestion reduction.
Proceedings of the SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), 2012

An integrated optimization framework for inferring two generation kinships and parental genotypes from microsatellite samples.
Proceedings of the ACM International Conference on Bioinformatics, 2012

A Remark on a Connection Between Small Set Expansions and Modularity Clustering in Social Networks
CoRR, 2011

On Systemic Stability of Banking Networks
CoRR, 2011

A New Computationally Efficient Measure of Topological Redundancy of Biological and Social Networks
CoRR, 2011

Reverse Engineering of Molecular Networks from a Common Combinatorial Approach
CoRR, 2011

(Approximately) Privacy-Preserving Dissection Protocols
CoRR, 2011

Parking slot assignment games.
Proceedings of the 19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2011

Combinatorial Reconstruction of Half-Sibling Groups from Microsatellite Data.
J. Bioinform. Comput. Biol., 2010

New Optimization Model and Algorithm for Sibling Reconstruction from Genetic Markers.
INFORMS J. Comput., 2010

An Implicit Cover Problem in wild Population Study.
Discret. Math. Algorithms Appl., 2010

On Approximate Horn Formula Minimization.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

On approximating four covering and packing problems.
J. Comput. Syst. Sci., 2009

On Approximating an Implicit Cover Problem in Biology.
Proceedings of the Algorithmic Aspects in Information and Management, 2009

Biology Computing.
Proceedings of the Wiley Encyclopedia of Computer Science and Engineering, 2008

Nearest Neighbor Interchange and Related Distances.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Approximating the online set multicover problems via randomized winnowing.
Theor. Comput. Sci., 2008

Approximating Transitivity in Directed Networks
CoRR, 2008

NET-SYNTHESIS: a software for synthesis, inference and simplification of signal transduction networks.
Bioinform., 2008

Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs.
Algorithmica, 2008

Primer Selection Methods for Detection of Genomic Inversions and Deletions via PAMP.
Proceedings of the 6th Asia-Pacific Bioinformatics Conference, 2008

Neural Networks.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Set covering approach for reconstruction of sibling relationships.
Optim. Methods Softw., 2007

A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence.
J. Comput. Biol., 2007

On constructing an optimal consensus clustering from multiple clusterings.
Inf. Process. Lett., 2007

Approximating Transitive Reductions for Directed Networks.
Electron. Colloquium Comput. Complex., 2007

Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks.
Discret. Appl. Math., 2007

The inverse protein folding problem on 2D and 3D lattices.
Discret. Appl. Math., 2007

Topology independent protein structural alignment.
BMC Bioinform., 2007

Algorithmic and complexity results for decompositions of biological networks into monotone subsystems.
Biosyst., 2007

Algorithmica, 2007

Topology Independent Protein Structural Alignment.
Proceedings of the Algorithms in Bioinformatics, 7th International Workshop, 2007

Reconstructing sibling relationships in wild populations.
Proceedings of the Proceedings 15th International Conference on Intelligent Systems for Molecular Biology (ISMB) & 6th European Conference on Computational Biology (ECCB), 2007

Motif discoveries in unaligned molecular sequences using self-organizing neural networks.
IEEE Trans. Neural Networks, 2006

Inapproximability results for the lateral gene transfer problem.
J. Comb. Optim., 2006

On approximate learning by multi-layered feedforward circuits.
Theor. Comput. Sci., 2005

Identification of motifs with insertions and deletions in protein sequences using self-organizing neural networks.
Neural Networks, 2005

Tight approximability results for test set problems in bioinformatics.
J. Comput. Syst. Sci., 2005

Highly scalable algorithms for robust string barcoding.
Int. J. Bioinform. Res. Appl., 2005

DNA-BAR: distinguisher selection for DNA barcoding.
Bioinform., 2005

Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search.
J. Comput. Biol., 2004

A comparative study of Dirichlet and Neumann conditions for path planning through harmonic functions.
Future Gener. Comput. Syst., 2004

The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices.
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

Approximation algorithms for MAX-MIN tiling.
J. Algorithms, 2003

Some permutation routing algorithms for low-dimensional hypercubes.
Theor. Comput. Sci., 2002

Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms.
SIAM J. Discret. Math., 2002

Simple approximation algorithm for nonoverlapping local alignments.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Slice and dice: a simple, improved approximate tiling recipe.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems.
Theor. Comput. Sci., 2001

Polynomial Time Approximation Scheme for Symmetric Rectilinear Steiner Arborescence Problem.
J. Glob. Optim., 2001

Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles.
J. Algorithms, 2001

Improved approximation algorithms for rectangle tiling and packing.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling.
J. Comb. Optim., 2000

Opportunity Cost Algorithms for Combinatorial Auctions
CoRR, 2000

Improvements in throughout maximization for real-time scheduling.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Online real-time preemptive scheduling of jobs with deadlines.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000

Provably Good Algorithms for Transmission Scheduling in WDM Optical Networks.
J. Parallel Distributed Comput., 1999

Characterizations of bipartite Steinhaus graphs.
Discret. Math., 1999

On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees.
Algorithmica, 1999

Generalized Approach towards the Fault Diagnosis in Any Arbitrarily Connected Networks.
Proceedings of the High Performance Computing, 1999

On computing the nearest neighbor interchange distance.
Proceedings of the Discrete Mathematical Problems with Medical Applications, 1999

On the Complexity and Approximation of Syntenic Distance.
Discret. Appl. Math., 1998

The Rectangle Enclosure and Point-Dominance Problems Revisited.
Int. J. Comput. Geom. Appl., 1997

Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems.
Algorithmica, 1997

On Distances between Phylogenetic Trees (Extended Abstract).
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Sample complexity for learning recurrent perceptron mappings.
IEEE Trans. Inf. Theory, 1996

Analog versus discrete neural networks.
Neural Comput., 1996

On the complexity of training neural networks with continuous activation functions.
IEEE Trans. Neural Networks, 1995

On a Learnability Question Associated to Neural Networks with Continuous Activations (Extended Abstract).
Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 1994

The Power of Approximation: A Comparison of Activation Functions.
Proceedings of the Advances in Neural Information Processing Systems 5, [NIPS Conference, Denver, Colorado, USA, November 30, 1992

An Approximate Algorithm for the Minimal Vertex Nested Polygon Problem.
Inf. Process. Lett., 1989