Home
University of Bergen
Algorithms

Two papers from Bergen to be presented at FOCS 2013

At FOCS 2013, one of the two highest ranked conferences in Theoretical Computer Science, the following two papers will be presented, with co-authors associated to Bergen highlighted in boldface:

Main content

By Pinar HeggernesPublished: 26.08.2013

  • Hans Bodlaender, Pål Drange, Markus Dregi, Fedor Fomin, Daniel Lokshtanov and Michał Pulipczuk: An O(c^k) n 5-Approximation Algorithm for Treewidth.

  • Marek Cygan, Daniel Marx, Marcin Pilipczuk and Michał Pilipczuk: The planar directed k-Vertex-Disjoint Paths problem is fixed-parameter tractable.