2008 | ||
---|---|---|
48 | EE | Sriram Sankararaman, Gad Kimmel, Eran Halperin, Michael I. Jordan: On the Inference of Ancestries in Admixed Populations. RECOMB 2008: 424-433 |
2007 | ||
47 | EE | Srinath Sridhar, Satish Rao, Eran Halperin: An Efficient and Accurate Graph-Based Approach to Detect Population Substructure. RECOMB 2007: 503-517 |
46 | EE | Kamalika Chaudhuri, Eran Halperin, Satish Rao, Shuheng Zhou: A rigorous analysis of population stratification with limited data. SODA 2007: 1046-1055 |
45 | EE | Bonnie Kirkpatrick, Carlos Santos Armendariz, Richard M. Karp, Eran Halperin: HAPLOPOOL: improving haplotype frequency estimation through DNA pools and phylogenetic modeling. Bioinformatics 23(22): 3048-3055 (2007) |
44 | EE | Srinath Sridhar, Kedar Dhamdhere, Guy E. Blelloch, Eran Halperin, R. Ravi, Russell Schwartz: Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice. IEEE/ACM Trans. Comput. Biology Bioinform. 4(4): 561-571 (2007) |
43 | EE | Eran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, Nan Wang: Integrality Ratio for Group Steiner Trees and Directed Steiner Trees. SIAM J. Comput. 36(5): 1494-1511 (2007) |
2006 | ||
42 | EE | Eran Halperin: SNP and Haplotype Analysis - Algorithms and Applications. CPM 2006: 11-11 |
41 | EE | Guy E. Blelloch, Kedar Dhamdhere, Eran Halperin, R. Ravi, Russell Schwartz, Srinath Sridhar: Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction. ICALP (1) 2006: 667-678 |
40 | EE | Srinath Sridhar, Kedar Dhamdhere, Guy E. Blelloch, Eran Halperin, R. Ravi, Russell Schwartz: Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees. International Conference on Computational Science (2) 2006: 799-806 |
39 | EE | Eleazar Eskin, Roded Sharan, Eran Halperin: A Note on Phasing Long Genomic Regions Using Local Haplotype Predictions. J. Bioinformatics and Computational Biology 4(3): 639-648 (2006) |
38 | EE | Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan: An improved approximation algorithm for vertex cover with hard capacities. J. Comput. Syst. Sci. 72(1): 16-33 (2006) |
37 | EE | Eran Halperin, Elad Hazan: HAPLOFREQ-Estimating Haplotype Frequencies Efficiently. Journal of Computational Biology 13(2): 481-500 (2006) |
2005 | ||
36 | EE | Eran Halperin, Gad Kimmel, Ron Shamir: Tag SNP selection in genotype data for maximizing SNP prediction accuracy. ISMB (Supplement of Bioinformatics) 2005: 195-203 |
35 | EE | Eran Halperin, Elad Hazan: HAPLOFREQ - Estimating Haplotype Frequencies E.ciently. RECOMB 2005: 553-568 |
34 | EE | Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Robert Krauthgamer, Joseph Naor: Asymmetric k-center is log* n-hard to approximate. J. ACM 52(4): 538-551 (2005) |
33 | EE | Edith Cohen, Eran Halperin, Haim Kaplan: Performance aspects of distributed caches using TTL-based consistency. Theor. Comput. Sci. 331(1): 73-96 (2005) |
32 | EE | Eran Halperin, Richard M. Karp: The minimum-entropy set cover problem. Theor. Comput. Sci. 348(2-3): 240-250 (2005) |
2004 | ||
31 | EE | Eran Halperin, Richard M. Karp: The Minimum-Entropy Set Cover Problem. ICALP 2004: 733-744 |
30 | EE | Eran Halperin, Richard M. Karp: Perfect phylogeny and haplotype assignment. RECOMB 2004: 10-19 |
29 | EE | Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Joseph Naor: Asymmetric k-center is log* n-hard to approximate. STOC 2004: 21-27 |
28 | EE | Eran Halperin, Eleazar Eskin: Haplotype reconstruction from genotype data using Imperfect Phylogeny. Bioinformatics 20(12): 1842-1849 (2004) |
27 | EE | Eran Halperin, Dror Livnat, Uri Zwick: MAX CUT in cubic graphs. J. Algorithms 53(2): 169-185 (2004) |
2003 | ||
26 | EE | Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan: An Improved Approximation Algorithm for Vertex Cover with Hard Capacities. ICALP 2003: 164-175 |
25 | EE | Eran Halperin, Jeremy Buhler, Richard M. Karp, Robert Krauthgamer, Ben Westover: Detecting protein sequence conservation via metric embeddings. ISMB (Supplement of Bioinformatics) 2003: 122-129 |
24 | EE | Eleazar Eskin, Eran Halperin, Richard M. Karp: Large scale reconstruction of haplotypes from genotype data. RECOMB 2003: 104-113 |
23 | EE | Eran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, Nan Wang: Integrality ratio for group Steiner trees and directed steiner trees. SODA 2003: 275-284 |
22 | EE | Micah Adler, Eran Halperin, Richard M. Karp, Vijay V. Vazirani: A stochastic process on the hypercube with applications to peer-to-peer networks. STOC 2003: 575-584 |
21 | EE | Eran Halperin, Robert Krauthgamer: Polylogarithmic inapproximability. STOC 2003: 585-594 |
20 | EE | Eran Halperin, Guy Kortsarz, Robert Krauthgamer: Tight lower bounds for the asymmetric k-center problem Electronic Colloquium on Computational Complexity (ECCC) 10(035): (2003) |
19 | EE | Eran Halperin, Shay Halperin, Tzvika Hartman, Ron Shamir: Handling Long Targets and Errors in Sequencing by Hybridization. Journal of Computational Biology 10(3/4): 483-497 (2003) |
18 | EE | Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick: Reachability and Distance Queries via 2-Hop Labels. SIAM J. Comput. 32(5): 1338-1355 (2003) |
2002 | ||
17 | EE | Eran Halperin, Aravind Srinivasan: Improved Approximation Algorithms for the Partial Vertex Cover Problem. APPROX 2002: 161-174 |
16 | EE | Eran Halperin, Shay Halperin, Tzvika Hartman, Ron Shamir: Handling long targets and errors in sequencing by hybridization. RECOMB 2002: 176-185 |
15 | EE | Eran Halperin, Dror Livnat, Uri Zwick: MAX CUT in cubic graphs. SODA 2002: 506-513 |
14 | EE | Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick: Reachability and distance queries via 2-hop labels. SODA 2002: 937-946 |
13 | EE | Eran Halperin, Ram Nathaniel, Uri Zwick: Coloring k-colorable graphs using relatively small palettes. J. Algorithms 45(1): 72-90 (2002) |
12 | EE | Eran Halperin, Uri Zwick: A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems. Random Struct. Algorithms 20(3): 382-402 (2002) |
11 | EE | Eran Halperin: Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs. SIAM J. Comput. 31(5): 1608-1623 (2002) |
2001 | ||
10 | EE | Edith Cohen, Eran Halperin, Haim Kaplan: Performance Aspects of Distributed Caches Using TTL-Based Consistency. ICALP 2001: 744-756 |
9 | EE | Eran Halperin, Uri Zwick: A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems. IPCO 2001: 210-225 |
8 | EE | Eran Halperin, Uri Zwick: Combinatorial approximation algorithms for the maximum directed cut problem. SODA 2001: 1-7 |
7 | EE | Eran Halperin, Ram Nathaniel, Uri Zwick: Coloring k-colorable graphs using smaller palettes. SODA 2001: 319-326 |
6 | EE | Eran Halperin, Ram Nathaniel, Uri Zwick: Coloring k-colorable graphs using relatively small palettes CoRR cs.DS/0105029: (2001) |
5 | Eran Halperin, Uri Zwick: Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs. J. Algorithms 40(2): 184-211 (2001) | |
2000 | ||
4 | EE | Eran Halperin: Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. SODA 2000: 329-337 |
1999 | ||
3 | EE | Eran Halperin, Uri Zwick: Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs. IPCO 1999: 202-217 |
2 | Eran Halperin, Simchon Faigler, Raveh Gill-More: FramePlus: aligning DNA to protein sequences. Bioinformatics 15(11): 867-873 (1999) | |
1998 | ||
1 | EE | Noga Alon, Eran Halperin: Bipartite subgraphs of integer weighted graphs. Discrete Mathematics 181(1-3): 19-29 (1998) |