The Complexity of Tree Multicolorings
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
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
Information and Computation
Data migration to minimize the total completion time
Journal of Algorithms
Minimum sum multicoloring on the edges of trees
Theoretical Computer Science - Approximation and online algorithms
Approximating interval coloring and max-coloring in chordal graphs
Journal of Experimental Algorithmics (JEA)
Improved bounds for scheduling conflicting jobs with minsum criteria
ACM Transactions on Algorithms (TALG)
Batch Coloring Flat Graphs and Thin
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Scheduling with conflicts: online and offline algorithms
Journal of Scheduling
Dynamic programming based algorithms for set multicover and multiset multicover problems
Theoretical Computer Science
Minimum sum set coloring of trees and line graphs of trees
Discrete Applied Mathematics
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
Minimum sum multicoloring on the edges of planar graphs and partial k-trees
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
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
Weighted sum coloring in batch scheduling of conflicting jobs
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Deconstructing datacenter packet transport
Proceedings of the 11th ACM Workshop on Hot Topics in Networks
pFabric: minimal near-optimal datacenter transport
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
| Hi-index | 0.00 |