Konrad Piwakowski

Publication Activity (10 Years)

Years Active: 1996-2006
Publications (10 Years): 0

Publications

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