The Complexity of Tree Multicolorings
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Minimizing Average Completion of Dedicated Tasks and Interval Graphs
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Information and Computation
Discrete Applied Mathematics
Data migration to minimize the total completion time
Journal of Algorithms
The complexity of chromatic strength and chromatic edge strength
Computational Complexity
Improved bounds for scheduling conflicting jobs with minsum criteria
ACM Transactions on Algorithms (TALG)
Complexity results for minimum sum edge coloring
Discrete Applied Mathematics
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
A self-stabilizing algorithm for the minimum color sum of a graph
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Minimum sum edge colorings of multicycles
Discrete Applied Mathematics
Sum edge coloring of multigraphs via configuration LP
ACM Transactions on Algorithms (TALG)
Minimum sum set coloring of trees and line graphs of trees
Discrete Applied Mathematics
An effective heuristic algorithm for sum coloring of graphs
Computers and Operations Research
Polynomial time preemptive sum-multicoloring on paths
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On sum coloring and sum multi-coloring for restricted families of graphs
Theoretical Computer Science
Improved bounds for sum multicoloring and scheduling dependent jobs with minsum criteria
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
A short proof of the NP-completeness of minimum sum interval coloring
Operations Research Letters
On sum edge-coloring of regular, bipartite and split graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |