Heuristics and lower bounds for the bin packing problem with conflicts
Computers and Operations Research
Scheduling with conflicts on bipartite and interval graphs
Journal of Scheduling - Special issue: On-line scheduling
Equitable colorings of bounded treewidth graphs
Theoretical Computer Science - Graph colorings
On equitable Δ-coloring of graphs with low average degree
Theoretical Computer Science - Graph colorings
Exact Algorithms for a Loading Problem with Bounded Clique Width
INFORMS Journal on Computing
Mutual exclusion scheduling with interval graphs or related classes. Part II
Discrete Applied Mathematics
Probabilistic analysis for scheduling with conflicts
Theoretical Computer Science
Mutual exclusion scheduling with interval graphs or related classes, Part I
Discrete Applied Mathematics
Scheduling with conflicts: online and offline algorithms
Journal of Scheduling
Algorithms for the Bin Packing Problem with Conflicts
INFORMS Journal on Computing
Equitable colorings of Kronecker products of graphs
Discrete Applied Mathematics
Scheduling jobs on identical machines with agreement graph
Computers and Operations Research
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
Theoretical Computer Science
Equitable colorings of Cartesian products of graphs
Discrete Applied Mathematics
Graph coloring with cardinality constraints on the neighborhoods
Discrete Optimization
Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm
INFORMS Journal on Computing
Parallel implementations of ensemble data assimilation for atmospheric prediction
IA^3 '13 Proceedings of the 3rd Workshop on Irregular Applications: Architectures and Algorithms
Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs
Discrete Applied Mathematics
| Hi-index | 5.26 |