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 ...

PNAS is the world's most-cited multidisciplinary scientific serial. It publishes high-impact research reports, commentaries, perspectives, reviews, colloquium papers, and actions of the Academy. In ...

Jacob Holm was flipping through proofs from an October 2019 research paper he and colleague Eva Rotenberg—an associate professor in the department of applied mathematics and computer science at the ...

We prove that given any sequence $G_1, G_2,\ldots$ of graphs, where $G_1$ is finite planar and all other $G_i$ are possibly infinite, there are indices $i,j$ such ...