Hierarchical Drawing Algorithms.

TL;DR: CitNetExplorer as discussed by the authors is a software tool for analyzing and visualizing citation networks of scientific publications, which can be used to study the development of a research field, delineate the literature on a research topic, and to support literature reviewing.

TL;DR: The map equation framework operates on the flow induced by the links of a network, it naturally captures flow of ideas and citation flow, and is therefore well-suited for analysis of bibliometric networks.

TL;DR: Large networks contain plentiful information about the organization of a system, but the challenge is to extract useful information buried in the structure of myriad nodes and links.

TL;DR: This paper presents approaches for integrating port constraints into the layer-based approach to graph drawing pioneered by Sugiyama et al, and shows how the layout algorithm, called KLay Layered, progresses from relaxed to more restricted port constraint levels as it executes, and how established algorithms for crossing minimization and edge routing can be extended to support port constraints.

TL;DR: Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.

TL;DR: The work of Dantzig, Fulkerson, Hoffman, Edmonds, Lawler and other pioneers on network flows, matching and matroids acquainted me with the elegant and efficient algorithms that were sometimes possible.

TL;DR: In today’s changing and competitive industrial environment, the difference between ad hoc planning methods and those that use sophisticated mathematical models to determine an optimal course of action can determine whether or not a company survives.