Pages that link to "Item:Q1853153"
From MaRDI portal
The following pages link to Approximating minimum cocolorings. (Q1853153):
Displaying 13 items.
- On compressing permutations and adaptive sorting (Q391981) (← links)
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization (Q393084) (← links)
- Untangled monotonic chains and adaptive range search (Q553358) (← links)
- \((p,k)\)-coloring problems in line graphs (Q817821) (← links)
- A tutorial on the use of graph coloring for some problems in robotics (Q948648) (← links)
- On minimum \(k\)-modal partitions of permutations (Q1018088) (← links)
- Extreme witnesses and their applications (Q1799232) (← links)
- Fixed-parameter algorithms for the cocoloring problem (Q2440099) (← links)
- Partitioning cographs into cliques and stable sets (Q2568333) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- Extreme Witnesses and Their Applications (Q3467863) (← links)
- “Rent-or-Buy” Scheduling and Cost Coloring Problems (Q5458824) (← links)
- \((\min ,+)\) matrix and vector products for inputs decomposable into few monotone subsequences (Q6591620) (← links)
