The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Eran Halperin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  45. On the Inference of Ancestries in Admixed Populations. [Citation Graph (, )][DBLP]


  46. Haplotype Inference in Complex Pedigrees. [Citation Graph (, )][DBLP]


  47. Accurate Estimation of Expression Levels of Homologous Genes in RNA-seq Experiments. [Citation Graph (, )][DBLP]


  48. HAPLOPOOL: improving haplotype frequency estimation through DNA pools and phylogenetic modeling. [Citation Graph (, )][DBLP]


  49. Inference of locus-specific ancestry in closely related populations. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.455secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002