List of Publications

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.

For unpublished, but cited, Technical Report, click here
For papers in progress or under submission/review, click here

Journal special issues:

: Piotr Berman, Bhaskar DasGupta and Jie Liang (editors), Foreword to the special issue on Algorithmic Methodologies for Processing Protein Structures, Sequences, and Networks , Algorithmica, Volume 48, Number 4, pp. 301, August 2007.

Journal Papers Conference Papers Chapters/Articles in Books or Edited Volumes

[1] 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, Volume 24, Number 2, pp. 293-295, January 2008 (doi: 10.1093/bioinformatics/btm571). [1] 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, to appear in 7th Annual International Conference on Computational Systems Bioinformatics (CSB), 2008. [1] Bhaskar DasGupta, Derong Liu and Hava Siegelmann, Neural Networks , in Handbook on Approximation Algorithms and Metaheuristics, Teofilo F. Gonzalez (editor), Chapman & Hall/CRC (Computer & Information Science Series), pp. 22-1---22--14, 2007.

[2] Piotr Berman and Bhaskar DasGupta, Approximating the Online Set Multicover Problems Via Randomized Winnowing, Theoretical Computer Science, Volume 393, pp. 54-71, 2008. [2] Saad I. Sheikh, Tanya Y. Berger-Wolf, Ashfaq A. Khokhar and Bhaskar DasGupta, Consensus Methods for Reconstruction of Sibling Relationships from Genetic Data, to appear in 4th Multidisciplinary Workshop on Advances in Preference Handling, Chicago, IL, 2008. [2] 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, Alexander Zelikovsky and Ion Mandoiu (editors), John Wiley & Sons, Inc., pp. 223-238, 2008. (Series Editors: Yi Pan and Albert Y. Zomaya)

[3] Joe Dundas, T.A. Binkowski, Bhaskar DasGupta and Jie Liang, Topology Independent Protein Structural Alignment , BMC Bioinformatics, 8:388, 2007. [3] 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 (6th Asia Pacific Bioinformatics Conference, Kyoto, Japan, 14-17 January 2008) A. Brazma, S. Miyano and T. Akutsu (editors), Volume 6, pp. 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. ) [3] Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp and Louxin Zhang, Nearest Neighbor Interchange and Related Distances, to appear in Encyclopedia of Algorithms, Ming-Yang Kao (editor), Springer-Verlag.

[4] 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, edited by Gustavo Stolovitsky, Andrea Califano and Jim Collins), Volume 1115, pp. 132-141, December 2007. [4] 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, 7th Workshop on Algorithms in Bioinformatics (WABI), R. Giancarlo and S. Hannenhalli (Eds.), LNBI 4645, © Springer-Verlag Berlin Heidelberg, pp. 407-419, September 2007.

(this paper was also presented at the 2007 Microsoft eScience Workshop at RENCI, Chapel Hill, NC, October 21-23, 2007) [4] 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, Fei-Yue Wang and Derong Liu (editors), Series in Intelligent Control and Intelligent Automation Volume 5, World Scientific publishers, pp. 303-316, June 2006.

[5] Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao and Jie Wang, On Constructing An Optimal Consensus Clustering from Multiple Clusterings, Information Processing Letters, Volume 104, Number 4, pp. 137-145, 2007. [5] Joe Dundas, T.A. Binkowski, Bhaskar DasGupta and Jie Liang Topology Independent Protein Structural Alignment, 7th Workshop on Algorithms in Bioinformatics (WABI), R. Giancarlo and S. Hannenhalli (Eds.), LNBI 4645, © Springer-Verlag Berlin Heidelberg, pp. 171-182, September 2007. [5] Bhaskar DasGupta and Lusheng Wang, Biology Computing, in Benjamin W. Wah (Ed.), Wiley Encyclopedia of Computer Science and Engineering, John Wiley & Sons, Inc., December 2007. (doi: dx.doi.org/10.1002/9780470050118.ecse932).

[6] 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, Volume 14, Number 7, pp. 927-949, 2007.
For further theoretical results, click here. [6] Tanya Y. Berger-Wolf, Saad Sheikh, Bhaskar DasGupta, Mary Ashley, Isabel Caballero and Wanpracha Chaovalitwongse, Reconstructing Sibling Relationships in Wild Populations, 15th Annual Conference on Intelligent Systems in Molecular Biology (ISMB), , July 21-25, 2007. [6] 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 (editors), Kluwer Academic Publishers, pp. 455-479, September 2002 (ISBN 1-4020-0839-2).

[7] Réka Albert, Bhaskar DasGupta, Riccardo Dondi and Eduardo Sontag, Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs, Algorithmica, Volume 51, Number 2, pp. 129-159, June 2008.
For further results in this direction, click here. [7] Bhaskar DasGupta, German Andres Enciso, Eduardo Sontag and Yi Zhang, Algorithmic and Complexity Results for Decompositions of Biological Networks into Monotone Subsystems, 5th International Workshop Experimental Algorithms (WEA), LNCS 4007, pp. 253-264, Springer-Verlag, 2006. [7] Piotr Berman and Bhaskar DasGupta, A Simple Approximation Algorithm for Nonoverlapping Local Alignments (Weighted Independent Sets of Axis Parallel Rectangles) in Biocomputing, Volume 1, Panos M. Pardalos and Jose Principe (editors), Kluwer Academic Publishers, pp. 129-138, June 2002 (ISBN 1-4020-0641-1).

[8] Tanya Y. Berger-Wolf, Saad Sheikh, Bhaskar DasGupta, Mary Ashley, Isabel Caballero and Wanpracha Chaovalitwongse, Reconstructing Sibling Relationships in Wild Populations, Bioinformatics, Volume 23, Number 13, pp. i49-i56, 2007. [8] 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, pp. 110-121, 2005.
(A complete version of the paper with all the proofs is here) [8] Bhaskar DasGupta and Georg Schnitger, On the Computational Power of Analog Neural Networks, in The Handbook of Brain Theory and Neural Networks, Second edition, (M.A. Arbib, Ed.), Cambridge, MA: The MIT Press, pp. 97-100, 2002.

[9] Bhaskar DasGupta, German Andres Enciso, Eduardo Sontag and Yi Zhang, Algorithmic and Complexity Results for Decompositions of Biological Networks into Monotone Subsystems, Biosystems, Volume 90, Issue 1, pp. 161-178, July-August 2007. [9] 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, pp. 182-195, 2005. [9] 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, Vol. 55, pp. 125-143, 2000.

[10] 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 (special issue on computational molecular biology series edited by Sorin Istrail, Pavel Pevzner and Ron Shamir), Vol. 155, Issues 6-7, pp. 733-749, 2007. [10] 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), July 21-26, 2005, Salt Lake City, Utah, pp. 1252-1255. [10] Bhaskar DasGupta and Lusheng Wang, Biology Computing, in Webster J. (Ed.), Wiley Encyclopedia of Electrical Engineering and Electronics, John Wiley & Sons, Inc., 1999, pp. 386-394.

[11] 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 (special issue on computational molecular biology series edited by Sorin Istrail, Pavel Pevzner and Ron Shamir), Vol. 155, Issues 6-7, pp. 719-732, 2007. [11] 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, Vaidy S. Sunderam, Geert Dick van Albada, Peter M. A. Sloot, et al. (editors), Springer Verlag, pp. 1020-1028, May 2005. [11] 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, Volume 2, December 1998, pp. 35-76.

[12] Wanpracha Chaovalitwongse, Tanya Y. Berger-Wolf, Bhaskar DasGupta, and Mary Ashley, Set Covering Approach for Reconstruction of Sibling Relationships, Optimization Methods and Software, Vol. 22, No. 1, pp. 11-24, February 2007. [12] Xiaoxu Xiong, Derong Liu and Bhaskar DasGupta, A Self-Organizing Neural Network Structure for Motif Identification in DNA Sequences, 2005 IEEE International Conference on Networking, Sensing and Control, Tucson, AZ, March 2005, pp. 129-134. [12] Bhaskar DasGupta, Hava T. Siegelmann and Eduardo Sontag, On the Intractability of Loading Neural Networks, in Roychowdhury V. P., Siu K. Y., and Orlitsky A. (eds.), Theoretical Advances in Neural Computation and Learning, Kluwer Academic Publishers, 1994, pp. 357-389.

