Eran Halperin

Available identifiers

zbMath Open halperin.eranMaRDI QIDQ964235

List of research outcomes

Publication	Date of Publication	Type
A stochastic process on the hypercube with applications to peer-to-peer networks	2010-08-16	Paper
Polylogarithmic inapproximability	2010-08-16	Paper
Asymmetric k-center is log * n -hard to approximate	2010-08-15	Paper
Increasing the power of association studies by imputation-based sparse tag SNP selection	2010-04-15	Paper
Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction	2009-03-12	Paper
Asymmetric k -center is log * n -hard to approximate	2008-12-21	Paper
Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees	2008-12-09	Paper
Integrality Ratio for Group Steiner Trees and Directed Steiner Trees	2007-10-22	Paper
An improved approximation algorithm for vertex cover with hard capacities	2006-01-10	Paper
The minimum-entropy set cover problem	2006-01-09	Paper
Research in Computational Molecular Biology	2005-11-23	Paper
Automata, Languages and Programming	2005-08-24	Paper
Performance aspects of distributed caches using TTL-based consistency	2005-04-06	Paper
MAX CUT in cubic graphs	2005-02-16	Paper
https://portal.mardi4nfdi.de/entity/Q4828975	2004-11-29	Paper
https://portal.mardi4nfdi.de/entity/Q4829033	2004-11-29	Paper
https://portal.mardi4nfdi.de/entity/Q4471309	2004-07-28	Paper
https://portal.mardi4nfdi.de/entity/Q4449173	2004-02-08	Paper
Reachability and Distance Queries via 2-Hop Labels	2003-09-28	Paper
https://portal.mardi4nfdi.de/entity/Q2768265	2003-09-15	Paper
https://portal.mardi4nfdi.de/entity/Q4411285	2003-07-07	Paper
Coloring -colorable graphs using relatively small palettes	2003-05-14	Paper
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs	2002-12-01	Paper
https://portal.mardi4nfdi.de/entity/Q2768312	2002-10-24	Paper
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs	2002-09-29	Paper
A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems	2002-07-01	Paper
https://portal.mardi4nfdi.de/entity/Q4537699	2002-07-01	Paper
https://portal.mardi4nfdi.de/entity/Q4535061	2002-06-12	Paper
https://portal.mardi4nfdi.de/entity/Q4952635	2000-05-10	Paper
https://portal.mardi4nfdi.de/entity/Q4263713	1999-09-22	Paper
Bipartite subgraphs of integer weighted graphs	1998-04-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Eran Halperin