Dávid Szeszlér

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Sufficient conditions for the optimality of the greedy algorithm in greedoids Journal of Combinatorial Optimization	2022-08-26	Paper
New polyhedral and algorithmic results on greedoids Mathematical Programming. Series A. Series B	2021-01-25	Paper
Hitting a path: a generalization of weighted connectivity via game theory Journal of Combinatorial Optimization	2019-06-25	Paper
Security games on matroids Mathematical Programming. Series A. Series B	2017-02-03	Paper
Hamilton cycles and degree sequences	2016-07-01	Paper
Additive approximation for layer minimization of Manhattan switchbox routing	2013-11-08	Paper
Game-theoretic robustness of many-to-one networks Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering	2013-07-24	Paper
Linear loss function for the network blocking game: an efficient model for measuring network robustness and link criticality Lecture Notes in Computer Science	2013-03-13	Paper
Improving size-bounds for subcases of square-shaped switchbox routing	2008-11-18	Paper
Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI Discrete Applied Mathematics	2007-01-09	Paper
scientific article; zbMATH DE number 5037085 (Why is no real title available?)	2006-06-29	Paper
On a generalization of Chvátal's condition giving new Hamiltonian degree sequences Discrete Mathematics	2005-04-28	Paper
scientific article; zbMATH DE number 1786525 (Why is no real title available?)	2002-08-21	Paper
scientific article; zbMATH DE number 1288324 (Why is no real title available?)	1999-05-18	Paper

Research outcomes over time

This page was built for person: Dávid Szeszlér