[13] 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 , Volume 65, Issue 9, 1 November 2006, pp. 1773-1793. [13] T. Andrew Binkowski, Bhaskar DasGupta and Jie Liang, Order independent structural alignment of circularly permutated proteins, 26th Annual International Conference IEEE Engineering in Medicine and Biology Society (EMBS 2004), pp. 2781-2784, September 1-5, 2004. [13] Bhaskar DasGupta and Vwani P. Roychowdhury, Two Geometric Optimization Problems, in Ding-Zhu Du and Jie Sun (eds.), New Advances in Optimization and Approximation, ©1994 Kluwer Academic Publishers, pp. 30-57.

[14] 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, Volume 17, Issue 4, pp. 919-928, July 2006. [14] 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 (editors), Springer Verlag, pp. 39-50, August 2004.
(A revised journal version with somewhat improved bounds is available here ) [14] Sourav Bhattacharya and Bhaskar DasGupta, Steiner Problem in Multistage Computer Networks, in D.-Z. Du and P.M. Pardalos (eds.), Network Optimization Problems, ©1993 World Scientific Publishing Co., pp. 387-401.

[15] Bhaskar Dasgupta, Sergio Ferrarini, Uthra Gopalakrishnan and Nisha Raj Paryani, Inapproximability Results for the Lateral Gene Transfer Problem , Journal of Combinatorial Optimization, Vol. 11, No. 4, pp. 387-405, June 2006. [15] 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 (editors), Springer Verlag, pp. 39-50, July 2004.

[16] Bhaskar DasGupta and Barbara Hammer, On Approximate Learning by Multi-layered Feedforward Circuits , Theoretical Computer Science, Vol. 348, Issue 1, pp. 95--127, December 2005. [16] 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 (editors), pp. 244-253, July 2004.

[17] Piotr Berman, Bhaskar DasGupta and Ming-Yang Kao, Tight Approximability Results for Test Set Problems in Bioinformatics , Journal of Computer & System Sciences, Vol. 71, Issue 2, pp. 145-162, August 2005. [17] 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), pp. 2134-2138, 2004.

[18] Bhaskar DasGupta, Kishori Konwar, Ion Mandoiu and Alex Shvartsman, Highly Scalable Algorithms for Robust String Barcoding , International Journal of Bioinformatics Research & Applications, Volume 1, No. 2, pp. 145-161, 2005. [18] 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), pp. 1202-1207, 2004.

[19] 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, Volume 18, Issues 5-6, pp. 835-842, July-August 2005. [19] 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, 2nd International Workshop on Algorithms in Bioinformatics (WABI 2002), LNCS 2452, R. Guigó and D. Gusfield (editors), Springer Verlag, pp. 419-433, July 2002.

[20] Bhaskar DasGupta, Kishori Konwar, Ion Mandoiu and Alex Shvartsman, DNA-BAR: Distinguisher Selection for DNA Barcoding, Bioinformatics, Vol. 21, No. 16, pp. 3424-2426, 2005. [20] Piotr Berman, Bhaskar DasGupta and S. Muthukrishnan, Slice and Dice: A Simple, Improved Approximate Tiling Recipe, 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 455-464, January 2002.

[21] 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, Vol. 11, No. 4, pp. 766-785, July 2004. [21] Piotr Berman, Bhaskar DasGupta and S. Muthukrishnan, Simple Approximation Algorithm for Nonoverlapping Local Alignments, 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 677-678, January 2002.

[22] Piotr Berman, Bhaskar DasGupta and S. Muthukrishnan, Approximation Algorithms For MAX-MIN Tiling, Journal of Algorithms, Vol. 47, No. 2, pp. 122-134, July 2003.
(This was one of the top 10 most downloaded article from Journal of Algorithms in 2003) [22] Bhaskar DasGupta and Barbara Hammer, On Approximate Learning by Multi-layered Feedforward Circuits, Lecture Notes in Artificial Intelligence 1968, 11th International Conference on Algorithmic Learning Theory (ALT-2000), December 2000, pp. 264-278.

