Year |
Citation |
Score |
2021 |
Chatterjee T, Albert R, Thapliyal S, Azarhooshang N, DasGupta B. Detecting network anomalies using Forman-Ricci curvature and a case study for human brain networks. Scientific Reports. 11: 8121. PMID 33854129 DOI: 10.1038/s41598-021-87587-z |
0.319 |
|
2020 |
Chatterjee T, DasGupta B, Palmieri L, Al-Qurashi Z, Sidiropoulos A. On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering Journal of Combinatorial Optimization. 40: 512-546. DOI: 10.1007/S10878-020-00589-X |
0.364 |
|
2020 |
DasGupta B, Janardhanan MV, Yahyanejad F. Why Did the Shape of Your Network Change? (On Detecting Network Anomalies via Non-local Curvatures) Algorithmica. 82: 1741-1783. DOI: 10.1007/S00453-019-00665-7 |
0.496 |
|
2019 |
Chatterjee T, DasGupta B, Mobasheri N, Srinivasan V, Yero IG. On the computational complexities of three problems related to a privacy measure for large networks under active attack Theoretical Computer Science. 775: 53-67. DOI: 10.1016/J.Tcs.2018.12.013 |
0.494 |
|
2019 |
DasGupta B, Mobasheri N, Yero IG. On analyzing and evaluating privacy measures for social networks under active attack Information Sciences. 473: 87-100. DOI: 10.1016/J.Ins.2018.09.023 |
0.468 |
|
2018 |
Ayala D, Wolfson O, Dasgupta B, Lin J, Xu B. Spatio-Temporal Matching for Urban Transportation Applications Acm Transactions On Spatial Algorithms and Systems. 3: 11. DOI: 10.1145/3183344 |
0.329 |
|
2017 |
Gunawan ADM, DasGupta B, Zhang L. A decomposition theorem and two algorithms for reticulation-visible networks Information & Computation. 252: 161-175. DOI: 10.1016/J.Ic.2016.11.001 |
0.475 |
|
2017 |
DasGupta B, Mobasheri N. On optimal approximability results for computing the strong metric dimension Discrete Applied Mathematics. 221: 18-24. DOI: 10.1016/J.Dam.2016.12.021 |
0.322 |
|
2014 |
Albert R, DasGupta B, Mobasheri N. Topological implications of negative curvature for biological and social networks. Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics. 89: 032811. PMID 24730903 DOI: 10.1103/Physreve.89.032811 |
0.476 |
|
2014 |
DasGupta B, Kaligounder L. On global stability of financial networks Journal of Complex Networks. 2: 313-354. DOI: 10.1093/Comnet/Cnu004 |
0.675 |
|
2014 |
Dasgupta B, Desai D. On a connection between small set expansions and modularity clustering Information Processing Letters. 114: 349-352. DOI: 10.1016/J.Ipl.2014.02.004 |
0.357 |
|
2014 |
Berman P, DasGupta B, Kaligounder L, Karpinski M. On the Computational Complexity of Measuring Global Stability of Banking Networks Algorithmica. 70: 595-647. DOI: 10.1007/S00453-013-9769-0 |
0.677 |
|
2014 |
Dasgupta B. Computational complexities of optimization problems related to model-based clustering of networks Optimization in Science and Engineering: in Honor of the 60th Birthday of Panos M. Pardalos. 97-113. DOI: 10.1007/978-1-4939-0808-0_5 |
0.301 |
|
2013 |
Albert R, DasGupta B, Mobasheri N. Some perspectives on network modeling in therapeutic target prediction. Biomedical Engineering and Computational Biology. 5: 17-24. PMID 25288898 DOI: 10.4137/Becb.S10793 |
0.386 |
|
2013 |
Aditya S, DasGupta B, Karpinski M. Algorithmic Perspectives of Network Transitive Reduction Problems and their Applications to Synthesis and Analysis of Biological Networks. Biology. 3: 1-21. PMID 24833332 DOI: 10.3390/Biology3010001 |
0.503 |
|
2013 |
Dasgupta B, Al-Mubaid H, Saeed F. Foreword to the special issue on selected papers from the 5th International Conference on Bioinformatics and Computational Biology (BICoB 2013). Journal of Bioinformatics and Computational Biology. 11: 1302002. PMID 24131048 DOI: 10.1142/S0219720013020022 |
0.319 |
|
2013 |
Dasgupta B, Desai D. On the complexity of Newman's community finding approach for biological and social networks Journal of Computer and System Sciences. 79: 50-67. DOI: 10.1016/J.Jcss.2012.04.003 |
0.357 |
|
2012 |
Comi M, Dasgupta B, Schapira M, Srinivasan V. On communication protocols that compute almost privately Theoretical Computer Science. 457: 45-58. DOI: 10.1016/J.Tcs.2012.07.008 |
0.317 |
|
2012 |
Chou CA, Chaovalitwongse WA, Berger-Wolf TY, Dasgupta B, Ashley MV. Capacitated clustering problem in computational biology: Combinatorial and statistical approach for sibling reconstruction Computers and Operations Research. 39: 609-619. DOI: 10.1016/J.Cor.2011.04.017 |
0.349 |
|
2011 |
Albert R, DasGupta B, Hegde R, Sivanathan GS, Gitter A, Gürsoy G, Paul P, Sontag E. Computationally efficient measure of topological redundancy of biological and social networks. Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics. 84: 036117. PMID 22060466 DOI: 10.1103/Physreve.84.036117 |
0.461 |
|
2010 |
Albert R, Dasgupta B, Sontag E. Inference of signal transduction networks from double causal evidence. Methods in Molecular Biology (Clifton, N.J.). 673: 239-51. PMID 20835804 DOI: 10.1007/978-1-60761-842-3_16 |
0.419 |
|
2010 |
Chaovalitwongse WA, Chou CA, Berger-Wolf TY, DasGupta B, Sheikh S, Ashley MV, Caballero IC. New optimization model and algorithm for sibling reconstruction from genetic markers Informs Journal On Computing. 22: 180-194. DOI: 10.1287/Ijoc.1090.0322 |
0.314 |
|
2010 |
ASHLEY MV, BERGER-WOLF TY, CHAOVALITWONGSE W, DASGUPTA B, KHOKHAR A, SHEIKH S. AN IMPLICIT COVER PROBLEM IN WILD POPULATION STUDY Discrete Mathematics, Algorithms and Applications. 2: 21-31. DOI: 10.1142/S1793830910000449 |
0.313 |
|
2009 |
Ashley M, Berger-Wolf T, Berman P, Chaovalitwongse W, DasGupta B, Kao MY. On approximating four covering and packing problems Journal of Computer and System Sciences. 75: 287-302. DOI: 10.1016/J.Jcss.2009.01.002 |
0.368 |
|
2008 |
Kachalo S, Zhang R, Sontag E, Albert R, DasGupta B. NET-SYNTHESIS: a software for synthesis, inference and simplification of signal transduction networks. Bioinformatics (Oxford, England). 24: 293-5. PMID 18033793 DOI: 10.1093/Bioinformatics/Btm571 |
0.434 |
|
2008 |
Berman P, DasGupta B. Approximating the online set multicover problems via randomized winnowing Theoretical Computer Science. 393: 54-71. DOI: 10.1016/J.Tcs.2007.10.047 |
0.349 |
|
2007 |
Berman P, Dasgupta B, Sontag E. Algorithmic issues in reverse engineering of protein and gene networks via the modular response analysis method. Annals of the New York Academy of Sciences. 1115: 132-41. PMID 17925351 DOI: 10.1196/Annals.1407.001 |
0.455 |
|
2007 |
Albert R, DasGupta B, Dondi R, Kachalo S, Sontag E, Zelikovsky A, Westbrooks K. A novel method for signal transduction network inference from indirect experimental evidence. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 14: 927-49. PMID 17803371 DOI: 10.1089/Cmb.2007.0015 |
0.457 |
|
2007 |
DasGupta B, Enciso GA, Sontag E, Zhang Y. Algorithmic and complexity results for decompositions of biological networks into monotone subsystems. Bio Systems. 90: 161-78. PMID 17188805 DOI: 10.1016/J.Biosystems.2006.08.001 |
0.439 |
|
2007 |
Chaovalitwongse WA, Berger-Wolf TY, Dasgupta B, Ashley MV. Set covering approach for reconstruction of sibling relationships Optimization Methods and Software. 22: 11-24. DOI: 10.1080/10556780600881829 |
0.334 |
|
2007 |
Berman P, DasGupta B, Kao M, Wang J. On constructing an optimal consensus clustering from multiple clusterings Information Processing Letters. 104: 137-145. DOI: 10.1016/J.Ipl.2007.06.008 |
0.303 |
|
2007 |
Berman P, DasGupta B, Mubayi D, Sloan R, Turán G, Zhang Y. The inverse protein folding problem on 2D and 3D lattices Discrete Applied Mathematics. 155: 719-732. DOI: 10.1016/J.Dam.2005.09.018 |
0.322 |
|
2007 |
Berman P, DasGupta B, Sontag E. Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks Discrete Applied Mathematics. 155: 733-749. DOI: 10.1016/J.Dam.2004.11.009 |
0.323 |
|
2007 |
Albert R, DasGupta B, Dondi R, Sontag E. Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs Algorithmica. 51: 129-159. DOI: 10.1007/S00453-007-9055-0 |
0.402 |
|
2006 |
Liu D, Xiong X, DasGupta B, Zhang H. Motif discoveries in unaligned molecular sequences using self-organizing neural networks. Ieee Transactions On Neural Networks / a Publication of the Ieee Neural Networks Council. 17: 919-28. PMID 16856655 DOI: 10.1109/Tnn.2006.875987 |
0.369 |
|
2006 |
DasGupta B, Hespanha JP, Riehl J, Sontag E. Honey-pot constrained searching with local sensory information Nonlinear Analysis, Theory, Methods and Applications. 65: 1773-1793. DOI: 10.1016/J.Na.2005.10.049 |
0.327 |
|
2005 |
Liu D, Xiong X, Hou ZG, Dasgupta B. Identification of motifs with insertions and deletions in protein sequences using self-organizing neural networks. Neural Networks : the Official Journal of the International Neural Network Society. 18: 835-42. PMID 16109474 DOI: 10.1016/J.Neunet.2005.06.007 |
0.42 |
|
2005 |
Berman P, DasGupta B, Kao M. Tight approximability results for test set problems in bioinformatics Journal of Computer and System Sciences. 71: 145-162. DOI: 10.1016/J.Jcss.2005.02.001 |
0.315 |
|
2004 |
Berman P, Bertone P, Dasgupta B, Gerstein M, Kao MY, Snyder M. Fast optimal genome tiling with applications to microarray design and homology search. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 11: 766-85. PMID 15579244 DOI: 10.1089/Cmb.2004.11.766 |
0.356 |
|
2003 |
Berman P, DasGupta B, Muthukrishnan S. Approximation algorithms for MAX-MIN tiling Journal of Algorithms. 47: 122-134. DOI: 10.1016/S0196-6774(03)00015-4 |
0.303 |
|
2002 |
Hwang FK, Yao YC, Dasgupta B. Some permutation routing algorithms for low-dimensional hypercubes Theoretical Computer Science. 270: 111-124. DOI: 10.1016/S0304-3975(00)00279-6 |
0.343 |
|
2001 |
Cheng X, Dasgupta B, Lu B. Polynomial Time Approximation Scheme for Symmetric Rectilinear Steiner Arborescence Problem Journal of Global Optimization. 21: 385-396. DOI: 10.1023/A:1012730702524 |
0.323 |
|
2001 |
Berman P, DasGupta B, Muthukrishnan S, Ramaswami S. Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles Journal of Algorithms. 41: 443-470. DOI: 10.1006/Jagm.2001.1188 |
0.32 |
|
2000 |
Berman P, Dasgupta B. Multi-phase algorithms for throughput maximization for real-time scheduling Journal of Combinatorial Optimization. 4: 307-323. DOI: 10.1023/A:1009822211065 |
0.346 |
|
1999 |
Dasgupta B, Palis MA. Provably Good Algorithms for Transmission Scheduling in WDM Optical Networks Journal of Parallel and Distributed Computing. 57: 345-357. DOI: 10.1006/Jpdc.1999.1542 |
0.363 |
|
1998 |
Dasgupta B, Jiang T, Kannan S, Li M, Sweedyk E. On the complexity and approximation of syntenic distance Discrete Applied Mathematics. 88: 59-82. DOI: 10.1016/S0166-218X(98)00066-3 |
0.308 |
|
1997 |
Berman P, DasGupta B. Complexities of efficient solutions of rectilinear polygon cover problems Algorithmica. 17: 331-356. DOI: 10.1007/Bf02523677 |
0.3 |
|
1996 |
DasGupta B, Schnitger G. Analog versus Discrete Neural Networks Neural Computation. 8: 805-818. PMID 8624961 DOI: 10.1162/Neco.1996.8.4.805 |
0.431 |
|
1995 |
Wood D, Dasgupta B. An Innovative Tool for Financial Decision Making: The Case of Artificial Neural Networks Creativity and Innovation Management. 4: 172-183. DOI: 10.1111/j.1467-8691.1995.tb00220.x |
0.339 |
|
1995 |
DasGupta B, Siegelmann HT, Sontag E. On the Complexity of Training Neural Networks with Continuous Activation Functions Ieee Transactions On Neural Networks. 6: 1490-1504. DOI: 10.1109/72.471360 |
0.452 |
|
1989 |
Dasgupta B, Madhavan CEV. An approximate algorithm for the minimal vertex nested polygon problem Information Processing Letters. 33: 35-44. DOI: 10.1016/0020-0190(89)90185-3 |
0.335 |
|
Show low-probability matches. |