Travis Service

277

Reputation

1072 views

Registered User

Name	Travis Service
Member for	3 years
Seen	Nov 7 at 6:43
Website
Location
Age

PhD Student at Vanderbilt University

stats recent reputation favorites

2

Questions

1

5

votes

0

answers

548

views

Counting graphs whose vertex induced subgraphs are members of a fixed set

graph-theory co.combinatorics

apr 2 10 at 13:13 Travis Service 277●2●7

1

vote

2

answers

1k

views

Algorithmic aspects of maximizing a convex function over a convex set

co.combinatorics na.numerical-analysis

mar 8 10 at 4:31 Suresh Venkat 2,687●8●17

5

Answers

votes newest views recent

Is that possible to find an algorithm with complexity of O(n) to find an acyclic graph?

Which method to apply to this problem?

What is the minimal size of a partial order that is universal for all partial orders of size n?

How to write IF…ELSE as mathematic equation?

is there a name for this type of function ?

59

Votes

58

1

8

Tags

na.numerical-analysis× 3
co.combinatorics× 3
graph-theory× 2
tag-removed
order-theory
oc.optimization-control
lo.logic
computer-science

9

Badges

● Popular Question
● Yearling

● Critic
● Enthusiast

● Editor
● Teacher

● Supporter
● Scholar