@InProceedings{he_et_al:LIPIcs.ESA.2021.52,
  author =	{He, Zhiyang and Li, Jason and Wahlstr\"{o}m, Magnus},
  title =	{{Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs}},
  booktitle =	{29th Annual European Symposium on Algorithms (ESA 2021)},
  pages =	{52:1--52:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-204-4},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{204},
  editor =	{Mutzel, Petra and Pagh, Rasmus and Herman, Grzegorz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.52},
  URN =		{urn:nbn:de:0030-drops-146331},
  doi =		{10.4230/LIPIcs.ESA.2021.52},
  annote =	{Keywords: graph theory, vertex sparsifier, representative family, matroid}
}