1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.CY2026
Does This Even Matter in the Real World? Real World Problems in Foundational Theory Courses
Anna Kuznetsova
Discrete mathematics and probability theory contain foundational material for computer scientists. Despite their importance, instructors often worry that students will find these c…
cs.DM2017
A Simply Exponential Upper Bound on the Maximum Number of Stable Matchings
Anna R. Karlin, Shayan Oveis Gharan, Robbie Weber
Stable matching is a classical combinatorial problem that has been the subject of intense theoretical and empirical study since its introduction in 1962 in a seminal paper by Gale…
cs.DM2017★ 1 cited
Embedded-width: A variant of treewidth for plane graphs
Glencora Borradaile, Jeff Erickson, Hung Le +1
We define a special case of tree decompositions for planar graphs that respect a given embedding of the graph. We study the analogous width of the resulting decomposition we call t…