BibSLEIGH — Solving Planar k-Terminal Cut in $O(n^(c√k)) Time

Philip N. Klein, Dániel Marx
Solving Planar k-Terminal Cut in $O(n^(c√k)) Time
ICALP, 2012.

ICALP v1 2012

@inproceedings{ICALP-v1-2012-KleinM,
	author        = "Philip N. Klein and Dániel Marx",
	booktitle     = "{Proceedings of the 39th International Colloquium on Automata, Languages, and Programming, Part I}",
	doi           = "10.1007/978-3-642-31594-7_48",
	isbn          = "978-3-642-31593-0",
	pages         = "569--580",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Solving Planar k-Terminal Cut in $O(n^(c√k)) Time}",
	volume        = 7391,
	year          = 2012,
}

Philip N. Klein, Dániel MarxSolving Planar k-Terminal Cut in $O(n^(c√k)) TimeICALP, 2012.

Philip N. Klein, Dániel Marx
Solving Planar k-Terminal Cut in $O(n^(c√k)) Time
ICALP, 2012.