@article{Durand2007, 
     arxivid = "cs/0507020", 
     author = "Durand, Arnaud and Grandjean, Etienne", 
     doi = "10.1145/1276920.1276923", 
     eprint = "0507020", 
     issn = "15293785", 
     journal = "ACM Transactions on Computational Logic", 
     keyword = "Computational complexity,enumeration problems,first-order logic", 
     link = "http://dl.acm.org/citation.cfm?id=1276920.1276923 http://arxiv.org/abs/cs/0507020", 
     month = "aug", 
     number = "4", 
     pages = "18", 
     publisher = "ACM", 
     title = "First-order queries on structures of bounded degree are computable with constant delay", 
     uri = "http://dl.acm.org/citation.cfm?id=1276920.1276923", 
     volume = "8", 
     year = "2005", 
}

Problems: 262