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
Probabilistic analysis for scheduling with conflicts
Theoretical Computer Science
Scheduling with conflicts: online and offline algorithms
Journal of Scheduling
Discrete Applied Mathematics
Determining a Minimum Spanning Tree with Disjunctive Constraints
ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
Algorithms for the Bin Packing Problem with Conflicts
INFORMS Journal on Computing
Approximability of the subset sum reconfiguration problem
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
Theoretical Computer Science
The maximum flow problem with conflict and forcing conditions
INOC'11 Proceedings of the 5th international conference on Network optimization
Treelike comparability graphs: characterization, recognition, and applications
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
The maximum flow problem with disjunctive constraints
Journal of Combinatorial Optimization
| Hi-index | 0.00 |