default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZsuzsa Weiner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j18]Bence Csajbók, Angela Aguglia, Zsuzsa Weiner:
Intersecting families of graphs of functions over a finite field. Ars Math. Contemp. 24(1): 1 (2023)- [j17]Bence Csajbók, Péter Sziklai, Zsuzsa Weiner:
Renitent lines. Eur. J. Comb. 114: 103792 (2023) - [j16]Tamás Szonyi, Zsuzsa Weiner:
Large blocking sets in PG(2,q2). Finite Fields Their Appl. 87: 102152 (2023) - [j15]Péter Sziklai, Zsuzsa Weiner:
Covering all but the low weight vertices of the unit cube. J. Comb. Theory A 193: 105671 (2023) - 2021
- [j14]Bence Csajbók
, Zsuzsa Weiner:
Generalizing Korchmáros - Mazzocca Arcs. Comb. 41(5): 601-623 (2021) - [j13]Tamás Szonyi, Zsuzsa Weiner:
On the stability of Baer subplanes. Eur. J. Comb. 94: 103314 (2021) - 2020
- [j12]Sam Adriaensen, Lins Denaux, Leo Storme, Zsuzsa Weiner:
Small weight code words arising from the incidence of points and hyperplanes in PG(n, q). Des. Codes Cryptogr. 88(4): 771-788 (2020) - 2018
- [j11]Angela Aguglia, Daniele Bartoli, Leo Storme, Zsuzsa Weiner:
A Characterization of Hermitian Varieties as Codewords. Electron. J. Comb. 25(1): 1 (2018) - [j10]Tamás Szonyi, Zsuzsa Weiner:
Stability of k mod p multisets and small weight codewords of the code generated by the lines of PG(2, q). J. Comb. Theory A 157: 321-333 (2018) - 2013
- [j9]András Gács, Tamás Héger, Zsuzsa Weiner:
On regular graphs of girth six arising from projective planes. Eur. J. Comb. 34(2): 285-296 (2013) - [j8]Simeon Ball, Carles Padró, Zsuzsa Weiner, Chaoping Xing:
On the Representability of the Biuniform Matroid. SIAM J. Discret. Math. 27(3): 1482-1491 (2013) - 2012
- [j7]Tamás Szonyi, Zsuzsa Weiner:
A stability theorem for lines in Galois planes of prime order. Des. Codes Cryptogr. 62(1): 103-108 (2012) - 2011
- [j6]Tamás Szonyi, Zsuzsa Weiner:
Proof of a conjecture of Metsch. J. Comb. Theory A 118(7): 2066-2070 (2011) - 2004
- [j5]Zsuzsa Weiner:
On (k, pe)-arcs in Desarguesian planes. Finite Fields Their Appl. 10(3): 390-404 (2004) - 2003
- [j4]Aart Blokhuis, Tamás Szonyi, Zsuzsa Weiner:
On Sets without Tangents in Galois Planes of Even Order. Des. Codes Cryptogr. 29(1-3): 91-98 (2003) - [j3]András Gács, Zsuzsa Weiner:
On (q + t, t)-Arcs of Type (0, 2, t). Des. Codes Cryptogr. 29(1-3): 131-139 (2003) - 2001
- [j2]Tamás Szonyi, Zsuzsa Weiner:
Small Blocking Sets in Higher Dimensions. J. Comb. Theory A 95(1): 88-101 (2001) - 2000
- [j1]Leo Storme, Zsuzsa Weiner:
On 1-Blocking Sets in PG(n, q), n >= 3. Des. Codes Cryptogr. 21(1/3): 235-251 (2000)
Conference and Workshop Papers
- 2009
- [c2]Bálint Daróczy, István Petrás, András A. Benczúr, Zsolt Fekete, Dávid Márk Nemeskey, Dávid Siklósi, Zsuzsa Weiner:
Interest Point and Segmentation-Based Photo Annotation. CLEF (2) 2009: 340-347 - [c1]Bálint Daróczy, István Petrás, András A. Benczúr, Zsolt Fekete, Dávid Márk Nemeskey, Dávid Siklósi, Zsuzsa Weiner:
SZTAKI @ ImageCLEF 2009. CLEF (Working Notes) 2009
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 2025-03-04 22:31 CET 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:
