Heuristics and lower bounds for the bin packing problem with conflicts
Computers and Operations Research
Equitable colorings of bounded treewidth graphs
Theoretical Computer Science - Graph colorings
Batch processing with interval graph compatibilities between tasks
Discrete Applied Mathematics
Mutual exclusion scheduling with interval graphs or related classes. Part II
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
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
Graph coloring with cardinality constraints on the neighborhoods
Discrete Optimization
A survey of Nordhaus-Gaddum type relations
Discrete Applied Mathematics
A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks
INFORMS Journal on Computing
| Hi-index | 0.05 |