Konrad Piwakowski

According to our database1, Konrad Piwakowski authored at least 11 papers between 1996 and 2006.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2006
On Some Ramsey and Turan-Type Numbers for Paths and Cycles.
Electron. J. Comb., 2006

2004
Ramsey Numbers for Triangles versus Almost-Complete Graphs.
Ars Comb., 2004

2002
Complexity results on open shop scheduling to minimize total cost of operations.
Int. J. Comput. Syst. Signals, 2002

2001
The smallest hard-to-color graph for algorithm DSATUR.
Discret. Math., 2001

The Ramsey Multiplicity of K4.
Ars Comb., 2001

Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time.
Proceedings of the Parallel Processing and Applied Mathematics, 2001

1999
Computation of the Folkman number <i>F<sub>e</sub></i>(3, 3; 5).
J. Graph Theory, 1999

1997
On Ramsey number R(4, 3, 3) and triangle-free edge-chromatic graphs in three colors.
Discret. Math., 1997

The smallest hard-to-color graph for the SL algorithm.
Discret. Math., 1997

1996
A linear time algorithm for edge coloring of binomial trees.
Discret. Math., 1996

Applying Tabu Search to Determine New Ramsey Graphs.
Electron. J. Comb., 1996


  Loading...