[23] Frank K. Hwang, Yi-Ching Yao and Bhaskar DasGupta, Some permutation routing algorithms for lower-dimensional hypercubes, Theoretical Computer Science, Vol. 270, pp. 111-124, 2002. [23] Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan and Suneeta Ramaswami, Improved Approximation Algorithms for Rectangle Tiling and Packing. , 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), January 2001, pp. 427-436.

[24] 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, Vol. 15, No. 2, pp. 252-267, 2002. [24] Bhaskar DasGupta and Michael A. Palis, Online Real-Time Preemptive Scheduling of Jobs with Deadlines, 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), Lecture Notes in Computer Science (LNCS) 1913, Springer, September 2000, pp. 96-107.

[25] Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan and Suneeta Ramaswami, Efficient Approximation Algorithms for Tiling and Packing Problems With Rectangles, Journal of Algorithms, Vol. 41, pp. 443-470, 2001. [25] Piotr Berman and Bhaskar DasGupta, Improvements in Throughput Maximization for Real-Time Scheduling, 32nd Annual ACM Symposium on Theory of Computing (STOC), May 2000, pp. 680-687.

[26] Bhaskar DasGupta and Michael A. Palis, Online Real-Time Preemptive Scheduling of Jobs with Deadlines on Multiple Machines, Journal of Scheduling, Vol. 4, pp. 297-312, 2001. [26] Bhaskar DasGupta and Eduardo D. Sontag, A Polynomial-Time Algorithm for an Equivalence Problem which Arises in Hybrid Systems Theory, 37th IEEE Conference on Decision and Control, December 1998, IEEE Publications, 1998, pp. 1629-1634.

