Book chapters and
monographs
| [ps] |
 |
D.Dereniowski, Parallel
Scheduling by Graph Ranking, Ph.D. Thesis, PG WETI,
Advisor: Professor Marek
Kubale |
|
|
D.Dereniowski,
Rank
Coloring
of Graphs, [in:] Graph Colorings (M.Kubale Ed.),
Contemporary
Mathematics 352, AMS (2004) 79-93. |
Selected journal
papers
| | E.G. Coffman Jr., D.Dereniowski,
W.Kubiak, An efficient algorithm for finding ideal schedules, Acta Informatica (accepted) | | | D.Dereniowski,
A.Pelc, Drawing maps
with advice, Journal of Parallel and Distributed Computing (accepted) | | | D.Dereniowski,
W.Kubiak, Routing equal-size messages on a slotted ring, Journal
of Scheduling (accepted) |
 |
|
D.Dereniowski, Connected searching of weighted
trees, Theoretical
Computer Science 412 (2011) 5700-5713 |
|
|
D.Dereniowski,
The
complexity of node blocking for dags, Journal of Combinatorial Theory,
Series A 118 (2011) 248-256 |
|
|
D.Dereniowski, Phutball is PSPACE-hard, Theoretical Computer Science
411 (2010) 3971-3978 |
|
|
D.Dereniowski,
W.Kubiak, Makespan
minimization of multi-slot just-in-time scheduling on single and
parallel machines, Journal
of Scheduling 13 (2010) |
|
|
D.Dereniowski,
Maximum
vertex occupation time and inert fugitive: recontamination does
help, Information
Processing Letters 109 (2009)
422-426 |
|
|
D.Dereniowski,
Minimum
vertex ranking spanning tree problem for chordal and proper
interval graphs, Discussiones
Mathematicae Graph Theory 29
(2009) 253-261 |
|
|
D.Dereniowski,
A.Nadolski, A note on
compact and compact circular edge-colorings of graphs, Discrete Mathematics and
Theoretical Computer Science 10 (2008) 161-170 |
|
|
D.Dereniowski,
Edge ranking and searching in partial orders, Discrete
Applied Mathematics 156 (2008) 2493-2500 |
|
|
D.Dereniowski, The
complexity of list ranking of trees, Ars
Combinatoria 86 (2008) 97-114 |
|
|
D.Dereniowski, Easy
and hard instances of arc ranking in directed graphs, Discrete
Applied Mathematics 155 (2007) 2601-2611 |
|
|
D.Dereniowski,
M.Kubale, Efficient
parallel query
processing by graph ranking, Fundamenta
Informaticae 69 (2006) 273-285 |
|
|
D.Dereniowski,
A.Nadolski, Vertex
rankings of chordal graphs
and weighted trees, Information
Processing Letters 98 (2006) 96-100 |
|
|
D.Dereniowski, Edge
ranking of weighted trees, Discrete
Applied Mathematics 154 (2006) 1198-1209 |
Selected
conference papers
|
|
D.Dereniowski, From pathwidth to connected
pathwidth, STACS
2011, 416-427 |
|
|
D.Dereniowski, Connected searching of weighted
trees, MFCS 2010, LNCS 6281
(2010) 330-341 |
|
|
D.Dereniowski,
A.Pelc, Drawing maps
with advice, DISC 2010,
LNCS 6343
(2010) 328-342 |
|
|
D.Dereniowski,
M.Kubale, Parallel query
processing and
edge ranking of graphs, PPAM (2005),
LNCS
3911 (2006) 463-469. |
Drafts
- D.Dereniowski, From pathwidth to connected
pathwidth [download: manuscript]
|
