On the complexity of deciding degeneracy in a bimatrix game with sparse payoff matrix Fulltext Access 6 Pages 2013
Exact computation of the hypergraph Turán function for expanded complete 2-graphs Fulltext Access 6 Pages 2013
The smallest degree sum that yields graphic sequences with a Z3-connected realization Fulltext Access 6 Pages 2013
A note on distance-regular graphs with a small number of vertices compared to the valency Fulltext Access 6 Pages 2013
Sufficient conditions for a planar graph to be list edge ΔΔ-colorable and list totally (Δ+1)(Δ+1)-colorable Fulltext Access 6 Pages 2013
The asymptotic number of spanning forests of complete bipartite labelled graphs Fulltext Access 6 Pages 2013
Relating the annihilation number and the total domination number of a tree Fulltext Access 6 Pages 2013
Two hardness results for core stability in hedonic coalition formation games Fulltext Access 6 Pages 2013
Job release scheduling problem: Complexity and an approximation algorithm Fulltext Access 6 Pages 2013
Further hardness results on the rainbow vertex-connection number of graphs Fulltext Access 6 Pages 2013
A polynomial double reversal minimization algorithm for deterministic finite automata Fulltext Access 6 Pages 2013