The worst graph layout algorithm ever

@InProceedings{DiBartolomeo2022WorstGraphLayout,
  author    = {Di~Bartolomeo, Sara and Lang, Matěj and Dunne, Cody},
  booktitle = {Proc.\ alt.VIS workshop at IEEE VIS},
  title     = {The worst graph layout algorithm ever},
  year      = {2022},
  note      = {alt.VIS 2022 The Worst (Algorithm) Award! Preprint \& supplemental material: \url{https://osf.io/4hfy9/}},
  series    = {alt.VIS},
  abstract  = {Graph layout algorithms strive to improve the utility of node-link visualizations or graph drawings by optimizing for readability criteria. One such criteria that has been widely used is to count edge crossings. Prior work has focused solely on minimizing the number of edge crossings, including provably-optimal layout algorithms for layered graphs. The research community has completely ignored the other side of the coin — can we optimally maximize edge crossings? This paper answers this question in the affirmative. Our WORSTisfimal layout algorithm produces the most unreadable layered graph drawing. It does so by using linear programming to produce a provably-optimally-awful solution. We hope that this groundbreaking result opens up an entirely new field of inquiry for graph drawing researchers — optimally-worst layout algorithms.},
  doi       = {10.31219/osf.io/4hfy9},
}