Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Austin Buchanan
Information about the author Austin Buchanan will soon be added to the site.
Found
2 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Solving maximum clique in sparse graphs: an O(nm+n2d/4) algorithm for d -degenerate graphs
2014
We describe an algorithm for the maximum clique problem that is parameterized by the...
On provably best construction heuristics for hard combinatorial optimization problems
2016
In this article, a heuristic is said to be provably best if, assuming P N P , no other...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers
