List of Publications of Bhaskar DasGupta

List of Publications

Below is a list of most of my publications in reverse chronological order.

These files are in pdf format. They can be read via the free acrobat reader software. If you do not have this software installed already in your system, you can download it free from the Adobe Acrobat website.

Note: many of these publications are copyright protected. Here is the copyright notice for ACM publications:

: ACM COPYRIGHT NOTICE. Copyright © YYYY by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

Other publishers, such as IEEE and Springer, have similar copyright notices.

Not published yet (in preparation, submitted etc.)

(graduate level textbook) Bhaskar DasGupta and Jie Liang, Models and Algorithms for Biomolecules and Molecular Networks, John Wiley & Sons, Inc., expected to appear in 2012/2013.
Piotr Berman, Bhaskar DasGupta, Lakshmi Kaligounder and Marek Karpinski, On Systemic Stability of Banking Networks, arXiv:1110.3546v2 [q-fin.RM], some power-point slides for these results.
Talks based on these results were or will be given at:
- 4^th annual New York Computer Science and Economics Day, New York University, September 16, 2011 (10 minute short talk).
- Industrial-Academic Workshop on Optimization in Finance and Risk Management, October 3-4, 2011, Fields Institute, Toronto, Canada
- Mathematical Finance theme, 2012 Annual Meeting of the Canadian Applied and Industrial Mathematics Society, July 24-28, 2012.
Bhaskar DasGupta and Devendra Desai, A Note on a Connection Between Small Set Expansions and Modularity Clustering, arXiv:1111.3048v1.
Bhaskar DasGupta, Joseph Dundas and Jie Liang, Algorithmic Methodologies for Discovery of Non-sequential Protein Structure Similarities.
Chun-An Chou, Zhe Liang, Wanpracha Chaovalitwongse, Tanya Y. Berger-Wolf, Bhaskar DasGupta, Saad Sheikh, Mary V. Ashley and Isabel C. Caballero, Column Generation Framework of Nonlinear Similarity Model for Reconstructing Sibling Groups.

2012 and "to appear"

Bhaskar DasGupta and S. Muthukrishnan, Stochastic Budget Optimization in Internet Advertising, to appear in Algorithmica.
Bhaskar DasGupta and Devendra Desai, Complexity of Newman's Community Finding Approach for Social Networks, to appear in Journal of Computer and System Sciences, preliminary version in arXiv:1102.0969v1 [physics.soc-ph].
(this paper was also be presented at the ICALP 2011 workshop on Graph algorithms and Applications, Zurich, Switzerland, July 3, 2011).
Bhaskar DasGupta and Lakshmi Kaligounder, A Survey on Fingerprint Classification Methods for Biological Sequences, to appear in Biological Knowledge Discovery Handbook: Preprocessing, Mining and Postprocessing of Biological Data, A. Zomaya and M. Elloumi (editors), John Wiley & Sons, 2012.
Bhaskar DasGupta and Derong Liu, Approximate learning of dynamic models/systems, in Encyclopedia of the Sciences of Learning, N. M. Seel (Editor-in-Chief), 291-293, Springer Verlag, 2012.

2011

Réka Albert, Bhaskar DasGupta, Anthony Gitter, Gamze Gürsoy, Rashmi Hegde, Pradyut Pal^†, Gowri Sangeetha Sivanathan and Eduardo Sontag, A New Computationally Efficient Measure of Topological Redundancy of Biological and Social Networks, Physical Review E, 84 (3), 036117, 2011.

^†Author was a junior at Neuqua Valley High School, Naperville, IL at the time of publication.
- For the software NET-SYNTHESIS used in this paper, follow this link.
- For the data and result files involving this paper, follow this link.
Daniel Ayala, Ouri Wolfson, Bo Xu, Bhaskar Dasgupta and Jie Lin, Parking Slot Assignment Games, 19^th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 299-308, 2011.
Marco Comi, Bhaskar DasGupta, Michael Schapira, Venkatakumar Srinivasan, On Communication Protocols that Compute Almost Privately, 4^th Symposium on Algorithmic Game Theory, G. Persiano (Ed.), LNCS 6982, Springer-Verlag, 44-56, 2011 (full version at arXiv:1102.1443v2 [cs.CR]).
Chun-An Chou, Wanpracha Chaovalitwongse, Tanya Y. Berger-Wolf, Bhaskar DasGupta and Mary V. Ashley, Capacitated Clustering Problem in Computational Biology: Combinatorial and Statistical Approach for Sibling Reconstruction, Computers & Operations Research, 39, 609-619, 2011.
Bhaskar DasGupta, Paola Vera-Licona and Eduardo Sontag, Reverse Engineering of Molecular Networks from a Common Combinatorial Approach, in Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications, Chapter 40, M. Elloumi and A. Zomaya (editors), John Wiley & Sons, Inc., 2011.
Bhaskar DasGupta, Ming-Yang Kao and Ion Mandoiu, Algorithmic Issues in DNA Barcoding Problems, in Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications, Chapter 7, M. Elloumi and A. Zomaya (editors), John Wiley & Sons, Inc., 2011.

2010

Saad I. Sheikh, Tanya Y. Berger-Wolf, Ashfaq A. Khokhar, Isabel C. Caballero, Mary V. Ashley, Wanpracha Chaovalitwongse, Chun-An Chou and Bhaskar DasGupta, Combinatorial Reconstruction of Half-sibling Groups from Microsatellite Data, Journal of Bioinformatics and Computational Biology, 8(2), 337-356, 2010.
Amitabha Bhattacharya, Bhaskar DasGupta, Dhruv Mubayi and György Turàn, On Approximate Horn Formula Minimization, 37^th International Colloquium on Automata, Languages and Programming (ICALP), S. Abramsky et al. (eds.), Part I, LNCS 6198, 438-450, © Springer-Verlag Berlin Heidelberg, 2010.
Mary V. Ashley, Tanya Y. Berger-Wolf, Wanpracha Chaovalitwongse, Bhaskar DasGupta, Ashfaq Khokhar and Saad Sheikh, On Approximating An Implicit Cover Problem in Wild Population Study, Discrete Mathematics, Algorithms and Applications, 2 (1), 21-31, 2010.
Wanpracha Chaovalitwongse, Chun-An Chou, Tanya Berger-Wolf, Bhaskar DasGupta, Saad Sheikh, Mary Ashley and Isabel Caballero, New Optimization Model and Algorithm for Sibling Reconstruction from Genetic Markers, INFORMS Journal of Computing, 22 (2), 180-194, 2010.
Réka Albert, Bhaskar DasGupta and Eduardo Sontag, Inference of signal transduction networks from double causal evidence , Methods in Molecular Biology: Topics in Computational Biology, D. Fenyo (ed.), 673, Chapter 16, © Springer Science+Business Media, LLC, 2010.

2009

Saad I. Sheikh, Tanya Y. Berger-Wolf, Ashfaq Khokhar, Isabel C. Caballero, Mary V. Ashley, Wanpracha Chaovalitwongse and Bhaskar DasGupta, Combinatorial Reconstruction of Half-Sibling Groups, Computational Systems Bioinformatics (proceedings of the CSB 2009 conference), 8, P. Markstein and Y. Xu (editors), © Life Sciences Society, 59-67, 2009.
Mary Ashley, Tanya Y. Berger-Wolf, Piotr Berman, Wanpracha Chaovalitwongse, Bhaskar DasGupta and Ming-Yang Kao, On Approximating Four Covering and Packing Problems , Journal of Computer and System Sciences, 75 (5), 287-302, 2009.
Piotr Berman, Bhaskar DasGupta and Marek Karpinski, Approximating Transitive Reduction Problems for Directed Networks, 11^th Algorithms and Data Structures Symposium (WADS), F. Dehne, M. Gavrilova, J.-R. Sack and C. D. Tóth (eds.), LNCS 5664, 74-85, 2009.
Mary V. Ashley, Tanya Y. Berger-Wolf, Wanpracha Chaovalitwongse, Bhaskar DasGupta, Ashfaq Khokhar and Saad Sheikh, On Approximating An Implicit Cover Problem in Biology, 5^th International Conference on Algorithmic Aspects in Information and Management (AAIM), A. Goldberg and Y. Zhou (Eds.), LNCS 5564, 43-54, ©Springer-Verlag Berlin Heidelberg, 2009.
Mary V. Ashley, Isabel C. Caballero, Wanpracha Chaovalitwongse, Bhaskar DasGupta, Priya Govindan, Saad Sheikh and Tanya Y. Berger-Wolf, KINALYZER, A Computer Program for Reconstructing Sibling Groups, Molecular Ecology Resources, 9 (4), 1127-1131, 2009.
Mary. Ashley, Tanya Y. Berger-Wolf, Isabel Caballero, Wanpracha Chaovalitwongse, Chun-An Chou, Bhaskar DasGupta and Saad Sheikh, Full Sibling Reconstructions in Wild Populations From Microsatellite Genetic Markers, in Computational Biology: New Research, A. S. Russe (editor), Nova Science Publishers, 231-258, 2009.
Kedsuda Apichonbancha, Bhaskar Dasgupta, Jin Jun, Ion Mandoiu and Emma Mendonca, A review of the Primer Approximation Multiplex PCR technique for detecting large-scale cancer genome lesions , Current Bioinformatics, 4 (1), 1-7, 2009.
Bhaskar DasGupta and Lusheng Wang, Biology Computing, in B. W. Wah (Ed.), Wiley Encyclopedia of Computer Science and Engineering, 1, 336-346, John Wiley & Sons, Inc., 2009.

2008

Saad I. Sheikh, Tanya Y. Berger-Wolf, Mary V. Ashley, Isabel C. Caballero, Wanpracha Chaovalitwongse and Bhaskar DasGupta, Error Tolerant Sibship Reconstruction in Wild Populations, Computational Systems Bioinformatics (7^th Annual International Conference on Computational Systems Bioinformatics, 26-29 August 2008), P. Markstein and Y. Xu (editors), 273-284, World Scientific Publishers, 2008.
Saad I. Sheikh, Tanya Y. Berger-Wolf, Ashfaq A. Khokhar and Bhaskar DasGupta, Consensus Methods for Reconstruction of Sibling Relationships from Genetic Data, 4^th Multidisciplinary Workshop on Advances in Preference Handling, Chicago, IL, 2008.
Sema Kachalo, Ranran Zhang, Eduardo Sontag, Réka Albert and Bhaskar DasGupta, NET-SYNTHESIS: A software for synthesis, inference and simplification of signal transduction networks , Bioinformatics, 24 (2), 293-295, 2008.
Mary Ashley, Tanya Berger-Wolf, Piotr Berman, Wanpracha Chaovalitwongse, Bhaskar DasGupta and Ming-Yang Kao, Approximating Several Covering/Packing Problems, International Symposium on Combinatorial Optimization 2008, University of Warwick, Coventry, UK, 2008 (abstract only).
Bhaskar DasGupta and Ming-Yang Kao, Efficient combinatorial algorithms for DNA sequence processing, in Bioinformatics Algorithms: Techniques and Applications, in Wiley Book Series on Bioinformatics: Computational Techniques and Engineering, A. Zelikovsky and I. Mandoiu (eds), John Wiley & Sons, Inc., 223-238, 2008.
Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp and Louxin Zhang, Nearest Neighbor Interchange and Related Distances, Encyclopedia of Algorithms, M.-Y. Kao (editor), Springer-Verlag, 573-576, 2008.
Piotr Berman and Bhaskar DasGupta, Approximating the Online Set Multicover Problems Via Randomized Winnowing, Theoretical Computer Science, 393 (1-3), 54-71, 2008.
Bhaskar DasGupta, Jin Jun and Ion Mandoiu, Primer Selection Methods for Detection of Genomic Inversions and Deletions via PAMP, Series on Advances in Bioinformatics and Computational Biology (6^th Asia Pacific Bioinformatics Conference, Kyoto, Japan, 14-17 January 2008), A. Brazma, S. Miyano and T. Akutsu (editors), 6, 353-362, Imperial College Press, London, 2008.
(this paper was also presented in 1^st RECOMB Satellite Workshop on Computational Cancer Biology, September 18-20, 2007)
Réka Albert, Bhaskar DasGupta, Riccardo Dondi and Eduardo Sontag, Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs, Algorithmica, 51 (2), 129-159, 2008.

2007

