Zoltán Blázsik

According to our database1, Zoltán Blázsik authored at least 13 papers between 1993 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
On the balanced upper chromatic number of finite projective planes.
Discret. Math., 2021

2020
Spreading linear triple systems and expander triple systems.
Eur. J. Comb., 2020

2017
On the Complexity and Topology of Scoring Games: of Pirates and Treasure.
Integers, 2017

Partition dimension of projective planes.
Eur. J. Comb., 2017

A heuristic framework on a common generalization of the Vehicle Routing Problem and the Linear Ordering Problem.
Central Eur. J. Oper. Res., 2017

2016
Compositions of Complements of Graphs.
Integers, 2016

2015
Cospectral regular graphs with and without a perfect matching.
Discret. Math., 2015

2010
Maximal Complexity of Finite Words
CoRR, 2010

2008
Heuristic algorithms for a complex parallel machine scheduling problem.
Central Eur. J. Oper. Res., 2008

1999
On Merging Reduction of the Process Network Synthesis Problem.
Acta Cybern., 1999

1998
On Decision-Mappings Related to Process Network Synthesis Problem.
Acta Cybern., 1998

1996
A Note on Connection Between PNS and Set Covering Problems.
Acta Cybern., 1996

1993
Graphs with no induced C<sub>4</sub> and 2K<sub>2</sub>.
Discret. Math., 1993


  Loading...