
Search the dblp DataBase
Robert Janczewski:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Krzysztof Giaro, Robert Janczewski, Marek Kubale, Michal Malafiejski
A 27/26Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs. [Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:135145 [Conf]
 Michal Malafiejski, Krzysztof Giaro, Robert Janczewski, Marek Kubale
Sum Coloring of Bipartite Graphs with Bounded Degree. [Citation Graph (0, 0)][DBLP] Algorithmica, 2004, v:40, n:4, pp:235244 [Journal]
 Krzysztof Giaro, Robert Janczewski, Michal Malafiejski
The complexity of the Tcoloring problem for graphs with small degree. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:129, n:23, pp:361369 [Journal]
 Krzysztof Giaro, Robert Janczewski, Michal Malafiejski
A polynomial algorithm for finding Tspan of generalized cacti. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:129, n:23, pp:371382 [Journal]
 Robert Janczewski
Divisibility and Tspan of graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:234, n:13, pp:171179 [Journal]
 Robert Janczewski, Marek Kubale, Krzysztof Manuszewski, Konrad Piwakowski
The smallest hardtocolor graph for algorithm DSATUR. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:236, n:13, pp:151165 [Journal]
Interval Wavelength Assignment in AllOptical Star Networks. [Citation Graph (, )][DBLP]
Greedy Tcolorings of graphs. [Citation Graph (, )][DBLP]
The complexity of the L(p, q)labeling problem for bipartite planar graphs of small degree. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs
