1. COMPLEXITY RESULTS FOR SAS+PLANNING
2. Baptiste P. and Le Pape C. 1996. Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling. Proceedings of the Fifteenth Workshop of the U.K. Planning Special Interest Group (PLANSIG), Liverpool, U.K.
3. Barták R. 2011. On constraint models for parallel planning: The novel transition scheme. Proceedings of the Eleventh Scandinavian Conference on Artificial Intelligence (SCAI), Frontiers of Artificial Intelligence, Vol.227, IOSPress, Trondheim, Norway, pp.50-59.
4. Barták R. and Cepek O . 2007. Temporal networks with alternatives: Complexity and model. Proceedings of the Twentieth International Florida AI Research Society Conference (FLAIRS), AAAI Press, Menlo Park, CA, pp.641-646.
5. Barták R. Cully M. Jaska M. Novák L. Rovenský V. Sheahan C. Skalický T. , and Thanh-Tung D . 2011. Workflow optimization with flowopt, on modelling, optimizing, visualizing, and analysing production workflows. Proceedings of Conference on Technologies and Applications of Artificial Intelligence (TAAI), IEEE Conference Publishing Services, Taoyuan, Taiwan, pp.167-172.