 | 2011 |
|---|
| 10 |       | Damian Bogdanowicz,
Krzysztof Giaro,
Robert Janczewski:
Consensus models: Computational complexity aspects in modern approaches to the list coloring problem.
Theor. Comput. Sci. 412(35): 4721-4728 (2011) |
| 2009 |
|---|
| 9 | | Robert Janczewski,
Anna Malafiejska,
Michal Malafiejski:
Interval Wavelength Assignment in All-Optical Star Networks.
PPAM (1) 2009: 11-20 |
| 8 | | Robert Janczewski,
Adrian Kosowski,
Michal Malafiejski:
The complexity of the L(p, q)-labeling problem for bipartite planar graphs of small degree.
Discrete Mathematics 309(10): 3270-3279 (2009) |
| 7 | | Robert Janczewski:
Greedy T-colorings of graphs.
Discrete Mathematics 309(6): 1685-1690 (2009) |
| 2004 |
|---|
| 6 | | Michal Malafiejski,
Krzysztof Giaro,
Robert Janczewski,
Marek Kubale:
Sum Coloring of Bipartite Graphs with Bounded Degree.
Algorithmica 40(4): 235-244 (2004) |
| 2003 |
|---|
| 5 | | Krzysztof Giaro,
Robert Janczewski,
Michal Malafiejski:
The complexity of the T-coloring problem for graphs with small degree.
Discrete Applied Mathematics 129(2-3): 361-369 (2003) |
| 4 | | Krzysztof Giaro,
Robert Janczewski,
Michal Malafiejski:
A polynomial algorithm for finding T-span of generalized cacti.
Discrete Applied Mathematics 129(2-3): 371-382 (2003) |
| 2002 |
|---|
| 3 | | Krzysztof Giaro,
Robert Janczewski,
Marek Kubale,
Michal Malafiejski:
A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs.
APPROX 2002: 135-145 |
| 2001 |
|---|
| 2 | | Robert Janczewski:
Divisibility and T-span of graphs.
Discrete Mathematics 234(1-3): 171-179 (2001) |
| 1 | | Robert Janczewski,
Marek Kubale,
Krzysztof Manuszewski,
Konrad Piwakowski:
The smallest hard-to-color graph for algorithm DSATUR.
Discrete Mathematics 236(1-3): 151-165 (2001) |
Data released under the ODC-BY 1.0 license — See also our legal information page