Thomas Kalinowski

Newcastle, Australia

top accounts reputation activity subscriptions

Another variant of PARTITION

cc.complexity-theory reference-request partition-problem subset-sum asked Apr 28, 2014 at 23:24

cstheory.stackexchange.com

9 votes

Is the complexity of this covering problem known?

cc.complexity-theory graph-theory co.combinatorics optimization asked Apr 15, 2015 at 3:47

cstheory.stackexchange.com

8 votes

An extremal problem for graphs having every edge contained in a 4-clique

graph-theory extremal-graph-theory co.combinatorics asked Mar 11, 2011 at 4:40

mathoverflow.net

8 votes

Examples for a kind of "set family hitting" problem

reference-request scheduling set-covering asked Jul 7, 2019 at 0:10

or.stackexchange.com

7 votes

Graphs with many triangles but few complete graphs on 4 vertices

co.combinatorics graph-theory extremal-graph-theory asked Feb 1, 2011 at 23:50

mathoverflow.net

7 votes

Combinatorial discrepancy of the system of all cuts

graph-theory co.combinatorics discrepancy asked Jul 24, 2015 at 8:28

cstheory.stackexchange.com

5 votes

lower bound for difference between max cut and min cut

graph-theory co.combinatorics optimization asked Oct 6, 2014 at 20:45

cstheory.stackexchange.com

5 votes

Does the following type of hitting problem have a name?

reference-request packing covering-problems asked Jul 4, 2019 at 1:36

cstheory.stackexchange.com

5 votes

Approximation for accumulative set cover

approximation-algorithms approximation-hardness asked Apr 14, 2013 at 9:53

cstheory.stackexchange.com

Top Answers

Collection of conjectures and open problems in graph theory

mathoverflow.net

List of proofs where existence through probabilistic method has not been constructivised

mathoverflow.net

Atlas-like websites on specific areas of mathematics

mathoverflow.net

When is the McCormick envelope exact?

or.stackexchange.com

What can be solved with semidefinite programming that can't be solved with linear programming?

cstheory.stackexchange.com

Modern Mathematical Achievements Accessible to Undergraduates

mathoverflow.net

Combinatorial databases

mathoverflow.net

Recommended books/materials for practical applications of Operations Research in industry

or.stackexchange.com

Number of vertices present in all maximum matchings

cstheory.stackexchange.com

References for literature from mathematicians who provided critiques and proposals concerning ethical aspects of mathematics research

mathoverflow.net

Is group theory useful in any way to optimization?

mathoverflow.net

covering designs of the form $(v,k,2)$

mathoverflow.net

A question of Erdős

mathoverflow.net

Applications of pure mathematics in operations research

or.stackexchange.com

Integer solution to special system of linear equations

mathoverflow.net

Category theory & geometric measure theory?

mathoverflow.net

Is there a simple test to determine whether a polytope is integral?

mathoverflow.net

Stable Household Formation

mathoverflow.net

"Gray code" for building teams

mathoverflow.net

Applications of linear programming duality in combinatorics

mathoverflow.net

A generalization of Erdős-Ko-Rado theorem

mathoverflow.net

Is the complexity of this covering problem known?

cstheory.stackexchange.com

Travelling Salesman Problem where a subset of the nodes must be visited in a particular order

cstheory.stackexchange.com

Is this graph well known?

mathoverflow.net

Clique weight-optimal matchings on n-partite graphs.

mathoverflow.net

Kovari-Sos-Turan theorem

mathoverflow.net

Conditions required for strong duality to hold for SDPs

or.stackexchange.com

Does anybody know the complexity of finding a maximum clique in circulant graphs?

or.stackexchange.com

Values of the determinants $\det[|j-k|]_{1\le j,k\le n}$ and $\det[|j^2-k^2|]_{1\le j,k\le n}$

mathoverflow.net