Mikkel Thorup
Professor
Algorithms and Complexity
Universitetsparken 1, 2100 København Ø, Building: 1-2-30A
Most downloads
-
2396 downloadsPublished
Coloring 3-colorable graphs with o(n 1/5) colors
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
-
92 downloadsPublished
Incremental exact min-cut in poly-logarithmic amortized update time
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
-
88 downloadsPublished
Finding the maximum subset with bounded convex curvature
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
-
58 downloadsPublished
Faster worst case deterministic dynamic connectivity
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
-
55 downloadsPublished
Bottleneck paths and trees and deterministic graphical games
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
ID: 34257574
Most downloads
-
2396
downloads
Coloring 3-colorable graphs with o(n 1/5) colors
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published -
92
downloads
Incremental exact min-cut in poly-logarithmic amortized update time
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published -
88
downloads
Finding the maximum subset with bounded convex curvature
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published