Étienne Grandjean

1. First-order queries on structures of bounded degree are computable with constant delay
   2005/07/07 by Arnaud Durand, Etienne Grandjean, Étienne Grandjean +2 · 3 citations
   Computer Science · #Advanced Database Systems and Queries #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #cs.CC #cs.LO
2. The complexity of acyclic conjunctive queries revisited
   2006/05/02 by Arnaud Durand, Durand, Arnaud, Etienne Grandjean +2 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Graph Labeling and Dimension Problems #cs.LO