Konrad Piwakowski

11 papers Misc 1Journal 10
YearRankTypeTitle / Venue / Authors
2006 J jnl
On Some Ramsey and Turan-Type Numbers for Paths and Cycles.
Electron. J. Comb.
Tomasz Dzido, Marek Kubale, Konrad Piwakowski
2004 J jnl
Ramsey Numbers for Triangles versus Almost-Complete Graphs.
Ars Comb.
Brendan D. McKay, Konrad Piwakowski, Stanislaw P. Radziszowski
2002 J jnl
Complexity results on open shop scheduling to minimize total cost of operations.
Int. J. Comput. Syst. Signals
Krzysztof Giaro, Marek Kubale, Konrad Piwakowski
2001 Misc conf
Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time.
PPAM
Krzysztof Giaro, Marek Kubale, Michal Malafiejski, Konrad Piwakowski
2001 J jnl
The Ramsey Multiplicity of K4.
Ars Comb.
Konrad Piwakowski, Stanislaw P. Radziszowski
2001 J jnl
The smallest hard-to-color graph for algorithm DSATUR.
Discret. Math.
Robert Janczewski, Marek Kubale, Krzysztof Manuszewski, Konrad Piwakowski
1999 J jnl
Computation of the Folkman number
J. Graph Theory
Konrad Piwakowski, Stanislaw P. Radziszowski, Sebastian Urbanski
1997 J jnl
On Ramsey number R(4, 3, 3) and triangle-free edge-chromatic graphs in three colors.
Discret. Math.
Konrad Piwakowski
1997 J jnl
The smallest hard-to-color graph for the SL algorithm.
Discret. Math.
Marek Kubale, Jaroslaw Pakulski, Konrad Piwakowski
1996 J jnl
A linear time algorithm for edge coloring of binomial trees.
Discret. Math.
Marek Kubale, Konrad Piwakowski
1996 J jnl
Applying Tabu Search to Determine New Ramsey Graphs.
Electron. J. Comb.
Konrad Piwakowski