1. Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogues;Abrahamson;Ann. Pure Appl. Logic,1995
2. A fast scheduling algorithm in AND-OR graphs;Adelson-Velsky,2001
3. The combinatorics of resource sharing;Barbosa,2002
4. J.A. Barnett, T. Verma, Intelligent reliability analysis, in: 10th IEEE Conference on Artificial Intelligence for Applications, 1994, pp. 428–433.
5. Kernelization: New upper and lower bound techniques;Bodlaender,2009