Daniel Reichman Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2012
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Daniel Reichman: New bounds for contagious sets. Discrete Mathematics 312(10): 1812-1814 (2012)
2011
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Uriel Feige, Daniel Reichman: Recoverable Values for Independent Sets. ICALP (1) 2011: 486-497
i4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Uriel Feige, Daniel Reichman: Recoverable Values for Independent Sets. CoRR abs/1103.5609 (2011)
i3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Simon Korman, Daniel Reichman, Gilad Tsur: Tight Approximation of Image Matching. CoRR abs/1111.1713 (2011)
2010
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Daniel Reichman: Influence is a Matter of Degree: New Algorithms for Activation Problems. CoRR abs/1009.3619 (2010)
2008
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Zeev Nutov, Daniel Reichman: Approximating maximum satisfiable subsystems of linear equations of bounded width. Inf. Process. Lett. 106(5): 203-207 (2008)
2006
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Uriel Feige, Daniel Reichman: On the hardness of approximating Max-Satisfy. Inf. Process. Lett. 97(1): 31-35 (2006)
2004
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Uriel Feige, Daniel Reichman: On Systems of Linear Equations with Two Variables per Equation. APPROX-RANDOM 2004: 117-127
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Uriel Feige, Daniel Reichman: On The Hardness of Approximating Max-Satisfy. Electronic Colloquium on Computational Complexity (ECCC)(119) (2004)

Coauthor Index

1Uriel Feige
[c2] [i4] [j1] [c1] [i1]
2Simon Korman
[i3]
3Zeev Nutov
[j2]
4Gilad Tsur
[i3]
Last update Fri May 24 07:56:46 2013 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page