Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Zoltán L. Blázsik
Observed names:
Blazsik, Z.,
Blázsik Zoltán,
Blázsik, Z.L.,
Blázsik, Zoltán,
Blázsik, Zoltán L.,
Z. Blázsik,
Zoltan Blazsik,
Zoltán Blázsik
show all 8
Institutions:
University of Pannonia,
University of Szeged,
University of Johannesburg
Observed institutions:
Eötvös Loránd University,
HUN-REN Alfréd Rényi Institute of Mathematics,
University of Pannonia,
University of Szeged,
University of Johannesburg,
MTA-SZTE Research Group on Artificial Intelligence,
Hungarian Academy of Sciences
show all 7
ORCID:
0000-0003-1877-9983
Observed ORCID:
0000-0003-1877-9983
OpenAlex ID:
A5001422540
Graphs with no induced C4 and 2K2
1993
·
Zoltán Blázsik
, Mihály Hujter
, et al.
·
Discrete Mathematics
·
68
PDF
Cospectral regular graphs with and without a perfect matching
2014
·
Zoltán L. Blázsik
, Jay Cummings
, et al.
·
Discrete Mathematics
·
26
PDF
A Note on Connection Between PNS and Set Covering Problems.
1996
·
Zoltán L. Blázsik
, Balázs Imreh
·
Acta Cybernetica
·
19
General sharp upper bounds on the total coalition number
2023
·
János Barát
, Zoltán Blázsik
·
Discussiones Mathematicae Graph Theory
·
12
PDF
On a merging reduction of the process network synthesis problem
1999
·
Cs. Holló
, Zoltán L. Blázsik
, et al.
·
Acta Cybernetica
·
12
Heuristic algorithms for a complex parallel machine scheduling problem
2008
·
Zoltán Blázsik
, Csanád Imreh
, et al.
·
Central European Journal of Operations Research
·
10
Spreading linear triple systems and expander triple systems
2020
·
Zoltán L. Blázsik
, Zoltán Lóránt Nagy
·
European Journal of Combinatorics
·
7
PDF
Upper bounds for the necklace folding problems
2022
·
Endre Csóka
, Zoltán L. Blázsik
, et al.
·
Journal of Combinatorial Theory Series B
·
5
On a well solvable class of the PNS problem
2000
·
Blázsik Zoltán
, Cs. Holló
, et al.
·
SZTE Publicatio Repozitórium (University of Szeged)
·
5
PDF
Crumby colorings — Red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen
2022
·
János Barát
, Zoltán L. Blázsik
, et al.
·
Discrete Mathematics
·
4
On the balanced upper chromatic number of finite projective planes
2020
·
Zoltán L. Blázsik
, Aart Blokhuis
, et al.
·
Discrete Mathematics
·
4
On the number of edges in saturated partial embeddings of maximal planar graphs
2025
·
Barát, János
, Blázsik, Zoltán L.
, et al.
·
arXiv (Cornell University)
·
3
PDF
Quest for graphs of Frank number 3
2024
·
Barát János
, Blázsik Zoltán
·
SZTE Publicatio Repozitórium (University of Szeged)
·
3
PDF
Quest for graphs of Frank number $3$
2022
·
Barát, János
, Blázsik, Zoltán L.
·
arXiv (Cornell University)
·
3
PDF
Partition dimension of projective planes
2017
·
Zoltán L. Blázsik
, Zoltán Lóránt Nagy
·
European Journal of Combinatorics
·
3
PDF
On decision-mappings related to process network synthesis problem
1998
·
Zoltán L. Blázsik
, Cs. Holló
, et al.
·
Acta Cybernetica
·
3
Improved upper bound on the Frank number of 3-edge-connected graphs
2024
·
János Barát
, Zoltán L. Blázsik
·
European Journal of Combinatorics
·
2
On the Complexity and Topology of Scoring Games: of Pirates and Treasure
2017
·
Árendás, P.
, Blázsik, Z.L.
, et al.
·
Zenodo (CERN European Organization for Nuclear Research)
·
2
Total Coalitions in Claw-Free Cubic Graphs Containing Double-Bonded Triangle-Units
2026
·
Zoltán L. Blázsik
, Michael A. Henning
, et al.
·
Graphs and Combinatorics
·
1
PDF
Communicating Digital Evolutionary Machines
2021
·
Istvan Elek
, Zoltan Blazsik
, et al.
·
Lecture notes in networks and systems
·
1
On the upper chromatic number and multiple blocking sets of PG(n,q)
2019
·
Zoltán L. Blázsik
, Tamás Héger
, et al.
·
Journal of Combinatorial Designs
·
1
PDF
Compositions of Complements of Graphs
2016
·
Arendás, P.
, Bencs, F.
, et al.
·
Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)
·
1
PDF
Maximal Complexity of Finite Words
2010
·
Anisiu, M-C.
, Blazsik, Z.
, et al.
·
arXiv (Cornell University)
·
1
PDF
Heuristics for Simplified Process Network Synthesis (PNS) Problems with a Blossom-Type Algorithm for the Edge Covering Problem
2001
·
Zoltán Blázsik
, Kornél Keserű
, et al.
·
Applied optimization
·
1
Heuristics for the Process Network Synthesis Problem
2001
·
Z. Blázsik
, Cs. Holló
, et al.
·
Applied optimization
·
1
Show more works
View as search
Works count:
35
Citation count:
204
H-index:
7
I10-index:
6
Year
Topic
Type