default search action
Stefan H. M. van Zwam
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j21]Ben Clark, Kevin Grace, James G. Oxley, Stefan H. M. van Zwam:
On the Highly Connected Dyadic, Near-Regular, and Sixth-Root-of-Unity Matroids. SIAM J. Discret. Math. 35(2): 1356-1380 (2021)
2010 – 2019
- 2019
- [j20]Kevin Grace
, Stefan H. M. van Zwam:
The Highly Connected Even-Cycle and Even-Cut Matroids. SIAM J. Discret. Math. 33(1): 26-67 (2019) - 2018
- [j19]Ben Clark, James G. Oxley, Stefan H. M. van Zwam:
Relaxations of GF(4)-Representable Matroids. Electron. J. Comb. 25(2): 2 (2018) - 2017
- [j18]Kevin Grace
Templates for Binary Matroids. SIAM J. Discret. Math. 31(1): 254-282 (2017) - 2016
- [j17]Ben Clark, Dillon Mayhew
The Structure of U2, 5, U3, 5-Fragile Matroids. SIAM J. Discret. Math. 30(3): 1480-1508 (2016) - [j16]Peter Nelson, Stefan H. M. van Zwam:
The Maximum-Likelihood Decoding Threshold for Cycle Codes of Graphs. IEEE Trans. Inf. Theory 62(10): 5316-5322 (2016) - 2015
- [j15]Carolyn Chun, Deborah Chun, Dillon Mayhew, Stefan H. M. van Zwam:
Fan-Extensions in Fragile Matroids. Electron. J. Comb. 22(2): 2 (2015) - [j14]Jim Geelen, Stefan H. M. van Zwam:
Matroid 3-connectivity and branch width. J. Comb. Theory B 112: 104-123 (2015) - [j13]Peter Nelson, Stefan H. M. van Zwam:
Matroids Representable Over Fields With a Common Subfield. SIAM J. Discret. Math. 29(2): 796-810 (2015) - [j12]Peter Nelson, Stefan H. M. van Zwam:
On the Existence of Asymptotically Good Linear Codes in Minor-Closed Classes. IEEE Trans. Inf. Theory 61(3): 1153-1158 (2015) - [i1]Peter Nelson, Stefan H. M. van Zwam:
The maximum-likelihood decoding threshold for graphic codes. CoRR abs/1504.05225 (2015) - 2014
- [j11]Tony Huynh
Intertwining Connectivities in Representable Matroids. SIAM J. Discret. Math. 28(1): 188-196 (2014) - 2013
- [j10]Rudi Pendavingh, Stefan H. M. van Zwam:
Skew partial fields, multilinear representations of matroids, and a matrix tree theorem. Adv. Appl. Math. 50(1): 201-227 (2013) - [j9]Rhiannon Hall, Dillon Mayhew
On the relative importance of excluded minors. Adv. Appl. Math. 50(1): 228-242 (2013) - 2012
- [j8]Dillon Mayhew
Stability, fragility, and Rotaʼs Conjecture. J. Comb. Theory B 102(3): 760-783 (2012) - [j7]Dillon Mayhew
The structure of graphs with a vital linkage of order 2. J. Graph Theory 71(2): 176-181 (2012) - 2011
- [j6]Rhiannon Hall, Dillon Mayhew
The excluded minors for near-regular matroids. Eur. J. Comb. 32(6): 802-830 (2011) - [j5]Dillon Mayhew
An Obstacle to a Decomposition Theorem for Near-Regular Matroids. SIAM J. Discret. Math. 25(1): 271-279 (2011) - 2010
- [j4]Rudi Pendavingh, Stefan H. M. van Zwam:
Lifts of matroid representations over partial fields. J. Comb. Theory B 100(1): 36-67 (2010) - [j3]Rudi Pendavingh, Stefan H. M. van Zwam:
Confinement of matroid representations to subsets of partial fields. J. Comb. Theory B 100(6): 510-545 (2010)
2000 – 2009
- 2008
- [j2]Jochen Könemann, Stefano Leonardi, Guido Schäfer, Stefan H. M. van Zwam:
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game. SIAM J. Comput. 37(5): 1319-1341 (2008) - 2007
- [j1]Rudi Pendavingh, Stefan H. M. van Zwam:
New Korkin--Zolotarev Inequalities. SIAM J. Optim. 18(1): 364-378 (2007) - 2005
- [c1]Jochen Könemann, Stefano Leonardi, Guido Schäfer, Stefan H. M. van Zwam:
From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem. ICALP 2005: 930-942
Coauthor Index
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-06-10 21:21 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: