Spremljaj
Tkáč Michal
Tkáč Michal
Podnikovohospodárska fakulta Košice
Preverjeni e-poštni naslov na euke.sk
Naslov
Navedeno
Navedeno
Leto
Artificial neural networks in business: Two decades of research
M Tkáč, R Verner
Applied Soft Computing 38, 788-804, 2016
4192016
On the evaluation of Six Sigma projects
M Tkáč, Š Lyócsa
Quality and reliability engineering international 26 (1), 115-124, 2010
572010
The irregularity strength and cost of the union of cliques
S Jendroľ, M Tkáč, Z Tuza
Discrete Mathematics 150 (1-3), 179-186, 1996
421996
More than one tough chordal planar graphs are Hamiltonian
T Böhme, J Harant, M Tkáč
Journal of Graph Theory 32 (4), 405-410, 1999
371999
Štatistické riadenie kvality
M Tkáč
Ekonóm, 2001
292001
On 3-connected plane graphs without triangular faces
J Harant, S Jendrol, M Tkác
Journal of Combinatorial Theory, Series B 77 (1), 150-161, 1999
221999
On the degrees of a strongly vertex-magic graph
C Balbuena, E Barker, KC Das, Y Lin, M Miller, J Ryan, K Sugeng, M Tkac
Discrete mathematics 306 (6), 539-551, 2006
202006
On the shortness exponent of 1-tough, maximal planar graphs
M Tkáč
Discrete Mathematics 154 (1-3), 321-328, 1996
201996
The irregularity strength of tKp
S Jendroľ, M Tkáč
Discrete mathematics 145 (1-3), 301-305, 1995
201995
Simplicial 3-polytopes with only two types of edges.
S Jendrol, M Tkac
Discrete Math. 48 (2), 229-242, 1984
191984
Convex 3 polytopes with exactly two types of edges
S Jendrol, M Tkác
Disc. Math 84, 143-160, 1990
131990
Financial and economic analysis of steel industry by multivariate analysis
J Czillingová, I Petruška, M Tkáč
Ekonomicky casopis 60, 388-405, 2012
122012
Trestles in polyhedral graphs
M Tkáč, HJ Voss
Discussiones Mathematicae Graph Theory 22 (1), 193-198, 2002
122002
On certain Hamiltonian cycles in planar graphs
T Böhme, J Harant, M Tkáč
Journal of Graph Theory 32 (1), 81-96, 1999
121999
Analysis of Sky Europe airlines flights on Košice international airport
M Tkáč, M Andrejkovič, Z Hajduová
Acta avionica 11 (17), 2009
72009
On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles
M Tkáč
Discrete Mathematics 128 (1-3), 407-413, 1994
71994
Research and development in Slovakia, Denmark and Finland from the Perspective of the Strategy Europe 2020
M Tkáč, ED Spišáková, B Gontkovičová
Scientific Papers of the University of Pardubice, Series D: Faculty of …, 2017
52017
On cycles through specified vertices
T Gerlach, F Göring, J Harant, M Tkáč
Discrete mathematics 306 (8-9), 831-835, 2006
52006
On the minimal number of separating 3-cycles in non-Hamiltonian maximal planar graphs
T Böhme, J Harant, M Tkáč
Tatra Mt. Math. Publ 9, 97-102, 1996
51996
Štatistické zlepšovanie procesov v praxi, 1. vydanie, Košice, TU, SjF, 2010, 126 s
M Tkáč, R Turisová
5
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20