2009 | ||
---|---|---|
66 | EE | 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) |
2008 | ||
65 | EE | Bhaskar DasGupta, Jin Jun, Ion I. Mandoiu: Primer Selection Methods for Detection of Genomic Inversions and Deletions via PAMP. APBC 2008: 353-362 |
64 | EE | Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp, Louxin Zhang: Nearest Neighbor Interchange and Related Distances. Encyclopedia of Algorithms 2008 |
63 | EE | Bhaskar DasGupta, Lusheng Wang: Biology Computing. Wiley Encyclopedia of Computer Science and Engineering 2008 |
62 | EE | 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) |
61 | EE | 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. Bioinformatics 24(2): 293-295 (2008) |
60 | EE | Piotr Berman, Bhaskar DasGupta, Marek Karpinski: Approximating Transitivity in Directed Networks CoRR abs/0809.0188: (2008) |
59 | EE | Piotr Berman, Bhaskar DasGupta: Approximating the online set multicover problems via randomized winnowing. Theor. Comput. Sci. 393(1-3): 54-71 (2008) |
2007 | ||
58 | EE | 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 |
57 | EE | Joe Dundas, T. Andrew Binkowski, Bhaskar DasGupta, Jie Liang: Topology Independent Protein Structural Alignment. WABI 2007: 171-182 |
56 | EE | 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 |
55 | EE | Piotr Berman, Bhaskar DasGupta, Jie Liang: Foreword. Algorithmica 48(4): 301 (2007) |
54 | EE | 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. Discrete Applied Mathematics 155(6-7): 719-732 (2007) |
53 | EE | Piotr Berman, Bhaskar DasGupta, Eduardo D. 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) |
52 | EE | Piotr Berman, Bhaskar DasGupta: Approximating the Online Set Multicover Problems Via Randomized Winnowing. Electronic Colloquium on Computational Complexity (ECCC) 14(092): (2007) |
51 | EE | Piotr Berman, Bhaskar DasGupta, Marek Karpinski: Approximating Transitive Reductions for Directed Networks. Electronic Colloquium on Computational Complexity (ECCC) 14(119): (2007) |
50 | EE | 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) |
49 | EE | 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. Journal of Computational Biology 14(7): 927-949 (2007) |
2006 | ||
48 | EE | Bhaskar DasGupta, German A. Enciso, Eduardo D. Sontag, Yi Zhang: Algorithmic and Complexity Results for Decompositions of Biological Networks into Monotone Subsystems. WEA 2006: 253-264 |
47 | EE | Réka Albert, Bhaskar DasGupta, Riccardo Dondi, Eduardo D. Sontag: Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs Electronic Colloquium on Computational Complexity (ECCC)(010): (2006) |
46 | EE | Derong Liu, Xiaoxu Xiong, Bhaskar DasGupta, Huaguang Zhang: Motif discoveries in unaligned molecular sequences using self-organizing neural networks. IEEE Transactions on Neural Networks 17(4): 919-928 (2006) |
45 | EE | 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) |
2005 | ||
44 | EE | Bhaskar DasGupta, Sergio Ferrarini, Uthra Gopalakrishnan, Nisha Raj Paryani: Inapproximability Results for the Lateral Gene Transfer Problem. ICTCS 2005: 182-195 |
43 | EE | 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 |
42 | EE | Piotr Berman, Bhaskar DasGupta: Approximating the Online Set Multicover Problems via Randomized Winnowing. WADS 2005: 110-121 |
41 | EE | Bhaskar DasGupta, Kishori M. Konwar, Ion I. Mandoiu, Alexander A. Shvartsman: DNA-BAR: distinguisher selection for DNA barcoding. Bioinformatics 21(16): 3424-3426 (2005) |
40 | EE | Bhaskar DasGupta, Kishori M. Konwar, Ion I. Mandoiu, Alexander A. Shvartsman: Highly Scalable Algorithms for Robust String Barcoding CoRR abs/cs/0502065: (2005) |
39 | EE | Bhaskar DasGupta, Kishori M. Konwar, Ion I. Mandoiu, Alexander A. Shvartsman: Highly scalable algorithms for robust string barcoding. IJBRA 1(2): 145-161 (2005) |
38 | EE | 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) |
37 | EE | 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) |
36 | EE | Bhaskar DasGupta, Barbara Hammer: On approximate learning by multi-layered feedforward circuits. Theor. Comput. Sci. 348(1): 95-127 (2005) |
2004 | ||
35 | EE | 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 |
34 | EE | 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 |
33 | EE | Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao: Tight Approximability Results for Test Set Problems in Bioinformatics. SWAT 2004: 39-50 |
32 | EE | Madhuri Karnik, Bhaskar DasGupta, Vinayak Eswaran: A comparative study of Dirichlet and Neumann conditions for path planning through harmonic functions. Future Generation Comp. Syst. 20(3): 441-452 (2004) |
31 | EE | 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. Journal of Computational Biology 11(4): 766-785 (2004) |
2003 | ||
30 | EE | Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan: Approximation algorithms for MAX-MIN tiling. J. Algorithms 47(2): 122-134 (2003) |
2002 | ||
29 | EE | 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 |
28 | EE | Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan: Slice and dice: a simple, improved approximate tiling recipe. SODA 2002: 455-464 |
27 | EE | Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan: Simple approximation algorithm for nonoverlapping local alignments. SODA 2002: 677-678 |
26 | EE | 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 |
25 | EE | Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan: Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms. SIAM J. Discrete Math. 15(2): 252-267 (2002) |
2001 | ||
24 | EE | Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami: Improved approximation algorithms for rectangle tiling and packing. SODA 2001: 427-436 |
23 | EE | 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) |
22 | EE | 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) |
2000 | ||
21 | EE | Bhaskar DasGupta, Barbara Hammer: On Approximate Learning by Multi-layered Feedforward Circuits. ALT 2000: 264-278 |
20 | EE | Bhaskar DasGupta, Michael A. Palis: Online real-time preemptive scheduling of jobs with deadlines. APPROX 2000: 96-107 |
19 | EE | Piotr Berman, Bhaskar DasGupta: Improvements in throughout maximization for real-time scheduling. STOC 2000: 680-687 |
18 | EE | Karhan Akcoglu, James Aspnes, Bhaskar DasGupta, Ming-Yang Kao: Opportunity Cost Algorithms for Combinatorial Auctions CoRR cs.CE/0010031: (2000) |
17 | Piotr Berman, Bhaskar DasGupta: Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling. J. Comb. Optim. 4(3): 307-323 (2000) | |
1999 | ||
16 | Bhaskar DasGupta, Sudip Dasgupta, Atal Chowdhury: Generalized Approach towards the Fault Diagnosis in Any Arbitrarily Connected Networks. HiPC 1999: 404-410 | |
15 | EE | 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) |
14 | EE | Gerard J. Chang, Bhaskar DasGupta, Wayne M. Dymàcek, Martin Fürer, Matthew Koerlin, Yueh-Shin Lee, Tom Whaley: Characterizations of bipartite Steinhaus graphs. Discrete Mathematics 199(1-3): 11-25 (1999) |
13 | Bhaskar DasGupta, Michael A. Palis: Provably Good Algorithms for Transmission Scheduling in WDM Optical Networks. J. Parallel Distrib. Comput. 57(3): 345-357 (1999) | |
1998 | ||
12 | EE | Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming Li, Elizabeth Sweedyk: On the Complexity and Approximation of Syntenic Distance. Discrete Applied Mathematics 88(1-3): 59-82 (1998) |
1997 | ||
11 | EE | Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming Li, Z. Sweedyk: On the complexity and approximation of syntenic distance. RECOMB 1997: 99-108 |
10 | Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp, Louxin Zhang: On Distances between Phylogenetic Trees (Extended Abstract). SODA 1997: 427-436 | |
9 | Piotr Berman, Bhaskar DasGupta: Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems. Algorithmica 17(4): 331-356 (1997) | |
8 | Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid, Bhaskar DasGupta: The Rectangle Enclosure and Point-Dominance Problems Revisited. Int. J. Comput. Geometry Appl. 7(5): 437-455 (1997) | |
1996 | ||
7 | Bhaskar DasGupta, Eduardo D. Sontag: Sample complexity for learning recurrent perceptron mappings. IEEE Transactions on Information Theory 42(5): 1479-1487 (1996) | |
6 | Bhaskar DasGupta, Georg Schnitger: Analog versus discrete neural networks. Neural Computation 8(4): 805-818 (1996) | |
1995 | ||
5 | EE | Bhaskar DasGupta, Eduardo D. Sontag: Sample Complexity for Learning Recurrent Perceptron Mappings. NIPS 1995: 204-210 |
4 | EE | Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid, Bhaskar DasGupta: The Rectangle Enclosure and Point-Dominance Problems Revisited. Symposium on Computational Geometry 1995: 162-171 |
1994 | ||
3 | EE | 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 | ||
2 | EE | Bhaskar DasGupta, Georg Schnitger: The Power of Approximation: A Comparison of Activation Functions. NIPS 1992: 615-622 |
1989 | ||
1 | Bhaskar DasGupta, C. E. Veni Madhavan: An Approximate Algorithm for the Minimal Vertex Nested Polygon Problem. Inf. Process. Lett. 33(1): 35-44 (1989) |