 | 2012 |
|---|
| 24 |       | Edward G. Coffman Jr.,
Dariusz Dereniowski,
Wieslaw Kubiak:
An efficient algorithm for finding ideal schedules.
Acta Inf. 49(1): 1-14 (2012) |
| 23 | | Dariusz Dereniowski,
Andrzej Pelc:
Drawing maps with advice.
J. Parallel Distrib. Comput. 72(2): 132-143 (2012) |
| 2011 |
|---|
| 22 | | Dariusz Dereniowski:
From Pathwidth to Connected Pathwidth.
STACS 2011: 416-427 |
| 21 | | Dariusz Dereniowski:
The complexity of node blocking for dags.
J. Comb. Theory, Ser. A 118(1): 248-256 (2011) |
| 20 | | Dariusz Dereniowski:
Connected searching of weighted trees.
Theor. Comput. Sci. 412(41): 5700-5713 (2011) |
| 2010 |
|---|
| 19 | | Dariusz Dereniowski,
Andrzej Pelc:
Drawing Maps with Advice.
DISC 2010: 328-342 |
| 18 | | Dariusz Dereniowski:
Connected Searching of Weighted Trees.
MFCS 2010: 330-341 |
| 17 | | Dariusz Dereniowski:
Connected searching of weighted trees
CoRR abs/1001.4341: (2010) |
| 16 | | Dariusz Dereniowski:
From Pathwidth to Connected Pathwidth
CoRR abs/1007.1269: (2010) |
| 15 | | Dariusz Dereniowski,
Wieslaw Kubiak:
Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines.
J. Scheduling 13(5): 479-492 (2010) |
| 14 | | Dariusz Dereniowski:
Phutball is PSPACE-hard.
Theor. Comput. Sci. 411(44-46): 3971-3978 (2010) |
| 2009 |
|---|
| 13 | | Dariusz Dereniowski:
Minimum vertex ranking spanning tree problem for chordal and proper interval graphs.
Discussiones Mathematicae Graph Theory 29(2): 253-261 (2009) |
| 12 | | Dariusz Dereniowski:
Maximum vertex occupation time and inert fugitive: Recontamination does help.
Inf. Process. Lett. 109(9): 422-426 (2009) |
| 2008 |
|---|
| 11 |  | Dariusz Dereniowski:
The Complexity of List Ranking of Trees.
Ars Comb. 86: (2008) |
| 10 | | Dariusz Dereniowski:
The Complexity of Node Blocking for Dags
CoRR abs/0802.3513: (2008) |
| 9 | | Dariusz Dereniowski:
Phutball is PSPACE-hard
CoRR abs/0804.1777: (2008) |
| 8 | | Dariusz Dereniowski:
Edge ranking and searching in partial orders.
Discrete Applied Mathematics 156(13): 2493-2500 (2008) |
| 7 | | Dariusz Dereniowski,
Adam Nadolski:
A Note on Compact and Compact Circular Edge-colorings of Graphs.
Discrete Mathematics & Theoretical Computer Science 10(3): (2008) |
| 2007 |
|---|
| 6 | | Dariusz Dereniowski:
Easy and hard instances of arc ranking in directed graphs.
Discrete Applied Mathematics 155(18): 2601-2611 (2007) |
| 2006 |
|---|
| 5 | | Dariusz Dereniowski:
Edge ranking of weighted trees.
Discrete Applied Mathematics 154(8): 1198-1209 (2006) |
| 4 | | Dariusz Dereniowski,
Marek Kubale:
Efficient Parallel Query Processing by Graph Ranking.
Fundam. Inform. 69(3): 273-285 (2006) |
| 3 | | Dariusz Dereniowski,
Adam Nadolski:
Vertex rankings of chordal graphs and weighted trees.
Inf. Process. Lett. 98(3): 96-100 (2006) |
| 2005 |
|---|
| 2 | | Dariusz Dereniowski,
Marek Kubale:
Parallel Query Processing and Edge Ranking of Graphs.
PPAM 2005: 463-469 |
| 2003 |
|---|
| 1 | | Dariusz Dereniowski,
Marek Kubale:
Cholesky Factorization of Matrices in Parallel and Ranking of Graphs.
PPAM 2003: 985-992 |
Data released under the ODC-BY 1.0 license — See also our legal information page