Fixed Structure Complexity. - Yonatan Aumann; Yair Dombb (IWPEC, 2008)

Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games. - Yonatan Aumann; Yair Dombb (SAGT, 2010)

The approximate swap and mismatch edit distance. - Yair Dombb; Ohad Lipsky; Benny Porat; Ely Porat; Asaf Tsur (Theor. Comput. Sci., 2010)

Throw One's Cake - and Eat It Too. - Orit Arzi; Yonatan Aumann; Yair Dombb (SAGT, 2011)

Throw One's Cake — and Have It Too - Orit Arzi; Yonatan Aumann; Yair Dombb (CoRR, 2011)

Computing socially-efficient cake divisions. - Yonatan Aumann; Yair Dombb; Avinatan Hassidim (AAMAS, 2013)

Auctioning a cake: truthful auctions of heterogeneous divisible goods. - Yonatan Aumann; Yair Dombb; Avinatan Hassidim (AAMAS, 2014)

The Efficiency of Fair Division with Connected Pieces. - Yonatan Aumann; Yair Dombb (ACM Trans. Economics and Comput., 2015)

Auctioning Time: Truthful Auctions of Heterogeneous Divisible Goods. - Yonatan Aumann; Yair Dombb; Avinatan Hassidim (ACM Trans. Economics and Comput., 2015)

Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting. - Orit Arzi; Yonatan Aumann; Yair Dombb (Soc. Choice Welf., 2016)