@InProceedings{lokshtanov_et_al:LIPIcs.ICALP.2023.90,
  author =	{Lokshtanov, Daniel and Saurabh, Saket and Surianarayanan, Vaishali},
  title =	{{Breaking the All Subsets Barrier for Min k-Cut}},
  booktitle =	{50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
  pages =	{90:1--90:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-278-5},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{261},
  editor =	{Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.90},
  URN =		{urn:nbn:de:0030-drops-181422},
  doi =		{10.4230/LIPIcs.ICALP.2023.90},
  annote =	{Keywords: Exact algorithms, min k-cut, exponential algorithms, graph algorithms, k-way cut}
}