Piotr Berman, Bhaskar DasGupta and Jie Liang (editors), Foreword to the special issue on Algorithmic Methodologies for Processing Protein Structures, Sequences, and Networks, Algorithmica, 48 (4), p. 301, 2007.
Bhaskar DasGupta, Derong Liu and Hava Siegelmann, Neural Networks , in Handbook on Approximation Algorithms and Metaheuristics, T. F. Gonzalez (editor), Chapman & Hall/CRC (Computer & Information Science Series), pp. 22-1---22--14, 2007.
Joe Dundas, T.A. Binkowski, Bhaskar DasGupta and Jie Liang, Topology Independent Protein Structural Alignment , BMC Bioinformatics, 8:388, 2007.
Réka Albert, Bhaskar DasGupta, Riccardo Dondi, Sema Kachalo, Eduardo Sontag, Alexander Zelikovsky and Kelly Westbrooks, A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence, 7^th Workshop on Algorithms in Bioinformatics (WABI), R. Giancarlo and S. Hannenhalli (Eds.), LNBI 4645, © Springer-Verlag Berlin Heidelberg, 407-419, 2007.
(this paper was also presented at the 2007 Microsoft eScience Workshop at RENCI, Chapel Hill, NC, October 21-23, 2007)
Piotr Berman, Bhaskar DasGupta and Eduardo Sontag, Algorithmic Issues in Reverse Engineering of Protein and Gene Networks via the Modular Response Analysis Method , Annals of the New York Academy of Sciences (volume title: Reverse Engineering Biological Networks: Opportunities and Challenges in Computational Methods for Pathway Inference), 1115, 132-141, 2007.
Joe Dundas, T.A. Binkowski, Bhaskar DasGupta and Jie Liang, Topology Independent Protein Structural Alignment, 7^th Workshop on Algorithms in Bioinformatics (WABI), R. Giancarlo and S. Hannenhalli (Eds.), LNBI 4645, © Springer-Verlag Berlin Heidelberg, 171-182, 2007.
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao and Jie Wang, On Constructing An Optimal Consensus Clustering from Multiple Clusterings, Information Processing Letters, 104 (4), 137-145, 2007.
Tanya Y. Berger-Wolf, Saad Sheikh, Bhaskar DasGupta, Mary Ashley, Isabel Caballero and Wanpracha Chaovalitwongse, Reconstructing Sibling Relationships in Wild Populations, 15^th Annual Conference on Intelligent Systems in Molecular Biology (ISMB), 2007.
Réka Albert, Bhaskar DasGupta, Riccardo Dondi, Sema Kachalo, Eduardo Sontag, Alexander Zelikovsky and Kelly Westbrooks, A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence, Journal of Computational Biology, 14 (7), 927-949, 2007.
Tanya Y. Berger-Wolf, Saad Sheikh, Bhaskar DasGupta, Mary Ashley, Isabel Caballero and Wanpracha Chaovalitwongse, Reconstructing Sibling Relationships in Wild Populations, Bioinformatics, 23 (13), i49-i56, 2007.
Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert Sloan, György Turàn and Yi Zhang, The Inverse Protein Folding Problem on 2D and 3D Lattices, Discrete Applied Mathematics, 155 (6-7), 719-732, 2007.
Bhaskar DasGupta, German Andres Enciso, Eduardo Sontag and Yi Zhang, Algorithmic and Complexity Results for Decompositions of Biological Networks into Monotone Subsystems, Biosystems, 90 (1), 161-178, 2007.
Piotr Berman, Bhaskar DasGupta and Eduardo Sontag, Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks, Discrete Applied Mathematics, 155 (6-7), 733-749, 2007.
Wanpracha Chaovalitwongse, Tanya Y. Berger-Wolf, Bhaskar DasGupta, and Mary Ashley, Set Covering Approach for Reconstruction of Sibling Relationships, Optimization Methods and Software, 22 (1), 11-24, 2007.

2006

