Skip to main content
Theoretical Computer Science
Austin Buchanan's user avatar
Austin Buchanan's user avatar
Austin Buchanan's user avatar
Austin Buchanan
  • Member for 11 years, 8 months
  • Last seen more than a month ago
Profile Activity
Stats
1,166
reputation
40k
reached
19
answers
15
questions
Communities
View all
About

Associate Professor at Oklahoma State University, research interests in combinatorial optimization and integer programming.

blog: https://farkasdilemma.wordpress.com/

academic page: https://austinlbuchanan.github.io/

twitter: https://twitter.com/AustinLBuchanan

Badges
View all badges
1
gold badge
17
silver badges
28
bronze badges
Top tags
View all tags
38
Score
7
Posts
21
Posts %
37
Score
7
Posts
21
Posts %
34
Score
11
Posts
32
Posts %
29
Score
9
Posts
26
Posts %
17
Score
6
Posts
18
Posts %
17
Score
5
Posts
15
Posts %
Top posts
View all questions and answers
question
28
Reasons to believe $P \ne NP \cap coNP$ (or not)
Nov 23, 2013
question
17
Linear-time algorithm to test if clique number equals degeneracy bound?
Nov 30, 2020
answer
15
Parameterized complexity from P to NP-hard and back again
Dec 6, 2013
question
15
How can a problem be in NP, be NP-hard and not NP-complete?
Mar 23, 2013
answer
14
What is complexity of this max-edge subgraph problem?
May 21, 2013
answer
14
Algorithms for finding clique in bounded-degree graph
Jul 12, 2013
answer
11
What Lecture Notes Should Everyone Read?
Nov 1, 2013
question
10
Exact exponential-time algorithms for 0-1 programming
Jul 27, 2013
question
9
Exact exponential-time algorithms for 0-1 programs with nonnegative data
Aug 24, 2013
question
9
When does a graph admit an orientation in which there is at most one s-t walk?
May 7, 2015
Top network posts
View all network posts
17
What instances can be solved today by modern solvers (pure LP)?
13
Complexity of verifying optimality in (mixed) integer programming
13
Does coNP-completeness imply NP-hardness?
12
Notation for unordered product of sets
11
Do solvers use GUB/SOS1 branching?