 |
|
| Personal data sheet |
 Print previewpersonal data approved: 2022. VI. 02. | Publications |
2021
 from data base, 2022. VI. 02. |
Szeszlér Dávid: Sufficient conditions for the optimality of the greedy algorithm in greedoids, JOURNAL OF COMBINATORIAL OPTIMIZATION
type of document: Journal paper/Article
language: English
URL |
2021
from data base, 2022. VI. 02. |
Szeszlér Dávid: New polyhedral and algorithmic results on greedoids, MATHEMATICAL PROGRAMMING 185: pp. 275-296.
type of document: Journal paper/Article
language: English
URL |
2019
from data base, 2022. VI. 02. |
Szeszlér Dávid: Hitting a path: a generalization of weighted connectivity via game theory, JOURNAL OF COMBINATORIAL OPTIMIZATION 38: (1) pp. 72-85.
type of document: Journal paper/Article
number of independent citations: 1
language: English
URL |
2019
from data base, 2022. VI. 02. |
Dávid Szeszlér: Optimality of the Greedy Algorithm in Greedoids, In: Hirai, Hiroshi; Iwata, Satoru; Tanigawa, Shin-ichi (szerk.) Proceedings of the 11th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, Department of Mathematical Informatics, University of Tokyo (2019) pp. 438-445.
type of document: Part of book/Proceedings Paper
number of independent citations: 1
language: English
URL |
2017
from data base, 2022. VI. 02. |
Szeszlér D: Security games on matroids, MATHEMATICAL PROGRAMMING 161: (1-2) pp. 347-364.
type of document: Journal paper/Article
number of independent citations: 2
language: English
Full text |
2013
from data base, 2022. VI. 02. |
Laszka Aron, Buttyán Levente, Szeszlér Dávid: Designing robust network topologies for wireless sensor networks in adversarial environments, PERVASIVE AND MOBILE COMPUTING 9: (4) pp. 546-563.
type of document: Journal paper/Article
number of independent citations: 16
language: English
URL |
2012
from data base, 2022. VI. 02. |
Lászka Áron, Szeszlér Dávid, Buttyán Levente: Linear Loss Function for the Network Blocking Game: An Efficient Model for Measuring Network Robustness and Link Criticality, In: Grossklags, Jens; Walrand, Jean (szerk.) Decision and Game Theory for Security, Springer-Verlag (2012) pp. 152-170.
type of document: Part of book/Proceedings Paper
number of independent citations: 6
language: English
URL |
2012
from data base, 2022. VI. 02. |
Lászka Áron, Szeszlér Dávid, Buttyán Levente: Game-theoretic Robustness of Many-to-one Networks, In: Krishnamurthy, V; Zhao, Q; Huang, M; Wen, Y (szerk.) Game Theory for Networks, Springer (2012) pp. 88-98.
type of document: Part of book/Proceedings Paper
number of independent citations: 5
language: English
URL |
2011
from data base, 2022. VI. 02. |
Lászka Áron, Buttyán Levente, Szeszlér Dávid: Optimal Selection of Sink Nodes in Wireless Sensor Networks in Adversarial Environments, In: IEEE (szerk.) 2nd IEEE International Workshop on Data Security and PrivAcy in wireless Networks (D-SPAN), IEEE (2011) pp. 1-6.
type of document: Part of book/Proceedings Paper
number of independent citations: 4
language: English
URL |
2005
from data base, 2022. VI. 02. |
Stacho Ladislav, Szeszlér Dávid: On a generalization of Chvátal's condition giving new Hamiltonian degree sequences, DISCRETE MATHEMATICS 292: pp. 159-165.
type of document: Journal paper/Article
number of independent citations: 4
language: English
URL |
| | Number of independent citations to these publications: | 39 |
|
|
|
|
|
Login
cs.bme.hu
