Result 21 to 40 of 63 total
Cholesky factorization of matrices in parallel and ranking of graphs (English)
PPAM, 985-992 (2003).
21
Dedicated scheduling of biprocessor tasks to minimize mean flow time. (English)
Wyrzykowski, Roman (ed.) et al., Parallel processing and applied mathematics. 4th international conference, PPAM 2001, Nałȩczów, Poland, September 9‒12, 2001. Revised papers. Berlin: Springer (ISBN 3-540-43792-4). Lect. Notes Comput. Sci. 2328, 87-96 (2002).
22
A 27/26-approximation algorithm for the chromatic sum coloring of bipartite graphs. (English)
Jansen, Klaus (ed.) et al., Approximation algorithms for combinatorial optimization. 5th international workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2462, 135-145 (2002).
23
Complexity results on open shop scheduling to minimize total cost of operations (English)
Int. J. Comput. Syst. Signal 3, No. 2, 84-91 (2002).
24
A better practical algorithm for distributed graph coloring (English)
PARELEC, 72-75 (2002).
25
A 27/26-approximation algorithm for the chromatic sum coloring of bipartite graphs (English)
APPROX, 135-145 (2002).
26
On the smallest hard to color sequential graph. (English)
Congr. Numerantium 150, 155-160 (2001).
27
The smallest hard-to-color graph for algorithm DSATUR. (English)
Discrete Math. 236, No.1-3, 151-165 (2001).
28
Consecutive colorings of the edges of general graphs. (English)
Discrete Math. 236, No.1-3, 131-143 (2001).
29
Dedicated scheduling of biprocessor tasks to minimize mean flow time (English)
PPAM, 87-96 (2001).
30
The smallest hard-to-color graphs for sequential coloring algorithms. (English)
Inderfurth, K. (ed.) et al., Operations research proceedings 1999. Selected papers of the symposium (SOR ’99), Magdeburg, Germany, September 1-3, 1999. Berlin: Springer. 95-101 (2000).
31
On the edge chromatic sum of a graph. (English)
Sali, A. (ed.) et al., Paul Erdős and his mathematics. Papers from the international conference held in memory of Paul Erdős in Budapest, Hungary, July 4‒11, 1999. Budapest: János Bolyai Mathematical Society (ISBN 963-8022-93-0). 81-82 (1999).
32
The smallest hard-to-color graphs for the classical, total and strong coloring of vertices. (English)
Control Cybern. 28, No.2, 355-365 (1999).
33
On the deficiency of bipartite graphs. (English)
Discrete Appl. Math. 94, No.1-3, 193-203 (1999).
34
Repackable networks—the concept and applications. (English)
Du, Ding-Zhu (ed.) et al., Advances in switching networks. DIMACS workshop at Princeton University, Princeton, NJ, USA, July 7-9, 1997. Providence, RI: AMS, American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 42, 75-83 (1998).
35
The quest for small benchmarks for the chromatic sum problem. (English)
Arch. Control Sci. 6, No.3-4, 249-260 (1997).
36
Consecutive edge-colorings of complete and incomplete Cartesian products of graphs. (English)
Congr. Numerantium 128, 143-149 (1997).
37
Open shop problem with zero-one time operations and integer release date/deadline intervals. (English)
Discrete Appl. Math. 76, No.1-3, 213-223 (1997).
38
The smallest hard-to-color graph for the SL algorithm. (English)
Discrete Math. 164, No.1-3, 197-212 (1997).
39
Algorithms for the chromatic sum of a graph. (Polish)
Zesz. Nauk Politech. Śl. 1337, Autom. 117, 213-222 (1996).
40
Result 21 to 40 of 63 total
Start
Contact
Print
General Help
