Dávid Szeszlér

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