Dávid Szeszlér

Available identifiers

zbMath Open szeszler.davidMaRDI QIDQ507325

List of research outcomes

Publication	Date of Publication	Type
Sufficient conditions for the optimality of the greedy algorithm in greedoids	2022-08-26	Paper
New polyhedral and algorithmic results on greedoids	2021-01-25	Paper
Hitting a path: a generalization of weighted connectivity via game theory	2019-06-25	Paper
Security games on matroids	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	2013-07-24	Paper
Linear Loss Function for the Network Blocking Game: An Efficient Model for Measuring Network Robustness and Link Criticality	2013-03-13	Paper
https://portal.mardi4nfdi.de/entity/Q3539417	2008-11-18	Paper
Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI	2007-01-09	Paper
https://portal.mardi4nfdi.de/entity/Q5477821	2006-06-29	Paper
On a generalization of Chvátal's condition giving new Hamiltonian degree sequences	2005-04-28	Paper
https://portal.mardi4nfdi.de/entity/Q4547820	2002-08-21	Paper
https://portal.mardi4nfdi.de/entity/Q4243463	1999-05-18	Paper

Research outcomes over time

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