Eran Halperin

From MaRDI portal
Revision as of 08:47, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:964235

Available identifiers

zbMath Open halperin.eranMaRDI QIDQ964235

List of research outcomes





PublicationDate of PublicationType
A stochastic process on the hypercube with applications to peer-to-peer networks2010-08-16Paper
Polylogarithmic inapproximability2010-08-16Paper
Asymmetric k-center is log * n -hard to approximate2010-08-15Paper
Increasing the power of association studies by imputation-based sparse tag SNP selection2010-04-15Paper
Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction2009-03-12Paper
Asymmetric k -center is log * n -hard to approximate2008-12-21Paper
Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees2008-12-09Paper
Integrality Ratio for Group Steiner Trees and Directed Steiner Trees2007-10-22Paper
An improved approximation algorithm for vertex cover with hard capacities2006-01-10Paper
The minimum-entropy set cover problem2006-01-09Paper
Research in Computational Molecular Biology2005-11-23Paper
Automata, Languages and Programming2005-08-24Paper
Performance aspects of distributed caches using TTL-based consistency2005-04-06Paper
MAX CUT in cubic graphs2005-02-16Paper
https://portal.mardi4nfdi.de/entity/Q48289752004-11-29Paper
https://portal.mardi4nfdi.de/entity/Q48290332004-11-29Paper
https://portal.mardi4nfdi.de/entity/Q44713092004-07-28Paper
https://portal.mardi4nfdi.de/entity/Q44491732004-02-08Paper
Reachability and Distance Queries via 2-Hop Labels2003-09-28Paper
https://portal.mardi4nfdi.de/entity/Q27682652003-09-15Paper
https://portal.mardi4nfdi.de/entity/Q44112852003-07-07Paper
Coloring -colorable graphs using relatively small palettes2003-05-14Paper
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs2002-12-01Paper
https://portal.mardi4nfdi.de/entity/Q27683122002-10-24Paper
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs2002-09-29Paper
A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems2002-07-01Paper
https://portal.mardi4nfdi.de/entity/Q45376992002-07-01Paper
https://portal.mardi4nfdi.de/entity/Q45350612002-06-12Paper
https://portal.mardi4nfdi.de/entity/Q49526352000-05-10Paper
https://portal.mardi4nfdi.de/entity/Q42637131999-09-22Paper
Bipartite subgraphs of integer weighted graphs1998-04-01Paper

Research outcomes over time

This page was built for person: Eran Halperin

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:964235&oldid=5917429"
Powered by MediaWiki