1. Piercing d-intervals;Alon;Discrete Comput. Geom.,1998
2. Covering a hypergraph of subgraphs;Alon;Discrete Math.,2002
3. Saeed Akhoondian Amiri, Ken-ichi Kawarabayashi, Stephan Kreutzer, Paul Wollan, The Erdős–Pósa property for directed graphs, 2016. ArXiv preprint arXiv:0904.0727.
4. Small edge sets meeting all triangles of a graph;Aparna Lakshmanan;Graphs Combin.,2011
5. Maximum number of fixed points in regulatory boolean networks;Aracena;Bull. Math. Biol.,2008