activity
20192026
most citedStochastic Optimization of Sorting Networks via Continuous Relaxations

37 citations · 37 across the 7 of their papers we have counts for

collaborators
Showing 2025Show all

5 papers · 1 filter

math.CO2025

Competitively Constructed Planar Graphs

Wesley Pegden, Eric Wang

We introduce and study two Maker-Breaker-like games for constructing planar graphs: the edge drawing game, where two players take turns drawing non-intersecting edges between point…

cond-mat.str-el2025

Gradient-based search of quantum phases: discovering unconventional fractional Chern insulators

André Grossi Fonseca, Eric Wang, Sachin Vaidya +3

The discovery and understanding of new quantum phases has time and again transformed both fundamental physics and technology, yet progress often relies on slow, intuition-based the…

math.CO2025

An analytical framework for the Levine hats problem: new strategies, bounds and generalizations

Clément Bouquet, Salah Chikhi, Timothé Charles +2

We study the Levine hat problem, a cooperative puzzle introduced by Lionel Levine in 2010, in which players must simultaneously identify a black hat on their own infinit…

cs.MA2025

Multi-Agent Path Finding Among Dynamic Uncontrollable Agents with Statistical Safety Guarantees

Kegan J. Strawn, Thomy Phan, Eric Wang +3

Existing multi-agent path finding (MAPF) solvers do not account for uncertain behavior of uncontrollable agents. We present a novel variant of Enhanced Conflict-Based Search (ECBS)…

cs.CG2025

Unfolding Boxes with Local Constraints

Long Qian, Eric Wang, Bernardo Subercaseaux +1

We consider the problem of finding and enumerating polyominos that can be folded into multiple non-isomorphic boxes. While several computational approaches have been proposed, incl…