Piotr Berman, Bhaskar DasGupta and Eduardo Sontag, Computational Complexities of Combinatorial Problems With Applications to Reverse Engineering of Biological Networks, Advances in Computational Intelligence: Theory and Applications, F.-Y. Wang and D. Liu (eds.), Series in Intelligent Control and Intelligent Automation, 5, World Scientific publishers, 303-316, 2006.
Bhaskar DasGupta, German Andres Enciso, Eduardo Sontag and Yi Zhang, Algorithmic and Complexity Results for Decompositions of Biological Networks into Monotone Subsystems, 5^th International Workshop Experimental Algorithms (WEA), LNCS 4007, 253-264, Springer-Verlag, 2006.
Bhaskar DasGupta, João P. Hespanha, James Riehl and Eduardo Sontag, Honey-pot Constrained Searching with Local Sensory Information , Journal of Nonlinear Analysis: Hybrid Systems and Applications , 65 (9), 1773-1793, 2006.
Derong Liu, Xiaoxu Xiong, Bhaskar DasGupta and Huaguang Zhang, Motif Discoveries in Unaligned Molecular Sequences Using Self-Organizing Neural Networks, IEEE Transactions on Neural Networks, 17 (4), 919-928, 2006.
Bhaskar Dasgupta, Sergio Ferrarini, Uthra Gopalakrishnan and Nisha Raj Paryani, Inapproximability Results for the Lateral Gene Transfer Problem , Journal of Combinatorial Optimization, 11 (4), 387-405, 2006.

2005

Piotr Berman and Bhaskar DasGupta, Approximating the Online Set Multicover Problems Via Randomized Winnowing, 9^th Workshop on Algorithms and Data Structures (WADS), F. Dehne, A. Lòpez-Ortiz and J. R. Sack (editors), LNCS 3608, Springer-Verlag, 110-121, 2005.
(A complete version of the paper with all the proofs is here)
Bhaskar DasGupta, Kishori Konwar, Ion Mandoiu and Alex Shvartsman, Highly Scalable Algorithms for Robust String Barcoding, 2005 International Workshop on Bioinformatics Research and Applications (IWBRA), LNCS 3515, V. S. Sunderam, G. D. van Albada, P. M. A. Sloot, et al. (editors), Springer Verlag, 1020-1028, 2005.
Bhaskar DasGupta, Sergio Ferrarini, Uthra Gopalakrishnan and Nisha Raj Paryani, Inapproximability Results for the Lateral Gene Transfer Problem, 9^th Italian Conference on Theoretical Computer Science (ICTCS'05), M. Coppo et al. (Eds.), LNCS 3701, Springer-Verlag, 182-195, 2005.
Tanya Y. Berger-Wolf, Bhaskar DasGupta, Wanpracha Chaovalitwongse and Mary Ashley, Combinatorial Reconstructions of Sibling Relationships, 6^th International Symposium on Computational Biology and Genome Informatics (CBGI), 1252-1255, 2005.
Xiaoxu Xiong, Derong Liu and Bhaskar DasGupta, A Self-Organizing Neural Network Structure for Motif Identification in DNA Sequences, IEEE International Conference on Networking, Sensing and Control, 129-134, 2005.
Piotr Berman, Bhaskar DasGupta and Ming-Yang Kao, Tight Approximability Results for Test Set Problems in Bioinformatics , Journal of Computer and System Sciences, 71 (2), 145-162, 2005.
Bhaskar DasGupta, Kishori Konwar, Ion Mandoiu and Alex Shvartsman, Highly Scalable Algorithms for Robust String Barcoding , International Journal of Bioinformatics Research & Applications, 1 (2), 145-161, 2005.
Derong Liu, Xiaoxu Xiong, Zheng-Guang Hou and 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.
Bhaskar DasGupta, Kishori Konwar, Ion Mandoiu and Alex Shvartsman, DNA-BAR: Distinguisher Selection for DNA Barcoding, Bioinformatics, 21 (16), 3424-2426, 2005.
Bhaskar DasGupta and Barbara Hammer, On Approximate Learning by Multi-layered Feedforward Circuits , Theoretical Computer Science, 348 (1), 95-127, 2005.

2004

T. Andrew Binkowski, Bhaskar DasGupta and Jie Liang, Order independent structural alignment of circularly permutated proteins, 26^th Annual International Conference IEEE Engineering in Medicine and Biology Society (EMBS 2004), 2781-2784, 2004.
Piotr Berman, Bhaskar DasGupta and Eduardo Sontag, Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks, 7^th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), LNCS 3122, K. Jansen, S. Khanna, J. D. P. Rolim and D. Ron (eds.), Springer Verlag, 39-50, 2004.
(A revised journal version with somewhat improved bounds is available here)
Piotr Berman, Bhaskar DasGupta and Ming-Yang Kao, Tight Approximability Results for Test Set Problems in Bioinformatics, 9^th Scandinavian Workshop on Algorithm Theory (SWAT), LNCS 3111, T. Hagerup and J. Katajainen (eds.), Springer Verlag, 39-50, 2004.
Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert Sloan, György Turàn and Yi Zhang, The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices, 15^th Annual Combinatorial Pattern Matching Symposium (CPM), LNCS 3109, C. S. Sahinalp, S. Muthukrishnan and U. Dogrusoz (eds.), 244-253, 2004.
Bhaskar DasGupta, João P. Hespanha and Eduardo Sontag, Computational Complexities of Honey-pot Searching with Local Sensory Information, 2004 American Control Conference (ACC 2004), 2134-2138, 2004.
Bhaskar DasGupta, João P. Hespanha and Eduardo Sontag, Aggregation-based Approaches to Honey-pot Searching with Local Sensory Information, 2004 American Control Conference (ACC 2004), 1202-1207, 2004.
Piotr Berman, Paul Bertone, Bhaskar DasGupta, Mark Gerstein, Ming-Yang Kao and Michael Snyder, Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search, Journal of Computational Biology, 11 (4), 766-785, 2004.

