Dávid Szeszlér

According to our database1, Dávid Szeszlér authored at least 11 papers between 2000 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Hitting a path: a generalization of weighted connectivity via game theory.
J. Comb. Optim., 2019

2017
Security games on matroids.
Math. Program., 2017

2013
Designing robust network topologies for wireless sensor networks in adversarial environments.
Pervasive Mob. Comput., 2013

2012
Linear Loss Function for the Network Blocking Game: An Efficient Model for Measuring Network Robustness and Link Criticality.
Proceedings of the Decision and Game Theory for Security - Third International Conference, 2012

Game-theoretic Robustness of Many-to-one Networks.
Proceedings of the Game Theory for Networks, 2012

2011
Optimal selection of sink nodes in wireless sensor networks in adversarial environments.
Proceedings of the 12th IEEE International Symposium on a World of Wireless, 2011

2010
Additive Approximation for Layer Minimization of Manhattan Switchbox Routing.
Electron. Notes Discret. Math., 2010

2007
Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI.
Discret. Appl. Math., 2007

2005
On a generalization of Chva'tal's condition giving new hamiltonian degree sequences.
Discret. Math., 2005

2000
Hamilton Cycles and Degree Sequences.
Electron. Notes Discret. Math., 2000

3-Dimensional Single Active Layer Routing.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000


  Loading...