From the 1 of 1 linked paper with an AI index.
1 paper
Markus Wallinger, Oscar Navarro, Stephen G. Kobourov
The paper studies how to reorder the children of each node in a rooted tree with given vertex sizes to minimize the width of a layered drawing, proving the problem NP‑complete and…