Planar graph algorithms constitute a pivotal area in theoretical computer science, addressing problems where graphs can be drawn on a plane without edge crossings. Among the myriad challenges in this ...

Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory. This past October, as Jacob Holm and Eva Rotenberg were thumbing through a ...

Embodied intelligence applications, such as autonomous robotics and smart transportation systems, require efficient coordination of multiple agents in dynamic environments. A critical challenge in ...

Back in the hazy olden days of the pre-2000s, navigating between two locations generally required someone to whip out a paper map and painstakingly figure out the most optimal route between those ...

If G is a planar graph, we may add edges to construct a maximal planar graph H containing G, so that H triangulates the sphere. If G is toroidal, then by adding edges we can extend G to a maximal ...

The facilities layout problem is concerned with laying out facilities on a planar site in order to design systems that are as efficient as possible. One approach to the problem involves the use of REL ...

On the 19th of February 2025, M.Sc. Andreas Grigorjew defends his PhD thesis on Algorithms and Graph Structures for Splitting Network Flows, in Theory and Practice. The thesis is related to research ...