[27] Xinzhen Cheng, Bhaskar DasGupta and Bing Lu, Polynomial Time Approximation Scheme for the Symmetric Rectilinear Steiner Arborescence Problem, Journal of Global Optimization, Vol 21, Issue 4, pp. 385-396, December 2001. [27] Bhaskar DasGupta and Michael A. Palis, Scheduling Transmissions in WDM Optical Networks, Proceedings of the International Conference on Parallel and Distributed Techniques and Applications (PDPTA'98), July 13-16 1998, pp. 1042-1049.

[28] Piotr Berman and Bhaskar DasGupta, Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling, Journal of Combinatorial Optimization, Vol. 4, No. 3, September 2000, pp. 307-323. [28] Piotr Berman and Bhaskar DasGupta, On Approximating the Corner Cover Problems, 2nd CGC workshop on Computational Geometry, Duke University, October 1997 (abstract only).

[29] 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, Vol. 262, pp. 161-189, 2001. [29] Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming Li and Elizabeth Sweedyk, On the Complexity and Approximation of Syntenic Distance, 1st Annual International Conference On Computational Molecular Biology (RECOMB 97, 1997, pp. 99-108.

[30] Bhaskar DasGupta and Michael A. Palis, Provably Good Algorithms for Transmission Scheduling in WDM Optical Networks. Journal of Parallel and Distributed Computing, Vol. 57, No. 3, June 1999, pp. 345-357. [30] Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp and Louxin Zhang, On Distances between Phylogenetic Trees, 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1997, pp. 427-436.

[31] 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, Vol. 199, No. 1-3, March 1999, pp. 11-25. [31] Bhaskar DasGupta and Eduardo D. Sontag, Learning Recurrent Perceptron Mappings , in Touretzky David S., Mozer Michael C. and Hasselmo Michael E. (eds.), Advances in Neural Information Processing Systems 8 (NIPS95), The MIT Press, Cambridge, MA, 1996, pp. 204-210.

[32] Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming Li and Elizabeth Sweedyk, On the Complexity and Approximation of Syntenic Distance, Discrete Applied Mathematics (special issue in computational biology), Vol. 88, No. 1--3, Nov 1998, pp. 59-82. [32] Prosenjit Gupta, Ravi Janardan, Michiel Smid and Bhaskar DasGupta, The rectangle enclosure and point-dominance problems revisited, Proceedings of the 11th ACM Symposium on Computational Geometry, 1995, pp. 162-171.

[33] Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li and John Tromp, On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees, Algorithmica, Vol. 25, No. 2, pp. 176-195, 1999. [33] Bhaskar DasGupta, Hava T. Siegelmann and Eduardo Sontag, On a Learnability Question Associated to Neural Networks with Continuous Activations, proceedings of the 7th ACM Conference on Learning Theory (COLT), 1994, pp. 47-56.

[34] Prosenjit Gupta, Ravi Janardan, Michiel Smid and Bhaskar DasGupta, The rectangle enclosure and point-dominance problems revisited, International Journal of Computational Geometry and Applications, Vol. 7, No. 5, pp. 437-455, 1997. [34] Bhaskar DasGupta and Martin Fürer, Counting Bipartite Steinhaus Graphs, Seventh SIAM Conference on Discrete Mathematics, 1994 (abstract only).

[35] Piotr Berman and Bhaskar DasGupta, On the Complexities of Efficient Solutions of the Rectlinear Polygon Cover Problems , Algorithmica, Vol. 17, pp. 331-356, 1997. [35] Bhaskar DasGupta and Georg Schnitger, The Power of Approximating: A Comparison of Activation Functions, in Giles. C.L., Hanson S.J., and Cowan J.D. (eds.), Advances in Neural Information Processing Systems 5, San Mateo, CA: Morgan Kaufmann Publishers, 1993, pp. 615-622.

[36] Bhaskar DasGupta and Eduardo D. Sontag, Sample Complexity for Learning Recurrent Perceptron Mappings, IEEE Transactions on Information Theory, Vol. 42, No. 5, pp. 1479-1487, September 1996. [36] Piotr Berman and Bhaskar DasGupta, On Approximating the Rectlinear Polygon Covering Problems, 4th Canadian Conference on Computational Geometry, 1992, pp. 229-235.

[37] Bhaskar DasGupta and Georg Schnitger, Analog versus Discrete Neural Networks, Neural Computation, Vol. 8, No. 4, pp. 805-818, May 1996. [37] Bhaskar DasGupta, Learning Capabilities of Recurrent Neural Networks, Proceedings of IEEE SouthEastcon 1992, pp. 822-823.

[38] Bhaskar DasGupta, Hava T. Siegelmann and Eduardo Sontag, On the Complexity of Training Neural Networks with Continuous Activation Functions, IEEE Transactions on Neural Networks, Vol. 6, No. 6, pp. 1490-1504, 1995. [38] Sudeb Pal, Bhaskar DasGupta and C.E. Veni Madhavan, Optimal Polygon Placement by Translation, 2nd Canadian Conference on Computational Geometry, 1990, pp. 164-171.

[39] Sudeb Pal, Bhaskar DasGupta and C.E. Veni Madhavan, Optimal Polygon Placement by Translation, International Journal of Computer Mathematics, Vol 52, pp. 139-148, 1994.

[40] Bhaskar DasGupta and C.E. Veni Madhavan, An Approximate Algorithm for the Minimal Vertex Nested Polygon Problem, Information Processing Letters, Vol. 33, pp. 35-44, 1990.

Unpublished, but cited, Technical Report:

: [1] 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.; [2] Bhaskar DasGupta and Georg Schnitger, Efficient Approximation with Neural Networks: A Comparison of Gate Functions, Technical Report, Pennsylvania State University, June, 1992.

Papers in progress or under submission/review:

: [1] Mary Ashley, Tanya Y. Berger-Wolf, Piotr Berman, Wanpracha Chaovalitwongse, Bhaskar DasGupta and Ming-Yang Kao, On Approximating Four Covering/Packing Problems , (preliminary version as DIMACS technical report 2007-14).; [2] Piotr Berman, Bhaskar DasGupta and Marek Karpinski, Approximating Transitive Reduction Problems for Directed Networks , ECCC Report TR07-119.