@article{Acuna2012, 
     author = "Acu\~{n}a, Vicente and Birmel\'{e}, Etienne and Cottret, Ludovic and Crescenzi, Pierluigi and Jourdan, Fabien and Lacroix, Vincent and Marchetti-Spaccamela, Alberto and Marino, Andrea and Milreu, Paulo Vieira and Sagot, Marie-France and Stougie, Leen", 
     doi = "10.1016/j.tcs.2012.07.023", 
     issn = "03043975", 
     journal = "Theoretical Computer Science", 
     keyword = "Feedback arc set,Maximal DAG,Story arc set", 
     link = "http://www.sciencedirect.com/science/article/pii/S0304397512007207 http://linkinghub.elsevier.com/retrieve/pii/S0304397512007207", 
     month = "oct", 
     number = "0", 
     pages = "1--9", 
     title = "Telling Stories: Enumerating Maximal Directed Acyclic Graphs With a Constrained Set of Sources and Targets", 
     uri = "http://www.sciencedirect.com/science/article/pii/S0304397512007207", 
     volume = "457", 
     year = "2012", 
}

Problems: 200