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 ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback