1. The complexity of coloring by semicomplete digraphs;Bang-Jensen;SIAM J. Disc. Math.,1988
2. Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT;Berman;Electronic Colloquium on Computational Complexity (ECCC),2003
3. The monadic second order logic of graphs VI: On several representations of graphs by relational structures;Courcelle;Disc. Appl. Math.,1994
4. Oriented coloring: complexity and approximation;Culus;LNCS,2006
5. New Results on the Complexity of Oriented coloring on Restricted Digraph Classes;Ganian;LNCS,2010