default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDávid Szeszlér
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j9]Dávid Szeszlér
:
Sufficient conditions for the optimality of the greedy algorithm in greedoids. J. Comb. Optim. 44(1): 287-302 (2022)- 2021
- [j8]Dávid Szeszlér:
New polyhedral and algorithmic results on greedoids. Math. Program. 185(1-2): 275-296 (2021)
2010 – 2019
- 2019
- [j7]Dávid Szeszlér:
Hitting a path: a generalization of weighted connectivity via game theory. J. Comb. Optim. 38(1): 72-85 (2019) - 2017
- [j6]Dávid Szeszlér:
Security games on matroids. Math. Program. 161(1-2): 347-364 (2017) - 2013
- [j5]Aron Laszka, Levente Buttyán, Dávid Szeszlér:
Designing robust network topologies for wireless sensor networks in adversarial environments. Pervasive Mob. Comput. 9(4): 546-563 (2013) - 2012
- [c4]Aron Laszka, Dávid Szeszlér, Levente Buttyán:
Game-theoretic Robustness of Many-to-one Networks. GAMENETS 2012: 88-98 - [c3]Aron Laszka, Dávid Szeszlér, Levente Buttyán:
Linear Loss Function for the Network Blocking Game: An Efficient Model for Measuring Network Robustness and Link Criticality. GameSec 2012: 152-170 - 2011
- [c2]Aron Laszka, Levente Buttyán, Dávid Szeszlér:
Optimal selection of sink nodes in wireless sensor networks in adversarial environments. WOWMOM 2011: 1-6 - 2010
- [j4]Dávid Szeszlér:
Additive Approximation for Layer Minimization of Manhattan Switchbox Routing. Electron. Notes Discret. Math. 36: 1097-1104 (2010)
2000 – 2009
- 2007
- [j3]András Recski, Dávid Szeszlér:
Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI. Discret. Appl. Math. 155(1): 44-52 (2007) - 2005
- [j2]Ladislav Stacho, Dávid Szeszlér:
On a generalization of Chva'tal's condition giving new hamiltonian degree sequences. Discret. Math. 292(1-3): 159-165 (2005) - 2000
- [j1]Dávid Szeszlér:
Hamilton Cycles and Degree Sequences. Electron. Notes Discret. Math. 5: 288-290 (2000) - [c1]András Recski, Dávid Szeszlér:
3-Dimensional Single Active Layer Routing. JCDCG 2000: 318-329
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
