Designing robust network topologies for wireless sensor networks in adversarial environments A Laszka, L Buttyán, D Szeszlér Pervasive and Mobile Computing 9 (4), 546-563, 2013 | 23 | 2013 |
Game-theoretic robustness of many-to-one networks A Laszka, D Szeszlér, L Buttyán Game Theory for Networks: Third International ICST Conference, GameNets 2012 …, 2012 | 19 | 2012 |
Linear loss function for the network blocking game: An efficient model for measuring network robustness and link criticality A Laszka, D Szeszlér, L Buttyán Decision and Game Theory for Security: Third International Conference …, 2012 | 18 | 2012 |
Security games on matroids D Szeszlér Mathematical Programming 161, 347-364, 2017 | 16 | 2017 |
Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI A Recski, D Szeszlér Discrete applied mathematics 155 (1), 44-52, 2007 | 11 | 2007 |
Switchbox routing in the multilayer Manhattan model D Szeszlér Ann. Univ. Sci. Budapest Eötvös Sect. Math 40, 155-164, 1997 | 11 | 1997 |
Optimal selection of sink nodes in wireless sensor networks in adversarial environments A Lászka, L Buttyán, D Szeszlér 2011 IEEE International Symposium on a World of Wireless, Mobile and …, 2011 | 10 | 2011 |
Combinatorial algorithms in VLSI routing D Szeszlér PhD thesis, Budapest University of Technology and Economics, 2005 | 9 | 2005 |
3—Dimensional Single Active Layer Routing A Recski, D Szeszlér Japanese Conference on Discrete and Computational Geometry, 318-329, 2000 | 8 | 2000 |
Improving size-bounds for subcases of square-shaped switchbox routing A Recski, G Salamon, D Szeszlér Periodica Polytechnica Electrical Engineering (Archives) 48 (1-2), 55-60, 2004 | 6 | 2004 |
New polyhedral and algorithmic results on greedoids D Szeszlér Mathematical Programming 185 (1), 275-296, 2021 | 5 | 2021 |
Hide and seek in digital communication: the steganography game A Laszka, D Szeszlér | 5 | 2015 |
On a generalization of Chvátal's condition giving new hamiltonian degree sequences L Stacho, D Szeszlér Discrete mathematics 292 (1-3), 159-165, 2005 | 5 | 2005 |
A New Algorithm for 2-layer, Manhattan Channel Routing D Szeszlér Proc. 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its …, 2003 | 5 | 2003 |
Sufficient conditions for the optimality of the greedy algorithm in greedoids D Szeszlér Journal of Combinatorial Optimization 44 (1), 287-302, 2022 | 4 | 2022 |
Optimality of the Greedy Algorithm in Greedoids D Szeszlér | 3 | 2019 |
The Evolution of an Idea—Gallai’s Algorithm A Recski, D Szeszlér More Sets, Graphs and Numbers: A Salute to Vera Sós and András Hajnal, 317-328, 2006 | 3 | 2006 |
3-dimensional channel routing A Reiss, D Szeszlér | 3 | 2005 |
Hitting a path: a generalization of weighted connectivity via game theory D Szeszlér Journal of Combinatorial Optimization 38 (1), 72-85, 2019 | 2 | 2019 |
Measuring graph robustness via game theory D Szeszlér [sn], 2017 | 2 | 2017 |