Pages that link to "Item:Q5311104"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2004 (Q5311104):
Displaying 19 items.
- Solving a multicoloring problem with overlaps using integer programming (Q968150) (← links)
- Adaptive multicolouring (Q1586355) (← links)
- On the performance guarantee of first fit for sum coloring (Q1628787) (← links)
- Graph multi-coloring for a job scheduling application (Q1686066) (← links)
- Root multiplicities for Borcherds algebras and graph coloring (Q1703112) (← links)
- Chromatic symmetric function of graphs from Borcherds algebras (Q2040502) (← links)
- Generalised chromatic polynomials of graphs from heaps of pieces (Q2155545) (← links)
- Profit maximization in flex-grid all-optical networks (Q2300629) (← links)
- On the interval chromatic number of proper interval graphs (Q2352054) (← links)
- Minimum sum coloring problem: upper bounds for the chromatic strength (Q2410252) (← links)
- Profit Maximization in Flex-Grid All-Optical Networks (Q2868649) (← links)
- Vectorial solutions to list multicoloring problems on graphs (Q2915785) (← links)
- Mixing Color Coding-Related Techniques (Q3452864) (← links)
- Multicolour Discrepancies (Q4462636) (← links)
- Multicoloring of graphs to secure a secret (Q4645622) (← links)
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs (Q5081783) (← links)
- Tight Lower Bounds for the Complexity of Multicoloring (Q5111704) (← links)
- Parameterized complexity for iterated type partitions and modular-width (Q6126724) (← links)
- A study on free roots of Borcherds-Kac-Moody Lie superalgebras (Q6201499) (← links)