- CSB - MetaPress - Google - Bing - Yahoo
 | 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 |
| 1 | Marek Kubale | [1] [2] [4] |
| 2 | Adam Nadolski | [3] [7] |