default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZoltán Blázsik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]János Barát, Zoltán L. Blázsik:
Quest for graphs of Frank number 3. Australas. J Comb. 88: 52-76 (2024)- [j16]János Barát, Zoltán Blázsik
:
General sharp upper bounds on the total coalition number. Discuss. Math. Graph Theory 44(4): 1567-1584 (2024) - [j15]János Barát, Zoltán L. Blázsik:
Improved upper bound on the Frank number of 3-edge-connected graphs. Eur. J. Comb. 118: 103913 (2024) - 2023
- [j14]János Barát, Zoltán L. Blázsik, Gábor Damásdi:
Crumby colorings - Red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen. Discret. Math. 346(4): 113281 (2023) - 2022
- [j13]Endre Csóka, Zoltán L. Blázsik, Zoltán Király, Dániel Lenger:
Upper bounds for the necklace folding problems. J. Comb. Theory B 157: 123-143 (2022) - 2021
- [j12]Zoltán L. Blázsik, Aart Blokhuis, Stefko Miklavic, Zoltán Lóránt Nagy, Tamás Szonyi:
On the balanced upper chromatic number of finite projective planes. Discret. Math. 344(3): 112266 (2021) - [c1]Istvan Elek, Zoltán Blázsik, Tamás Héger, Dániel Lenger, Dániel Sindely:
Communicating Digital Evolutionary Machines. SAI (2) 2021: 976-986 - 2020
- [j11]Zoltán L. Blázsik, Zoltán Lóránt Nagy:
Spreading linear triple systems and expander triple systems. Eur. J. Comb. 89: 103155 (2020)
2010 – 2019
- 2017
- [j10]Zoltán Blázsik, Zoltán Imre Fajfrik:
A heuristic framework on a common generalization of the Vehicle Routing Problem and the Linear Ordering Problem. Central Eur. J. Oper. Res. 25(1): 55-70 (2017) - [j9]Zoltán Blázsik, Zoltán Lóránt Nagy:
Partition dimension of projective planes. Eur. J. Comb. 65: 37-44 (2017) - [j8]Péter Árendás, Zoltán L. Blázsik, Bertalan Bodor, Csaba Szabó:
On the Complexity and Topology of Scoring Games: of Pirates and Treasure. Integers 17: G3 (2017) - 2016
- [j7]Péter Árendás, Ferenc Bencs, Zoltán Blázsik, Csaba Szabó:
Compositions of Complements of Graphs. Integers 16: A29 (2016) - 2015
- [j6]Zoltán Blázsik, Jay Cummings, Willem H. Haemers:
Cospectral regular graphs with and without a perfect matching. Discret. Math. 338(3): 199-201 (2015) - 2010
- [i1]Mira-Cristiana Anisiu, Zoltán Blázsik, Zoltán Kása:
Maximal Complexity of Finite Words. CoRR abs/1002.2724 (2010)
2000 – 2009
- 2008
- [j5]Zoltán Blázsik, Csanád Imreh, Zoltán Kovács:
Heuristic algorithms for a complex parallel machine scheduling problem. Central Eur. J. Oper. Res. 16(4): 379-390 (2008)
1990 – 1999
- 1999
- [j4]Cs. Holló, Zoltán Blázsik, Csanád Imreh, Zoltán Kovács:
On Merging Reduction of the Process Network Synthesis Problem. Acta Cybern. 14(2): 251-261 (1999) - 1998
- [j3]Zoltán Blázsik, Cs. Holló, Balázs Imreh:
On Decision-Mappings Related to Process Network Synthesis Problem. Acta Cybern. 13(3): 319-328 (1998) - 1996
- [j2]Zoltán Blázsik, Balázs Imreh:
A Note on Connection Between PNS and Set Covering Problems. Acta Cybern. 12(3): 309-312 (1996) - 1993
- [j1]Zoltán Blázsik, Mihály Hujter, András Pluhár, Zsolt Tuza:
Graphs with no induced C4 and 2K2. Discret. Math. 115(1-3): 51-55 (1993)
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-09-10 02:08 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:
