The following pages link to (Q3838186):
Displayed 20 items.
- On the bend-number of planar and outerplanar graphs (Q477341) (← links)
- On the parameterized complexity of some optimization problems related to multiple-interval graphs (Q606990) (← links)
- Using fractional primal-dual to schedule split intervals with demands (Q865744) (← links)
- Interval scheduling and colorful independent sets (Q892898) (← links)
- Three ways to cover a graph (Q898135) (← links)
- On the parameterized complexity of multiple-interval graph problems (Q1001898) (← links)
- On star and caterpillar arboricity (Q1025569) (← links)
- Interval numbers of powers of block graphs (Q1420587) (← links)
- Local and union boxicity (Q1709530) (← links)
- Precedence thinness in graphs (Q2091785) (← links)
- Online scheduling of car-sharing request pairs between two locations (Q2156295) (← links)
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955) (← links)
- Caterpillar arboricity of planar graphs (Q2370451) (← links)
- Recognizing \(d\)-interval graphs and \(d\)-track interval graphs (Q2375953) (← links)
- The \(k\)-strong induced arboricity of a graph (Q2408964) (← links)
- Edge-intersection graphs of grid paths: the bend-number (Q2440108) (← links)
- On some arboricities in planar graphs (Q3439376) (← links)
- On Covering Numbers, Young Diagrams, and the Local Dimension of Posets (Q4990391) (← links)
- On interval representations of graphs (Q5962513) (← links)
- Temporal interval cliques and independent sets (Q6039892) (← links)