Dávid Szeszlér

Publication Activity (10 Years)

Years Active: 2000-2022
Publications (10 Years): 4

Top Topics

Greedy Algorithms

Submodular Functions

Wireless Sensor Networks

Top Venues

J. Comb. Optim.

Pervasive Mob. Comput.

Publications

Dávid Szeszlér
Sufficient conditions for the optimality of the greedy algorithm in greedoids. J. Comb. Optim. 44 (1) (2022)
Dávid Szeszlér
New polyhedral and algorithmic results on greedoids. Math. Program. 185 (1-2) (2021)
Dávid Szeszlér
Hitting a path: a generalization of weighted connectivity via game theory. J. Comb. Optim. 38 (1) (2019)
Dávid Szeszlér
Security games on matroids. Math. Program. 161 (1-2) (2017)
Aron Laszka, Levente Buttyán, Dávid Szeszlér
Designing robust network topologies for wireless sensor networks in adversarial environments. Pervasive Mob. Comput. 9 (4) (2013)
Aron Laszka, Dávid Szeszlér, Levente Buttyán
Linear Loss Function for the Network Blocking Game: An Efficient Model for Measuring Network Robustness and Link Criticality. GameSec (2012)
Aron Laszka, Dávid Szeszlér, Levente Buttyán
Game-theoretic Robustness of Many-to-one Networks. GAMENETS (2012)
Aron Laszka, Levente Buttyán, Dávid Szeszlér
Optimal selection of sink nodes in wireless sensor networks in adversarial environments. WOWMOM (2011)
Dávid Szeszlér
Additive Approximation for Layer Minimization of Manhattan Switchbox Routing. Electron. Notes Discret. Math. 36 (2010)
András Recski, Dávid Szeszlér
Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI. Discret. Appl. Math. 155 (1) (2007)
Ladislav Stacho, Dávid Szeszlér
On a generalization of Chva'tal's condition giving new hamiltonian degree sequences. Discret. Math. 292 (1-3) (2005)
András Recski, Dávid Szeszlér
3-Dimensional Single Active Layer Routing. JCDCG (2000)
Dávid Szeszlér
Hamilton Cycles and Degree Sequences. Electron. Notes Discret. Math. 5 (2000)