Publications
Szeszlér, Dávid, Sufficient conditions for the optimality of the greedy algorithm in greedoids, JOURNAL OF COMBINATORIAL OPTIMIZATION (2021), https://link.springer.com/article/10.1007/s10878-021-00833-y
Szeszlér, Dávid, New polyhedral and algorithmic results on greedoids, MATHEMATICAL PROGRAMMING (2021), http://link.springer.com/10.1007/s10107-019-01427-7
Szeszlér, Dávid, Hitting a path: a generalization of weighted connectivity via game theory
JOURNAL OF COMBINATORIAL OPTIMIZATION (2019), http://link.springer.com/10.1007/s10878-018-0366-7
Szeszlér, Dávid, Security games on matroids, MATHEMATICAL PROGRAMMING, (2017), https://link.springer.com/article/10.1007/s10107-016-1011-9
Laszka, Aron ; Buttyán, Levente ; Szeszlér, Dávid, Designing robust network topologies for wireless sensor networks in adversarial environments, PERVASIVE AND MOBILE COMPUTING (2013), https://www.sciencedirect.com/science/article/abs/pii/S1574119212000612
Conferences
11th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, 2019, Tokyo, Japan
10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, 2017, Budapest
29th Conference of the European Chapter on Combinatorial Optimization (ECCO XXIX), 2016, Budapest
9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, 2015, Fukuoka, Japan