Bhaskar DasGupta
According to our database^{1},
Bhaskar DasGupta
authored at least 107 papers
between 1989 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org
On csauthors.net:
Bibliography
2019
On the computational complexities of three problems related to a privacy measure for large networks under active attack.
Theor. Comput. Sci., 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
2018
SpatioTemporal Matching for Urban Transportation Applications.
ACM Trans. Spatial Algorithms and Systems, 2018
How did the shape of your network change? (On detecting anomalies in static and dynamic networks via change of nonlocal curvatures).
CoRR, 2018
Alleviating partisan gerrymandering: can math and computers help to eliminate wasted votes?
CoRR, 2018
Effect of GromovHyperbolicity 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
2017
A decomposition theorem and two algorithms for reticulationvisible networks.
Inf. Comput., 2017
On optimal approximability results for computing the strong metric dimension.
Discret. Appl. Math., 2017
2016
Nearest Neighbor Interchange and Related Distances.
Encyclopedia of Algorithms, 2016
Locating a Phylogenetic Tree in a ReticulationVisible 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 ReticulationVisible Network in Cubic Time.
Proceedings of the Research in Computational Molecular Biology  20th Annual Conference, 2016
2015
ColumnGeneration Framework of Nonlinear Similarity Model for Reconstructing Sibling Groups.
INFORMS Journal on Computing, 2015
Stability Implies Computational Tractability: Locating a Tree in a Stable Network is Easy.
CoRR, 2015
Node Expansions and Cuts in Gromovhyperbolic Graphs.
CoRR, 2015
2014
Merging Query Results From Local Search Engines for Georeferenced Objects.
TWEB, 2014
Foreword.
J. Bioinformatics and Computational Biology, 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
2013
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. Bioinformatics and Computational Biology, 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 Georeferenced objects.
Proceedings of the 29th IEEE International Conference on Data Engineering, 2013
2012
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
Spatiotemporal 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
2011
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) PrivacyPreserving Dissection Protocols
CoRR, 2011
Parking slot assignment games.
Proceedings of the 19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2011
2010
Combinatorial Reconstruction of HalfSibling Groups from Microsatellite Data.
J. Bioinformatics and Computational Biology, 2010
New Optimization Model and Algorithm for Sibling Reconstruction from Genetic Markers.
INFORMS Journal on Computing, 2010
An Implicit Cover Problem in wild Population Study.
Discrete Math., Alg. and Appl., 2010
On Approximate Horn Formula Minimization.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010
2009
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
2008
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
NETSYNTHESIS: a software for synthesis, inference and simplification of signal transduction networks.
Bioinformatics, 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 AsiaPacific Bioinformatics Conference, 2008
2007
Neural Networks.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
Set covering approach for reconstruction of sibling relationships.
Optimization Methods and Software, 2007
A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence.
Journal of Computational Biology, 2007
On constructing an optimal consensus clustering from multiple clusterings.
Inf. Process. Lett., 2007
Approximating Transitive Reductions for Directed Networks.
Electronic Colloquium on Computational Complexity (ECCC), 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 Bioinformatics, 2007
Algorithmic and complexity results for decompositions of biological networks into monotone subsystems.
Biosyst., 2007
Foreword.
Algorithmica, 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
2006
Motif discoveries in unaligned molecular sequences using selforganizing neural networks.
IEEE Trans. Neural Networks, 2006
Inapproximability results for the lateral gene transfer problem.
J. Comb. Optim., 2006
2005
On approximate learning by multilayered feedforward circuits.
Theor. Comput. Sci., 2005
Identification of motifs with insertions and deletions in protein sequences using selforganizing 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.
IJBRA, 2005
DNABAR: distinguisher selection for DNA barcoding.
Bioinformatics, 2005
2004
Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search.
Journal of Computational Biology, 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
2003
Approximation algorithms for MAXMIN tiling.
J. Algorithms, 2003
2002
Some permutation routing algorithms for lowdimensional hypercubes.
Theor. Comput. Sci., 2002
Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms.
SIAM J. Discrete Math., 2002
Simple approximation algorithm for nonoverlapping local alignments.
Proceedings of the Thirteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2002
Slice and dice: a simple, improved approximate tiling recipe.
Proceedings of the Thirteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2002
2001
A polynomialtime algorithm for checking equivalence under certain semiring congruences motivated by the statespace isomorphism problem for hybrid systems.
Theor. Comput. Sci., 2001
Polynomial Time Approximation Scheme for Symmetric Rectilinear Steiner Arborescence Problem.
J. Global Optimization, 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
2000
Multiphase Algorithms for Throughput Maximization for RealTime Scheduling.
J. Comb. Optim., 2000
Opportunity Cost Algorithms for Combinatorial Auctions
CoRR, 2000
Improvements in throughout maximization for realtime scheduling.
Proceedings of the ThirtySecond Annual ACM Symposium on Theory of Computing, 2000
Online realtime preemptive scheduling of jobs with deadlines.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000
1999
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 LinearCost SubtreeTransfer 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
1998
On the Complexity and Approximation of Syntenic Distance.
Discret. Appl. Math., 1998
1997
The Rectangle Enclosure and PointDominance Problems Revisited.
Int. J. Comput. Geometry 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 ACMSIAM Symposium on Discrete Algorithms, 1997
1996
Sample complexity for learning recurrent perceptron mappings.
IEEE Trans. Information Theory, 1996
Analog versus discrete neural networks.
Neural Computation, 1996
1995
On the complexity of training neural networks with continuous activation functions.
IEEE Trans. Neural Networks, 1995
1994
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
1992
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
1989
An Approximate Algorithm for the Minimal Vertex Nested Polygon Problem.
Inf. Process. Lett., 1989