<?xml version="1.0"?>
<dblp>
<article key="journals/eccc/BenjaminiSS08" mdate="2009-02-13">
<author>Itai Benjamini</author>
<author>Oded Schramm</author>
<author>Asaf Shapira</author>
<title>Every Minor-Closed Property of Sparse Graphs is Testable.</title>
<year>2008</year>
<volume>15</volume>
<journal>Electronic Colloquium on Computational Complexity (ECCC)</journal>
<ee>http://eccc.hpi-web.de/eccc-reports/2008/TR08-010/index.html</ee>
<number>010</number>
<url>db/journals/eccc/eccc15.html#BenjaminiSS08</url>
</article>
</dblp>