2003

Piotr Berman, Bhaskar DasGupta and S. Muthukrishnan, Approximation Algorithms For MAX-MIN Tiling, Journal of Algorithms, 47 (2), 122-134, 2003.
(This was one of the top 10 most downloaded article from Journal of Algorithms in 2003)

2002

Karhan Akcoglu, James Aspnes, Bhaskar DasGupta and Ming-Yang Kao, Opportunity Cost Algorithms for Combinatorial Auctions, in Applied Optimization: Computational Methods in Decision-Making, Economics and Finance, E. J. Kontoghiorghes, B. Rustem and S. Siokos (eds.), Kluwer Academic Publishers, 455-479, 2002.
Piotr Berman and Bhaskar DasGupta, A Simple Approximation Algorithm for Nonoverlapping Local Alignments (Weighted Independent Sets of Axis Parallel Rectangles) in Biocomputing, 1, P. M. Pardalos and J. Principe (eds.), Kluwer Academic Publishers, 129-138, 2002.
Bhaskar DasGupta and Georg Schnitger, On the Computational Power of Analog Neural Networks, in The Handbook of Brain Theory and Neural Networks, 2^nd edition, M. A. Arbib (Editor), Cambridge, MA: The MIT Press, 97-100, 2002.
Piotr Berman, Paul Bertone, Bhaskar DasGupta, Mark Gerstein, Ming-Yang Kao and Michael Snyder, Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search, 2^nd International Workshop on Algorithms in Bioinformatics (WABI 2002), LNCS 2452, R. Guigó and D. Gusfield (eds.), Springer Verlag, 419-433, 2002.
Piotr Berman, Bhaskar DasGupta and S. Muthukrishnan, Slice and Dice: A Simple, Improved Approximate Tiling Recipe, 13^th ACM-SIAM Symposium on Discrete Algorithms, 455-464, 2002.
Piotr Berman, Bhaskar DasGupta and S. Muthukrishnan, Simple Approximation Algorithm for Nonoverlapping Local Alignments, 13^th ACM-SIAM Symposium on Discrete Algorithms, 677-678, 2002.
Frank K. Hwang, Yi-Ching Yao and Bhaskar DasGupta, Some permutation routing algorithms for lower-dimensional hypercubes, Theoretical Computer Science, 270 (1-2), 111-124, 2002.
Piotr Berman, Bhaskar DasGupta and S. Muthukrishnan, On the Exact Size of the Binary Space Partitioning of Sets of Isothetic Rectangles with Applications, SIAM Journal of Discrete Mathematics, 15 (2), 252-267, 2002.

