@InProceedings{preier_et_al:LIPIcs.ISAAC.2018.13,
  author =	{Prei{\ss}er, Johanna E. and Schmidt, Jens M.},
  title =	{{Computing Vertex-Disjoint Paths in Large Graphs Using MAOs}},
  booktitle =	{29th International Symposium on Algorithms and Computation (ISAAC 2018)},
  pages =	{13:1--13:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-094-1},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{123},
  editor =	{Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.13},
  URN =		{urn:nbn:de:0030-drops-99613},
  doi =		{10.4230/LIPIcs.ISAAC.2018.13},
  annote =	{Keywords: Computing Disjoint Paths, Large Graphs, Vertex-Connectivity, Linear-Time, Maximal Adjacency Ordering, Maximum Cardinality Search, Big Data, Certifying Algorithm}
}