Evaluation of Neural and Genetic Algorithms for Synthesizing Parallel Storage Schemes
International Journal of Parallel Programming
Total Colorings of Degenerated Graphs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
A Linear Algorithm for Finding Total Colorings of Partial k-Trees
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Algorithm for the Cost Edge-Coloring of Trees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Algorithms for the Multicolorings of Partial k-Trees
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
A polynomial time algorithm for strong edge coloring of partial k-trees
Discrete Applied Mathematics
Algorithms for finding distance-edge-colorings of graphs
Journal of Discrete Algorithms
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Colorings with few colors: counting, enumeration and combinatorial bounds
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Algorithms for finding distance-edge-colorings of graphs
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Hi-index | 0.00 |