3-Dimensional Single Active Layer Routing. - András Recski; Dávid Szeszlér (JCDCG, 2000)

Hamilton Cycles and Degree Sequences. - Dávid Szeszlér (Electron. Notes Discret. Math., 2000)

On a generalization of Chva'tal's condition giving new hamiltonian degree sequences. - Ladislav Stacho; Dávid Szeszlér (Discret. Math., 2005)

Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI. - András Recski; Dávid Szeszlér (Discret. Appl. Math., 2007)

Additive Approximation for Layer Minimization of Manhattan Switchbox Routing. - Dávid Szeszlér (Electron. Notes Discret. Math., 2010)

Optimal selection of sink nodes in wireless sensor networks in adversarial environments. - Aron Laszka; Levente Buttyán; Dávid Szeszlér (WOWMOM, 2011)

Game-theoretic Robustness of Many-to-one Networks. - Aron Laszka; Dávid Szeszlér; Levente Buttyán (GAMENETS, 2012)

Linear Loss Function for the Network Blocking Game: An Efficient Model for Measuring Network Robustness and Link Criticality. - Aron Laszka; Dávid Szeszlér; Levente Buttyán (GameSec, 2012)

Designing robust network topologies for wireless sensor networks in adversarial environments. - Aron Laszka; Levente Buttyán; Dávid Szeszlér (Pervasive Mob. Comput., 2013)

Security games on matroids. - Dávid Szeszlér (Math. Program., 2017)

Hitting a path: a generalization of weighted connectivity via game theory. - Dávid Szeszlér (J. Comb. Optim., 2019)

New polyhedral and algorithmic results on greedoids. - Dávid Szeszlér (Math. Program., 2021)

Sufficient conditions for the optimality of the greedy algorithm in greedoids. - Dávid Szeszlér (J. Comb. Optim., 2022)