Austin Buchanan
Assistant Professor at Oklahoma State University, research interests in combinatorial optimization and integer programming.
blog: https://farkasdilemma.wordpress.com/
academic page: https://sites.google.com/site/austinlbuchanan/
twitter: https://twitter.com/AustinLBuchanan
-
Stillwater, OK
-
Member for 8 years, 2 months
-
2 profile views
-
Last seen Feb 3 '17 at 16:01
Communities (19)
- Theoretical Computer Science 1.6k 1.6k 11 gold badge1717 silver badges2727 bronze badges
- Computer Science 629 629 55 silver badges1515 bronze badges
- Operations Research 504 504 33 silver badges1212 bronze badges
- Mathematics 203 203 11 silver badge88 bronze badges
- Personal Finance & Money 183 183 55 bronze badges
- View network profile
Top network posts
- 27 Reasons to believe $P \ne NP \cap coNP$ (or not)
- 15 How can a problem be in NP, be NP-hard and not NP-complete?
- 15 Linear-time algorithm to test if clique number equals degeneracy bound?
- 15 What instances can be solved today by modern solvers (pure LP)?
- 14 What is complexity of this max-edge subgraph problem?
- 14 Algorithms for finding clique in bounded-degree graph
- 14 Parameterized complexity from P to NP-hard and back again
- View more network posts →
Keeping a low profile.
This user hasn't posted yet.
Badges (10)
Gold
—
Silver
8
Rarest
Bronze
2
Rarest
-
Sep 7 '13
-
Aug 26 '13