default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBhaskar DasGupta
Person information
- affiliation: University of Illinois at Chicago, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j63]Abolfazl Asudeh
, Tanya Y. Berger-Wolf, Bhaskar DasGupta, Anastasios Sidiropoulos:
Maximizing Coverage While Ensuring Fairness: A Tale of Conflicting Objectives. Algorithmica 85(5): 1287-1331 (2023)- [j62]Bhaskar DasGupta, Elena Grigorescu, Tamalika Mukherjee:
On computing discretized Ricci curvatures of graphs: Local algorithms and (localized) fine-grained reductions. Theor. Comput. Sci. 975: 114127 (2023) - 2022
- [i32]Bhaskar DasGupta, Elena Grigorescu, Tamalika Mukherjee:
On computing Ollivier-Ricci curvatures of graphs: fine-grained reductions and local algorithms. CoRR abs/2208.09535 (2022) - 2020
- [j61]Bhaskar DasGupta, Mano Vikash Janardhanan, Farzane Yahyanejad:
Why Did the Shape of Your Network Change? (On Detecting Network Anomalies via Non-local Curvatures). Algorithmica 82(7): 1741-1783 (2020) - [j60]Tanima Chatterjee, Bhaskar DasGupta, Laura Palmieri, Zainab Al-Qurashi, Anastasios Sidiropoulos:
On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering. J. Comb. Optim. 40(2): 512-546 (2020) - [i31]Abolfazl Asudeh, Tanya Y. Berger-Wolf, Bhaskar DasGupta, Anastasios Sidiropoulos:
Maximizing coverage while ensuring fairness: a tale of conflicting objective. CoRR abs/2007.08069 (2020)
2010 – 2019
- 2019
- [j59]Bhaskar DasGupta, Nasim Mobasheri, Ismael González Yero:
On analyzing and evaluating privacy measures for social networks under active attack. Inf. Sci. 473: 87-100 (2019) - [j58]Farzane Yahyanejad, Réka Albert, Bhaskar DasGupta:
A survey of some tensor analysis techniques for biological systems. Quant. Biol. 7(4): 266-277 (2019) - [j57]Tanima Chatterjee, Bhaskar DasGupta, Nasim Mobasheri, Venkatkumar Srinivasan, Ismael González Yero:
On the computational complexities of three problems related to a privacy measure for large networks under active attack. Theor. Comput. Sci. 775: 53-67 (2019) - [i30]Tanima Chatterjee, Bhaskar DasGupta:
On partisan bias in redistricting: computational complexity meets the science of gerrymandering. CoRR abs/1910.01565 (2019) - 2018
- [j56]Bhaskar DasGupta, Marek Karpinski, Nasim Mobasheri, Farzane Yahyanejad:
Effect of Gromov-Hyperbolicity Parameter on Cuts and Expansions in Graphs and Some Algorithmic Implications. Algorithmica 80(2): 772-800 (2018) - [j55]Daniel Ayala, Ouri Wolfson, Bhaskar DasGupta, Jie Lin, Bo Xu:
Spatio-Temporal Matching for Urban Transportation Applications. ACM Trans. Spatial Algorithms Syst. 3(4): 11:1-11:39 (2018) - [c42]Bhaskar DasGupta:
Topological implications of negative curvature for biological networks. ICCABS 2018: 1 - [p2]Bhaskar DasGupta, Derong Liu, Hava T. Siegelmann:
Neural Networks. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 345-359 - [i29]Tanima Chatterjee, Bhaskar DasGupta, Laura Palmieri, Zainab Al-Qurashi, Anastasios Sidiropoulos:
Alleviating partisan gerrymandering: can math and computers help to eliminate wasted votes? CoRR abs/1804.10577 (2018) - [i28]Bhaskar DasGupta, Mano Vikash Janardhanan:
How did the shape of your network change? (On detecting anomalies in static and dynamic networks via change of non-local curvatures). CoRR abs/1808.05676 (2018) - [i27]Bhaskar DasGupta, Nasim Mobasheri, Ismael González Yero:
On analyzing and evaluating privacy measures for social networks under active attack. CoRR abs/1809.05926 (2018) - 2017
- [j54]Bhaskar DasGupta, Nasim Mobasheri:
On optimal approximability results for computing the strong metric dimension. Discret. Appl. Math. 221: 18-24 (2017) - [j53]Andreas D. M. Gunawan, Bhaskar DasGupta, Louxin Zhang:
A decomposition theorem and two algorithms for reticulation-visible networks. Inf. Comput. 252: 161-175 (2017) - 2016
- [c41]Andreas D. M. Gunawan, Bhaskar DasGupta, Louxin Zhang:
Locating a Tree in a Reticulation-Visible Network in Cubic Time. RECOMB 2016: 266 - [r3]Bhaskar DasGupta, Xin He, Ming Li, John Tromp, Louxin Zhang:
Nearest Neighbor Interchange and Related Distances. Encyclopedia of Algorithms 2016: 1402-1405 - [i26]Andreas D. M. Gunawan, Bhaskar DasGupta, Louxin Zhang:
Locating a Phylogenetic Tree in a Reticulation-Visible Network in Quadratic Time. CoRR abs/1603.08655 (2016) - [i25]Tanima Chatterjee, Bhaskar DasGupta, Nasim Mobasheri, Venkatkumar Srinivasan, Ismael González Yero:
On the Computational Complexities of Three Privacy Measures for Large Networks Under Active Attack. CoRR abs/1607.01438 (2016) - 2015
- [j52]Chun-An Chou, Zhe Liang, Wanpracha Art Chaovalitwongse, Tanya Y. Berger-Wolf, Bhaskar DasGupta, Saad I. Sheikh, Mary V. Ashley, Isabel C. Caballero:
Column-Generation Framework of Nonlinear Similarity Model for Reconstructing Sibling Groups. INFORMS J. Comput. 27(1): 35-47 (2015) - [i24]Andreas D. M. Gunawan, Bhaskar DasGupta, Louxin Zhang:
Stability Implies Computational Tractability: Locating a Tree in a Stable Network is Easy. CoRR abs/1507.02119 (2015) - [i23]Bhaskar DasGupta, Marek Karpinski, Nasim Mobasheri, Farzane Yahyanejad:
Node Expansions and Cuts in Gromov-hyperbolic Graphs. CoRR abs/1510.08779 (2015) - 2014
- [j51]Piotr Berman, Bhaskar DasGupta, Lakshmi Kaligounder, Marek Karpinski:
On the Computational Complexity of Measuring Global Stability of Banking Networks. Algorithmica 70(4): 595-647 (2014) - [j50]Bhaskar DasGupta, Lakshmi Kaligounder:
On global stability of financial networks. J. Complex Networks 2(3): 313-354 (2014) - [j49]Bhaskar DasGupta, Devendra Desai:
On a connection between small set expansions and modularity clustering. Inf. Process. Lett. 114(7): 349-352 (2014) - [j48]Fahad Saeed, Hisham Al-Mubaid, Bhaskar DasGupta:
Foreword. J. Bioinform. Comput. Biol. 12(5) (2014) - [j47]Eduard C. Dragut, Bhaskar DasGupta, Brian P. Beirne, Ali Neyestani, Badr Atassi, Clement T. Yu, Weiyi Meng:
Merging Query Results From Local Search Engines for Georeferenced Objects. ACM Trans. Web 8(4): 20:1-20:29 (2014) - [i22]Bhaskar DasGupta, Lakshmi Kaligounder:
Densely Entangled Financial Systems. CoRR abs/1402.5208 (2014) - [i21]Réka Albert, Bhaskar DasGupta, Nasim Mobasheri:
Topological implications of negative curvature for biological and social networks. CoRR abs/1403.1228 (2014) - [i20]Bhaskar DasGupta, Nasim Mobasheri:
On optimal approximability results for computing the strong metric dimension. CoRR abs/1408.1390 (2014) - 2013
- [j46]Bhaskar DasGupta, S. Muthukrishnan:
Stochastic Budget Optimization in Internet Advertising. Algorithmica 65(3): 634-661 (2013) - [j45]Bhaskar DasGupta, Hisham Al-Mubaid, Fahad Saeed:
Foreword to the Special Issue on Selected Papers from the 5th International Conference on Bioinformatics and Computational Biology (Bicob 2013). J. Bioinform. Comput. Biol. 11(5) (2013) - [j44]Bhaskar DasGupta, Devendra Desai:
On the complexity of Newman's community finding approach for biological and social networks. J. Comput. Syst. Sci. 79(1): 50-67 (2013) - [c40]Eduard Constantin Dragut, Brian P. Beirne, Ali Neyestani, Badr Atassi, Clement T. Yu, Bhaskar DasGupta, Weiyi Meng:
YumiInt - A deep Web integration system for local search engines for Geo-referenced objects. ICDE 2013: 1352-1355 - [i19]Réka Albert, Bhaskar DasGupta, Nasim Mobasheri:
Some Perspectives on Network Modeling in Therapeutic Target Prediction. CoRR abs/1307.7385 (2013) - [i18]Satabdi Aditya, Bhaskar DasGupta, Marek Karpinski:
Algorithmic Perspectives of Network Transitive Reduction Problems and their Applications to Synthesis and Analysis of Biological Networks. CoRR abs/1312.7306 (2013) - 2012
- [j43]Chun-An Chou, Wanpracha Art Chaovalitwongse, Tanya Y. Berger-Wolf, Bhaskar DasGupta, Mary V. Ashley:
Capacitated clustering problem in computational biology: Combinatorial and statistical approach for sibling reconstruction. Comput. Oper. Res. 39(3): 609-619 (2012) - [j42]Marco Comi, Bhaskar DasGupta, Michael Schapira, Venkatakumar Srinivasan:
On communication protocols that compute almost privately. Theor. Comput. Sci. 457: 45-58 (2012) - [c39]Daehan Won, Chun-An Chou, Wanpracha Art Chaovalitwongse, Tanya Y. Berger-Wolf, Bhaskar DasGupta, Ashfaq A. Khokhar, Marco Maggioni, Saad I. Sheikh, Mary V. Ashley, Jason Palagi:
An integrated optimization framework for inferring two generation kinships and parental genotypes from microsatellite samples. BCB 2012: 392-399 - [c38]Daniel Ayala, Ouri Wolfson, Bo Xu, Bhaskar DasGupta, Jie Lin:
Pricing of parking for congestion reduction. SIGSPATIAL/GIS 2012: 43-51 - [c37]Daniel Ayala, Ouri Wolfson, Bo Xu, Bhaskar DasGupta, Jie Lin:
Spatio-temporal matching algorithms for road networks. SIGSPATIAL/GIS 2012: 518-521 - [c36]Bhaskar DasGupta:
Models and Algorithmic Tools for Computational Processes in Cellular Biology: Recent Developments and Future Directions - (Invited Keynote Talk). ISBRA 2012: 84-86 - [c35]Daniel Ayala, Ouri Wolfson, Bo Xu, Bhaskar DasGupta, Jie Lin:
Parking in Competitive Settings: A Gravitational Approach. MDM 2012: 27-32 - [i17]Bhaskar DasGupta, Lakshmi Kaligounder:
Global Stability of Financial Networks Against Contagion: Measure, Evaluation and Implications. CoRR abs/1208.3789 (2012) - 2011
- [c34]Daniel Ayala, Ouri Wolfson, Bo Xu, Bhaskar DasGupta, Jie Lin:
Parking slot assignment games. GIS 2011: 299-308 - [c33]Marco Comi, Bhaskar DasGupta, Michael Schapira, Venkatakumar Srinivasan:
On Communication Protocols That Compute Almost Privately. SAGT 2011: 44-56 - [i16]Bhaskar DasGupta, Devendra Desai:
On the Complexity of Newman's Community Finding Approach for Biological and Social Networks. CoRR abs/1102.0969 (2011) - [i15]Mary V. Ashley, Tanya Y. Berger-Wolf, Piotr Berman, Wanpracha Art Chaovalitwongse, Bhaskar DasGupta, Ming-Yang Kao:
On Approximating Four Covering and Packing Problems. CoRR abs/1102.1006 (2011) - [i14]Marco Comi, Bhaskar DasGupta, Michael Schapira, Venkatakumar Srinivasan:
(Approximately) Privacy-Preserving Dissection Protocols. CoRR abs/1102.1443 (2011) - [i13]Piotr Berman, Bhaskar DasGupta:
Approximating the Online Set Multicover Problems Via Randomized Winnowing. CoRR abs/1102.4005 (2011) - [i12]Bhaskar DasGupta, Paola Vera-Licona, Eduardo D. Sontag:
Reverse Engineering of Molecular Networks from a Common Combinatorial Approach. CoRR abs/1102.4904 (2011) - [i11]Mary V. Ashley, Tanya Y. Berger-Wolf, Wanpracha Art Chaovalitwongse, Bhaskar DasGupta, Ashfaq A. Khokhar, Saad I. Sheikh:
An Implicit Cover Problem in Wild Population Study. CoRR abs/1102.5471 (2011) - [i10]Réka Albert, Bhaskar DasGupta, Anthony Gitter, Gamze Gürsoy, Rashmi Hegde, Pradyut Paul, Gowri Sangeetha Sivanathan, Eduardo D. Sontag:
A New Computationally Efficient Measure of Topological Redundancy of Biological and Social Networks. CoRR abs/1108.6113 (2011) - [i9]Piotr Berman, Bhaskar DasGupta, Lakshmi Kaligounder, Marek Karpinski:
On Systemic Stability of Banking Networks. CoRR abs/1110.3546 (2011) - [i8]Bhaskar DasGupta, Devendra Desai:
A Remark on a Connection Between Small Set Expansions and Modularity Clustering in Social Networks. CoRR abs/1111.3048 (2011) - 2010
- [j41]Mary V. Ashley, Tanya Y. Berger-Wolf, Wanpracha Art Chaovalitwongse, Bhaskar DasGupta, Ashfaq A. Khokhar, Saad I. Sheikh:
An Implicit Cover Problem in wild Population Study. Discret. Math. Algorithms Appl. 2(1): 21-32 (2010) - [j40]Wanpracha Art Chaovalitwongse, Chun-An Chou, Tanya Y. Berger-Wolf, Bhaskar DasGupta, Saad I. Sheikh, Mary V. Ashley, Isabel C. Caballero:
New Optimization Model and Algorithm for Sibling Reconstruction from Genetic Markers. INFORMS J. Comput. 22(2): 180-194 (2010) - [j39]Saad I. Sheikh, Tanya Y. Berger-Wolf, Ashfaq A. Khokhar, Isabel C. Caballero, Mary V. Ashley, Wanpracha Art Chaovalitwongse, Chun-An Chou, Bhaskar DasGupta:
Combinatorial Reconstruction of Half-Sibling Groups from Microsatellite Data. J. Bioinform. Comput. Biol. 8(2): 337-356 (2010) - [c32]Amitava Bhattacharya, Bhaskar DasGupta, Dhruv Mubayi, György Turán:
On Approximate Horn Formula Minimization. ICALP (1) 2010: 438-450 - [i7]Bhaskar DasGupta, S. Muthukrishnan:
Stochastic Budget Optimization in Internet Advertising. CoRR abs/1001.2735 (2010)
2000 – 2009
- 2009
- [j38]Mary V. Ashley, Tanya Y. Berger-Wolf, Piotr Berman, Wanpracha Art Chaovalitwongse, Bhaskar DasGupta, Ming-Yang Kao:
On approximating four covering and packing problems. J. Comput. Syst. Sci. 75(5): 287-302 (2009) - [c31]Mary V. Ashley, Tanya Y. Berger-Wolf, Wanpracha Art Chaovalitwongse, Bhaskar DasGupta, Ashfaq A. Khokhar, Saad I. Sheikh:
On Approximating an Implicit Cover Problem in Biology. AAIM 2009: 43-54 - [c30]Piotr Berman, Bhaskar DasGupta, Marek Karpinski:
Approximating Transitive Reductions for Directed Networks. WADS 2009: 74-85 - 2008
- [j37]Réka Albert, Bhaskar DasGupta, Riccardo Dondi, Eduardo D. Sontag:
Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs. Algorithmica 51(2): 129-159 (2008) - [j36]Sema Kachalo, Ranran Zhang, Eduardo D. Sontag, Réka Albert, Bhaskar DasGupta:
NET-SYNTHESIS: a software for synthesis, inference and simplification of signal transduction networks. Bioinform. 24(2): 293-295 (2008) - [j35]Piotr Berman, Bhaskar DasGupta:
Approximating the online set multicover problems via randomized winnowing. Theor. Comput. Sci. 393(1-3): 54-71 (2008) - [c29]Bhaskar DasGupta, Jin Jun, Ion I. Mandoiu:
Primer Selection Methods for Detection of Genomic Inversions and Deletions via PAMP. APBC 2008: 353-362 - [p1]Bhaskar DasGupta, Lusheng Wang:
Biology Computing. Wiley Encyclopedia of Computer Science and Engineering 2008 - [r2]Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp, Louxin Zhang:
Nearest Neighbor Interchange and Related Distances. Encyclopedia of Algorithms 2008 - [i6]Piotr Berman, Bhaskar DasGupta, Marek Karpinski:
Approximating Transitivity in Directed Networks. CoRR abs/0809.0188 (2008) - 2007
- [j34]Piotr Berman, Bhaskar DasGupta, Jie Liang:
Foreword. Algorithmica 48(4): 301 (2007) - [j33]Bhaskar DasGupta, Germán Andres Enciso, Eduardo D. Sontag, Yi Zhang:
Algorithmic and complexity results for decompositions of biological networks into monotone subsystems. Biosyst. 90(1): 161-178 (2007) - [j32]Joe Dundas, T. Andrew Binkowski, Bhaskar DasGupta, Jie Liang:
Topology independent protein structural alignment. BMC Bioinform. 8 (2007) - [j31]Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang:
The inverse protein folding problem on 2D and 3D lattices. Discret. Appl. Math. 155(6-7): 719-732 (2007) - [j30]Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag:
Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. Discret. Appl. Math. 155(6-7): 733-749 (2007) - [j29]Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao, Jie Wang:
On constructing an optimal consensus clustering from multiple clusterings. Inf. Process. Lett. 104(4): 137-145 (2007) - [j28]Réka Albert, Bhaskar DasGupta, Riccardo Dondi, Sema Kachalo, Eduardo D. Sontag, Alexander Zelikovsky, Kelly Westbrooks:
A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence. J. Comput. Biol. 14(7): 927-949 (2007) - [j27]W. Art Chaovalitwongse, Tanya Y. Berger-Wolf, Bhaskar DasGupta, Mary V. Ashley:
Set covering approach for reconstruction of sibling relationships. Optim. Methods Softw. 22(1): 11-24 (2007) - [c28]Tanya Y. Berger-Wolf, Saad I. Sheikh, Bhaskar DasGupta, Mary V. Ashley, Isabel C. Caballero, Wanpracha Art Chaovalitwongse, Satya Lahari Putrevu:
Reconstructing sibling relationships in wild populations. ISMB/ECCB (Supplement of Bioinformatics) 2007: 49-56 - [c27]Joe Dundas, T. Andrew Binkowski, Bhaskar DasGupta, Jie Liang:
Topology Independent Protein Structural Alignment. WABI 2007: 171-182 - [c26]Réka Albert, Bhaskar DasGupta, Riccardo Dondi, Sema Kachalo, Eduardo D. Sontag, Alexander Zelikovsky, Kelly Westbrooks:
A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence. WABI 2007: 407-419 - [r1]Hava T. Siegelmann, Bhaskar DasGupta, Derong Liu:
Neural Networks. Handbook of Approximation Algorithms and Metaheuristics 2007 - [i5]Piotr Berman, Bhaskar DasGupta:
Approximating the Online Set Multicover Problems Via Randomized Winnowing. Electron. Colloquium Comput. Complex. TR07 (2007) - [i4]Piotr Berman, Bhaskar DasGupta, Marek Karpinski:
Approximating Transitive Reductions for Directed Networks. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j26]Bhaskar DasGupta, Sergio Ferrarini, Uthra Gopalakrishnan, Nisha Raj Paryani:
Inapproximability results for the lateral gene transfer problem. J. Comb. Optim. 11(4): 387-405 (2006) - [j25]Derong Liu, Xiaoxu Xiong, Bhaskar DasGupta, Huaguang Zhang:
Motif discoveries in unaligned molecular sequences using self-organizing neural networks. IEEE Trans. Neural Networks 17(4): 919-928 (2006) - [c25]Bhaskar DasGupta, Germán Andres Enciso, Eduardo D. Sontag, Yi Zhang:
Algorithmic and Complexity Results for Decompositions of Biological Networks into Monotone Subsystems. WEA 2006: 253-264 - [i3]Réka Albert, Bhaskar DasGupta, Riccardo Dondi, Eduardo D. Sontag:
Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j24]Bhaskar DasGupta, Kishori M. Konwar, Ion I. Mandoiu, Alexander A. Shvartsman:
DNA-BAR: distinguisher selection for DNA barcoding. Bioinform. 21(16): 3424-3426 (2005) - [j23]Bhaskar DasGupta, Kishori M. Konwar, Ion I. Mandoiu, Alexander A. Shvartsman:
Highly scalable algorithms for robust string barcoding. Int. J. Bioinform. Res. Appl. 1(2): 145-161 (2005) - [j22]Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao:
Tight approximability results for test set problems in bioinformatics. J. Comput. Syst. Sci. 71(2): 145-162 (2005) - [j21]Derong Liu, Xiaoxu Xiong, Zeng-Guang Hou, Bhaskar DasGupta:
Identification of motifs with insertions and deletions in protein sequences using self-organizing neural networks. Neural Networks 18(5-6): 835-842 (2005) - [j20]Bhaskar DasGupta, Barbara Hammer:
On approximate learning by multi-layered feedforward circuits. Theor. Comput. Sci. 348(1): 95-127 (2005) - [c24]Bhaskar DasGupta, Kishori M. Konwar, Ion I. Mandoiu, Alexander A. Shvartsman:
Highly Scalable Algorithms for Robust String Barcoding. International Conference on Computational Science (2) 2005: 1020-1028 - [c23]Bhaskar DasGupta, Sergio Ferrarini, Uthra Gopalakrishnan, Nisha Raj Paryani:
Inapproximability Results for the Lateral Gene Transfer Problem. ICTCS 2005: 182-195 - [c22]Piotr Berman, Bhaskar DasGupta:
Approximating the Online Set Multicover Problems via Randomized Winnowing. WADS 2005: 110-121 - [i2]Bhaskar DasGupta, Kishori M. Konwar, Ion I. Mandoiu, Alexander A. Shvartsman:
Highly Scalable Algorithms for Robust String Barcoding. CoRR abs/cs/0502065 (2005) - 2004
- [j19]Madhuri Karnik, Bhaskar DasGupta, Vinayak Eswaran:
A comparative study of Dirichlet and Neumann conditions for path planning through harmonic functions. Future Gener. Comput. Syst. 20(3): 441-452 (2004) - [j18]Piotr Berman, Paul Bertone, Bhaskar DasGupta, Mark Gerstein, Ming-Yang Kao, Michael Snyder:
Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search. J. Comput. Biol. 11(4): 766-785 (2004) - [c21]Bhaskar DasGupta, João P. Hespanha, Eduardo D. Sontag:
Aggregation-based approaches to honey-pot searching with local sensory information. ACC 2004: 1202-1207 - [c20]Bhaskar DasGupta, João P. Hespanha, Eduardo D. Sontag:
Computational complexities of honey-pot searching with local sensory information. ACC 2004: 2134-2138 - [c19]Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag:
Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks. APPROX-RANDOM 2004: 39-50 - [c18]Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang:
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices. CPM 2004: 244-253 - [c17]Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao:
Tight Approximability Results for Test Set Problems in Bioinformatics. SWAT 2004: 39-50 - 2003
- [j17]Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan:
Approximation algorithms for MAX-MIN tiling. J. Algorithms 47(2): 122-134 (2003) - 2002
- [j16]Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan:
Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms. SIAM J. Discret. Math. 15(2): 252-267 (2002) - [j15]Frank K. Hwang, Yi-Ching Yao, Bhaskar DasGupta:
Some permutation routing algorithms for low-dimensional hypercubes. Theor. Comput. Sci. 270(1-2): 111-124 (2002) - [c16]Madhuri Karnik, Bhaskar DasGupta, Vinayak Eswaran:
A Comparative Study of Dirichlet and Neumann Conditions for Path Planning through Harmonic Functions. International Conference on Computational Science (2) 2002: 442-451 - [c15]Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan:
Slice and dice: a simple, improved approximate tiling recipe. SODA 2002: 455-464 - [c14]Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan:
Simple approximation algorithm for nonoverlapping local alignments. SODA 2002: 677-678 - [c13]Piotr Berman, Paul Bertone, Bhaskar DasGupta, Mark Gerstein, Ming-Yang Kao, Michael Snyder:
Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search. WABI 2002: 419-433 - 2001
- [j14]Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami:
Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles. J. Algorithms 41(2): 443-470 (2001) - [j13]Xiuzhen Cheng, Bhaskar DasGupta, Bing Lu:
Polynomial Time Approximation Scheme for Symmetric Rectilinear Steiner Arborescence Problem. J. Glob. Optim. 21(4): 385-396 (2001) - [j12]Bhaskar DasGupta, Eduardo D. Sontag:
A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems. Theor. Comput. Sci. 262(1): 161-189 (2001) - [c12]Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami:
Improved approximation algorithms for rectangle tiling and packing. SODA 2001: 427-436 - 2000
- [j11]Piotr Berman, Bhaskar DasGupta:
Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling. J. Comb. Optim. 4(3): 307-323 (2000) - [c11]Bhaskar DasGupta, Barbara Hammer:
On Approximate Learning by Multi-layered Feedforward Circuits. ALT 2000: 264-278 - [c10]Bhaskar DasGupta, Michael A. Palis:
Online real-time preemptive scheduling of jobs with deadlines. APPROX 2000: 96-107 - [c9]Piotr Berman, Bhaskar DasGupta:
Improvements in throughout maximization for real-time scheduling. STOC 2000: 680-687 - [i1]Karhan Akcoglu, James Aspnes, Bhaskar DasGupta, Ming-Yang Kao:
Opportunity Cost Algorithms for Combinatorial Auctions. CoRR cs.CE/0010031 (2000)
1990 – 1999
- 1999
- [j10]Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp:
On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees. Algorithmica 25(2-3): 176-195 (1999) - [j9]Gerard J. Chang, Bhaskar DasGupta, Wayne M. Dymàcek, Martin Fürer, Matthew Koerlin, Yueh-Shin Lee, Tom Whaley:
Characterizations of bipartite Steinhaus graphs. Discret. Math. 199(1-3): 11-25 (1999) - [j8]Bhaskar DasGupta, Michael A. Palis:
Provably Good Algorithms for Transmission Scheduling in WDM Optical Networks. J. Parallel Distributed Comput. 57(3): 345-357 (1999) - [c8]Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp, Louxin Zhang:
On computing the nearest neighbor interchange distance. Discrete Mathematical Problems with Medical Applications 1999: 125-143 - [c7]Bhaskar DasGupta, Sudip Dasgupta, Atal Chowdhury:
Generalized Approach towards the Fault Diagnosis in Any Arbitrarily Connected Networks. HiPC 1999: 404-410 - 1998
- [j7]Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming Li, Elizabeth Sweedyk:
On the Complexity and Approximation of Syntenic Distance. Discret. Appl. Math. 88(1-3): 59-82 (1998) - 1997
- [j6]Piotr Berman, Bhaskar DasGupta:
Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems. Algorithmica 17(4): 331-356 (1997) - [j5]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid, Bhaskar DasGupta:
The Rectangle Enclosure and Point-Dominance Problems Revisited. Int. J. Comput. Geom. Appl. 7(5): 437-455 (1997) - [c6]Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming Li, Z. Sweedyk:
On the complexity and approximation of syntenic distance. RECOMB 1997: 99-108 - [c5]Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp, Louxin Zhang:
On Distances between Phylogenetic Trees (Extended Abstract). SODA 1997: 427-436 - 1996
- [j4]Bhaskar DasGupta, Georg Schnitger:
Analog versus discrete neural networks. Neural Comput. 8(4): 805-818 (1996) - [j3]Bhaskar DasGupta, Eduardo D. Sontag:
Sample complexity for learning recurrent perceptron mappings. IEEE Trans. Inf. Theory 42(5): 1479-1487 (1996) - 1995
- [j2]Bhaskar DasGupta, Hava T. Siegelmann, Eduardo D. Sontag:
On the complexity of training neural networks with continuous activation functions. IEEE Trans. Neural Networks 6(6): 1490-1504 (1995) - [c4]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid, Bhaskar DasGupta:
The Rectangle Enclosure and Point-Dominance Problems Revisited. SCG 1995: 162-171 - [c3]Bhaskar DasGupta, Eduardo D. Sontag:
Sample Complexity for Learning Recurrent Perceptron Mappings. NIPS 1995: 204-210 - 1994
- [c2]Bhaskar DasGupta, Hava T. Siegelmann, Eduardo D. Sontag:
On a Learnability Question Associated to Neural Networks with Continuous Activations (Extended Abstract). COLT 1994: 47-56 - 1992
- [c1]Bhaskar DasGupta, Georg Schnitger:
The Power of Approximation: A Comparison of Activation Functions. NIPS 1992: 615-622
1980 – 1989
- 1989
- [j1]Bhaskar DasGupta, C. E. Veni Madhavan:
An Approximate Algorithm for the Minimal Vertex Nested Polygon Problem. Inf. Process. Lett. 33(1): 35-44 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
