The following pages link to (Q4036610):
Displaying 15 items.
- On a binary distance model for the minimum linear arrangement problem (Q458974) (← links)
- An optimal time algorithm for minimum linear arrangement of chord graphs (Q497140) (← links)
- \(\ell ^2_2\) spreading metrics for vertex ordering problems (Q848848) (← links)
- Minimal cutwidth linear arrangements of abelian Cayley graphs (Q942098) (← links)
- Parameterized algorithmics for linear arrangement problems (Q1003461) (← links)
- Improved exact approaches for row layout problems with departments of equal length (Q1651703) (← links)
- Precedence constrained scheduling to minimize sum of weighted completion times on a single machine (Q1961232) (← links)
- Node set optimization problem for complete Josephus cubes (Q2279757) (← links)
- Minimum fill-in: inapproximability and almost tight lower bounds (Q2304536) (← links)
- Designing PTASs for MIN-SUM scheduling problems (Q2489956) (← links)
- On the interval completion of chordal graphs (Q2492201) (← links)
- Minimum linear arrangement of chord graphs (Q2518728) (← links)
- A branch and bound algorithm for the minimum storage-time sequencing problem (Q4434517) (← links)
- Experiments on the minimum linear arrangement problem (Q5463444) (← links)
- Complexity classification of some edge modification problems (Q5948964) (← links)
