Pages that link to "Item:Q672380"
From MaRDI portal
The following pages link to Restrictions of graph partition problems. I (Q672380):
Displaying 33 items.
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316) (← links)
- Equitable colorings of bounded treewidth graphs (Q817768) (← links)
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- Capacitated max-batching with interval graph compatibilities (Q899311) (← links)
- Some approximation algorithms for the clique partition problem in weighted interval graphs (Q995565) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
- Mutual exclusion scheduling (Q1365931) (← links)
- Scheduling jobs on identical machines with agreement graph (Q1761988) (← links)
- Window-based greedy contention management for transactional memory: theory and practice (Q1938368) (← links)
- Tree partitioning under constraints. -- Clustering for vehicle routing problems (Q1962035) (← links)
- A hybrid metaheuristic for the two-dimensional strip packing problem (Q2069243) (← links)
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (Q2125230) (← links)
- Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints (Q2149860) (← links)
- Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms (Q2152489) (← links)
- Scheduling identical jobs on uniform machines with a conflict graph (Q2273690) (← links)
- Clique partitioning with value-monotone submodular cost (Q2339847) (← links)
- On the thinness and proper thinness of a graph (Q2414456) (← links)
- New results in two identical machines scheduling with agreement graphs (Q2420580) (← links)
- Weighted and locally bounded list-colorings in split graphs, cographs, and partial \(k\)-trees (Q2420639) (← links)
- A competitive analysis for balanced transactional memory workloads (Q2429336) (← links)
- Bounded max-colorings of graphs (Q2447538) (← links)
- Batch processing with interval graph compatibilities between tasks (Q2476244) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. II (Q2476265) (← links)
- Scheduling: agreement graph vs resource constraints (Q2629638) (← links)
- Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints (Q2680859) (← links)
- An improved algorithm for parallel machine scheduling under additional resource constraints (Q2693796) (← links)
- Asynchronous Coordination Under Preferences and Constraints (Q2835020) (← links)
- On partitioning interval graphs into proper interval subgraphs and related problems (Q3174235) (← links)
- Locally bounded<i>k</i>-colorings of trees (Q3621974) (← links)
- “Rent-or-Buy” Scheduling and Cost Coloring Problems (Q5458824) (← links)
- Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization (Q6107887) (← links)
- Scheduling on uniform machines with a conflict graph: complexity and resolution (Q6187242) (← links)
- Gap one bounds for the equitable chromatic number of block graphs (Q6558671) (← links)