2001

Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan and Suneeta Ramaswami, Efficient Approximation Algorithms for Tiling and Packing Problems With Rectangles, Journal of Algorithms, 41 (2), 443-470, 2001.
Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan and Suneeta Ramaswami, Improved Approximation Algorithms for Rectangle Tiling and Packing, 12^th ACM-SIAM Symposium on Discrete Algorithms, 427-436, 2001.
Bhaskar DasGupta and Michael A. Palis, Online Real-Time Preemptive Scheduling of Jobs with Deadlines on Multiple Machines, Journal of Scheduling, 4, 297-312, 2001.
Bhaskar DasGupta and Eduardo D. Sontag, A Polynomial-Time Algorithm for Checking Equivalence Under Certain Semiring Congruences motivated by the State-space Isomorphism Problem for Hybrid Systems, Theoretical Computer Science, 262 (1), 161-189, 2001.
Xinzhen Cheng, Bhaskar DasGupta and Bing Lu, Polynomial Time Approximation Scheme for the Symmetric Rectilinear Steiner Arborescence Problem, Journal of Global Optimization, 21 (4), 385-396, 2001.

2000

Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp and Louxin Zhang, On Computing the Nearest Neighbor Interchange Distance, in D. Z. Du, P M. Pardalos and J. Wang (eds.), Proceedings of the DIMACS Workshop on Discrete Problems with Medical Applications, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, 55, 125-143, 2000.
Bhaskar DasGupta and Barbara Hammer, On Approximate Learning by Multi-layered Feedforward Circuits, Lecture Notes in Artificial Intelligence 1968, 11^th International Conference on Algorithmic Learning Theory, 264-278, 2000.
Bhaskar DasGupta and Michael A. Palis, Online Real-Time Preemptive Scheduling of Jobs with Deadlines, 3^rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, Lecture Notes in Computer Science (LNCS) 1913, Springer, 96-107, 2000.
Piotr Berman and Bhaskar DasGupta, Improvements in Throughput Maximization for Real-Time Scheduling, 32^nd Annual ACM Symposium on Theory of Computing, 680-687, 2000.
Piotr Berman and Bhaskar DasGupta, Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling, Journal of Combinatorial Optimization, 4 (3), 307-323, 2000.

1999

Bhaskar DasGupta and Lusheng Wang, Biology Computing, in J. Webster (Editor), Wiley Encyclopedia of Electrical Engineering and Electronics, John Wiley & Sons, Inc., 386-394, 1999.
Gerard J. Chang, Bhaskar DasGupta, Wayne M. Dymàcek, Martin Fürer, Matthew Koerlin, Yueh-Shin Lee and Tom Whaley, Characterizations of Bipartite Steinhaus Graphs, Discrete Mathematics, 199 (1-3), 11-25, 1999.
Bhaskar DasGupta and Michael A. Palis, Provably Good Algorithms for Transmission Scheduling in WDM Optical Networks. Journal of Parallel and Distributed Computing, 57 (3), 345-357, 1999.
Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li and John Tromp, On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees, Algorithmica, 25 (2), 176-195, 1999.

1998

Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp, Lusheng Wang and Louxin Zhang, Computing Distances between Evolutionary Trees, in D. Z. Du and P.M. Pardalos (eds.), Handbook of Combinatorial Optimization, Kluwer Academic Publishers, 2, 35-76, 1998.
Bhaskar DasGupta and Eduardo D. Sontag, A Polynomial-Time Algorithm for an Equivalence Problem which Arises in Hybrid Systems Theory, 37^th IEEE Conference on Decision and Control, IEEE Publications, 1629-1634, 1998.
Bhaskar DasGupta and Michael A. Palis, Scheduling Transmissions in WDM Optical Networks, International Conference on Parallel and Distributed Techniques and Applications, 1042-1049, 1998.
Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming Li and Elizabeth Sweedyk, On the Complexity and Approximation of Syntenic Distance, Discrete Applied Mathematics, 88 (1-3), 59-82, 1998.

1997

Piotr Berman and Bhaskar DasGupta, On Approximating the Corner Cover Problems, 2^nd CGC workshop on Computational Geometry, Duke University, October 1997 (abstract only).
Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming Li and Elizabeth Sweedyk, On the Complexity and Approximation of Syntenic Distance, 1^st Annual International Conference On Computational Molecular Biology, 99-108, 1997.
Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp and Louxin Zhang, On Distances between Phylogenetic Trees, 8^th Annual ACM-SIAM Symposium on Discrete Algorithms, 427-436, 1997.
Prosenjit Gupta, Ravi Janardan, Michiel Smid and Bhaskar DasGupta, The rectangle enclosure and point-dominance problems revisited, International Journal of Computational Geometry and Applications, 7 (5), 437-455, 1997.
Piotr Berman and Bhaskar DasGupta, On the Complexities of Efficient Solutions of the Rectlinear Polygon Cover Problems , Algorithmica, 17 (4), 331-356, 1997.

