Self-complementary hypergraphs and their self-complementing permutations Fulltext Access 4 Pages 2006
Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines Fulltext Access 5 Pages 2006
Constructing one-regular graphs of valency 4k4k with non-cyclic vertex stabilizer Fulltext Access 5 Pages 2006
Some relations among term rank, clique number and list chromatic number of a graph Fulltext Access 5 Pages 2006
Simultaneous graph parameters: Factor domination and factor total domination Fulltext Access 5 Pages 2006
Connected factors in K1,nK1,n-free graphs containing an [a,b][a,b]-factor Fulltext Access 5 Pages 2006
On sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles Fulltext Access 5 Pages 2006
What are the Fundamental Structures of Concurrency?: We still don't know! Fulltext Access 5 Pages 2006
A simple expected running time analysis for randomized “divide and conquer” algorithms Fulltext Access 5 Pages 2006
Fast neighborhood search for the single machine total weighted tardiness problem Fulltext Access 5 Pages 2006
A 1-center problem on the plane with uniformly distributed demand points Fulltext Access 5 Pages 2006
Online and semi-online scheduling of two machines under a grade of service provision Fulltext Access 5 Pages 2006
Process Calculi: The End of the Beginning?: (From Thought Experiments to Experimental Semantics) Fulltext Access 5 Pages 2006