Pages that link to "Item:Q1198648"
From MaRDI portal
The following pages link to Precoloring extension. I: Interval graphs (Q1198648):
Displayed 30 items.
- Using local search to speed up filtering algorithms for some NP-hard constraints (Q545546) (← links)
- Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines (Q600836) (← links)
- Some good characterization results relating to the Kőnig-Egerváry theorem (Q623797) (← links)
- Approximation algorithms for time constrained scheduling (Q676776) (← links)
- Parameterized coloring problems on chordal graphs (Q820152) (← links)
- A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding (Q869001) (← links)
- Distance constraints in graph color extensions (Q885289) (← links)
- Aliased register allocation for straight-line programs is NP-complete (Q954999) (← links)
- Precoloring extension of co-Meyniel graphs (Q995757) (← links)
- Complexity results for minimum sum edge coloring (Q1028432) (← links)
- You can't paint yourself into a corner (Q1272489) (← links)
- The combinatorics of timetabling (Q1278524) (← links)
- Algorithmic complexity of list colorings (Q1327214) (← links)
- Scheduling with incompatible jobs (Q1343141) (← links)
- Complexity of list coloring problems with a fixed total number of colors (Q1348378) (← links)
- Generalized coloring for tree-like graphs (Q1363645) (← links)
- Preassignment requirements in chromatic scheduling (Q1363744) (← links)
- Extending graph colorings (Q1569052) (← links)
- Complexity of choosing subsets from color sets (Q1584428) (← links)
- On the number of precolouring extensions (Q1590211) (← links)
- Uncolorable mixed hypergraphs (Q1962044) (← links)
- The \(d\)-precoloring problem for \(k\)-degenerate graphs (Q2370443) (← links)
- Precoloring extension on unit interval graphs (Q2492199) (← links)
- Hard coloring problems in low degree planar bipartite graphs (Q2506359) (← links)
- Two graph-colouring games (Q3140517) (← links)
- Coloration de graphes : fondements et applications (Q4809665) (← links)
- Precoloring Extension III: Classes of Perfect Graphs (Q4883061) (← links)
- Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints (Q5387639) (← links)
- Exploring the complexity boundary between coloring and list-coloring (Q5896984) (← links)
- Exploring the complexity boundary between coloring and list-coloring (Q5899384) (← links)