Applying Tabu Search to Determine New Ramsey Graphs. - Konrad Piwakowski (Electron. J. Comb., 1996)

A linear time algorithm for edge coloring of binomial trees. - Marek Kubale; Konrad Piwakowski (Discret. Math., 1996)

The smallest hard-to-color graph for the SL algorithm. - Marek Kubale; Jaroslaw Pakulski; Konrad Piwakowski (Discret. Math., 1997)

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

Computation of the Folkman number Fe(3, 3; 5). - Konrad Piwakowski; Stanislaw P. Radziszowski; Sebastian Urbanski (J. Graph Theory, 1999)

Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time. - Krzysztof Giaro; Marek Kubale; Michal Malafiejski; Konrad Piwakowski (PPAM, 2001)

The Ramsey Multiplicity of K4. - Konrad Piwakowski; Stanislaw P. Radziszowski (Ars Comb., 2001)

The smallest hard-to-color graph for algorithm DSATUR. - Robert Janczewski; Marek Kubale; Krzysztof Manuszewski; Konrad Piwakowski (Discret. Math., 2001)

Complexity results on open shop scheduling to minimize total cost of operations. - Krzysztof Giaro; Marek Kubale; Konrad Piwakowski (Int. J. Comput. Syst. Signals, 2002)

Ramsey Numbers for Triangles versus Almost-Complete Graphs. - Brendan D. McKay; Konrad Piwakowski; Stanislaw P. Radziszowski (Ars Comb., 2004)

On Some Ramsey and Turan-Type Numbers for Paths and Cycles. - Tomasz Dzido; Marek Kubale; Konrad Piwakowski (Electron. J. Comb., 2006)