14 citations · 34 across the 9 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.GT2019★ 1 cited
Single-crossing Implementation
Nathann Cohenn, Edith Elkind, Foram Lakhani
An election over a finite set of candidates is called single-crossing if, as we sweep through the list of voters from left to right, the relative order of every pair of candidates…
cs.LO2019
Coverability in 1-VASS with Disequality Tests
Shaull Almagor, Nathann Cohen, Guillermo A. Pérez +2
We study a class of reachability problems in weighted graphs with constraints on the accumulated weight of paths. The problems we study can equivalently be formulated in the model…