1996

Bhaskar DasGupta and Eduardo D. Sontag, Learning Recurrent Perceptron Mappings, in D. S. Touretzky, M. Mozer and M. E. Hasselmo (eds.), Advances in Neural Information Processing Systems 8, The MIT Press, Cambridge, MA, 204-210, 1996.
Bhaskar DasGupta and Eduardo D. Sontag, Sample Complexity for Learning Recurrent Perceptron Mappings, IEEE Transactions on Information Theory, 42 (5), 1479-1487, 1996.
Bhaskar DasGupta and Georg Schnitger, Analog versus Discrete Neural Networks, Neural Computation, 8 (4), 805-818, 1996.

1995

Prosenjit Gupta, Ravi Janardan, Michiel Smid and Bhaskar DasGupta, The rectangle enclosure and point-dominance problems revisited, 11^th ACM Symposium on Computational Geometry, 162-171, 1995.
Bhaskar DasGupta, Hava T. Siegelmann and Eduardo Sontag, On the Complexity of Training Neural Networks with Continuous Activation Functions, IEEE Transactions on Neural Networks, 6 (6), 1490-1504, 1995.

1994

Bhaskar DasGupta, Hava T. Siegelmann and Eduardo Sontag, On the Intractability of Loading Neural Networks, in V. P. Roychowdhury, K. Y. Siu and A. Orlitsky (eds.), Theoretical Advances in Neural Computation and Learning, Kluwer Academic Publishers, 357-389, 1994.
Bhaskar DasGupta and Vwani P. Roychowdhury, Two Geometric Optimization Problems, in D.-Z. Du and J. Sun (eds.), New Advances in Optimization and Approximation, Kluwer Academic Publishers, 30-57, 1994.
Bhaskar DasGupta, Hava T. Siegelmann and Eduardo Sontag, On a Learnability Question Associated to Neural Networks with Continuous Activations, 7^th ACM Conference on Learning Theory, 47-56, 1994.
Bhaskar DasGupta and Martin Fürer, Counting Bipartite Steinhaus Graphs, 7^th SIAM Conference on Discrete Mathematics, 1994 (abstract only).
Sudeb Pal, Bhaskar DasGupta and C.E. Veni Madhavan, Optimal Polygon Placement by Translation, International Journal of Computer Mathematics, 52, 139-148, 1994.

1993

Sourav Bhattacharya and Bhaskar DasGupta, Steiner Problem in Multistage Computer Networks, in D.-Z. Du and P. M. Pardalos (eds.), Network Optimization Problems, World Scientific Publishing Co., 387-401, 1993.
Bhaskar DasGupta and Georg Schnitger, The Power of Approximating: A Comparison of Activation Functions, in C. L. Giles. S. J. Hanson and J. D. Cowan (eds.), Advances in Neural Information Processing Systems 5, Morgan Kaufmann Publishers, 615-622, 1993.
Bhaskar DasGupta, Ravi Janardan and Naveed Sherwani, On the Greedy Algorithm for a Covering Problem, Technical Report # TR 93-13, Department of Computer Science, University of Minnesota, Minneapolis, MN 55455, February 1993.

1992

Piotr Berman and Bhaskar DasGupta, On Approximating the Rectlinear Polygon Covering Problems, 4^th Canadian Conference on Computational Geometry, 229-235, 1992.
Bhaskar DasGupta, Learning Capabilities of Recurrent Neural Networks, Proceedings of IEEE SouthEastcon, 822-823, 1992.
Bhaskar DasGupta and Georg Schnitger, Efficient Approximation with Neural Networks: A Comparison of Gate Functions, Technical Report, Pennsylvania State University, June, 1992.

1990

Sudeb Pal, Bhaskar DasGupta and C.E. Veni Madhavan, Optimal Polygon Placement by Translation, 2^nd Canadian Conference on Computational Geometry, 164-171, 1990.

1989

Bhaskar DasGupta and C.E. Veni Madhavan, An Approximate Algorithm for the Minimal Vertex Nested Polygon Problem, Information Processing Letters, 33 (1), 35-44, 1989.