Mark Glass
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Algorithms×1Complexity×1Discrete Math×1
Frequent co-authors
Research Timeline
2026
Maximum Cut Algorithms and Upper Bounds for Planar and Toroidal Graphs
The authors map the problem of finding the maximum cut of a planar graph with arbitrary weights to a minimum T-join problem in the absolute dual graph, enabling the use of shortest paths and adapting Hadlock's algorithm.
Highlighted terms show continued research focus across papers