Dávid Szeszlér

J. Comb. Optim., 2022

2021

New polyhedral and algorithmic results on greedoids.

[BibT_eX]

[DOI]

Math. Program., 2021

2019

Hitting a path: a generalization of weighted connectivity via game theory.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

2017

Security games on matroids.

[BibT_eX]

[DOI]

Math. Program., 2017

2013

Designing robust network topologies for wireless sensor networks in adversarial environments.

[BibT_eX]

[DOI]

Pervasive Mob. Comput., 2013

2012

Linear Loss Function for the Network Blocking Game: An Efficient Model for Measuring Network Robustness and Link Criticality.

[BibT_eX]

[DOI]

Proceedings of the Decision and Game Theory for Security - Third International Conference, 2012

Game-theoretic Robustness of Many-to-one Networks.

[BibT_eX]

[DOI]

Proceedings of the Game Theory for Networks, 2012

2011

Optimal selection of sink nodes in wireless sensor networks in adversarial environments.

[BibT_eX]

[DOI]

Proceedings of the 12th IEEE International Symposium on a World of Wireless, 2011

2010

Additive Approximation for Layer Minimization of Manhattan Switchbox Routing.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

2007

Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI.

[BibT_eX]

[DOI]

András Recski

Discret. Appl. Math., 2007

2005

On a generalization of Chva'tal's condition giving new hamiltonian degree sequences.

[BibT_eX]

[DOI]

Ladislav Stacho

Discret. Math., 2005

2000

Hamilton Cycles and Degree Sequences.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2000

3-Dimensional Single Active Layer Routing.

[BibT_eX]

[DOI]

András Recski