Holló Csaba tudományos közleményei

  1. B. Romila, C. Preda, Cs. Holló, A structural characterization of the D­-continue partial order sets (in roumanian), Mathematical Reports (Studii si cercetari matematice), ed. Academiei Romane, 1 (47), 1995, 81­-96.
  2. Z. Blázsik, Cs. Holló, B. Imreh, On Decision-Mappings Related to Process Network Synthesis Problem, Acta Cybernetica, 13, 1998, 319-328.
  3. Z. Blázsik, Cs. Holló, B. Imreh, Explicit bounds for the number of feasible solutions of special PNS-problem classes, PU.M.A, 9, 1998, 17-27.
  4. Blázsik Z., Holló Cs., Imreh B., Kiszámolható korlátok speciális PNS-probléma-osztályok lehetséges megoldásai számára, Új utak a magyar operációkutatásban, szerk. Komlósi, S., Száantai T., Dialóg Campus Kiadó, Budapest-Pécs, 1999, 182-194.
  5. Cs. Holló, Z. Blázsik,, CS. Imreh, Z. Kovács, On a Merging Reduction of the Process Network Synthesis Problem, Acta Cybernetica, 14, 1999, 251-261.
  6. Cs. Holló, A Look Ahead Branch-and-Bound Procedure for Solving PNS Problems, PU.M. A., Volume 11, Number 2, 2000, 265-279.
  7. Z. Blázsik, Cs. Holló, B. Imreh, Cs. Imreh, Z. Kovács, On Bottleneck and k­sum version of the Process Network Synthesis Problem, Novi Sad Journal Of Mathematics, 3, 2000, 11­-19.
  8. Z. Blázsik, Cs. Holló, B. Imreh, Cs. Imreh, Z. Kovács, On a well­solvable class of the PNS problem, Novi Sad Journal Of Mathematics, 3, 2000, 21­-30.
  9. Z. Blázsik, Cs. Holló, Cs. Imreh, Z. Kovács, Heuristics for the Process Network Synthesis Problem, Optimization Theory: Recent developments from Matrahaza, Volume 59, 2001, 1-17.
  10. Cs. Holló, A Procedure Based on Automaton Theory Approach for Solving Modified PNS Problems, PU.M. A., Volume 13, Number 1-2, 2002, 159-169.
  11. Cs. Holló, A Partial Enumeration Algorithm for Solving PNS Problems, Mathematical and Computer Modelling: Hungarian Applied Mathematics and Computer Applications, Volume 38, Number 7-9, 2003, 855-864.
  12. Holló Cs., Hálózati folyamatok szintézise, PhD disszertáció, 2004.
  13. Cs. Holló, B. Imreh, Cs. Imreh, Reduction techniques for the PNS problems: a novel technique and a review, Optimization and Engineering, Springer Netherlands, Volume 10, Number 3, September, 2009, 351-361, ISSN: 1389-4420 (Print) 1573-2924 (Online), DOI: 10.1007/s11081-008-9054-2, Impact factor:1.0 (2009, Journal Citation Reports, Thomson Reuters).
  14. Holló Csaba, Üzleti webtechnológiák, elektronikus jegyzet, Typotex Kiadó 2011, 1-118.

Előadás kivonatok konferencia tanulmánykötetben

  1. Csaba Holló, Zoltán Blázsik, Csanád Imreh, and Zoltán Kovács, On a Merging Reduction of the Process Network Synthesis Problem, Conference of PhD Students in Computer Science, (Volume of extended abstracts), Szeged, Hungary, July 18-22, 1998, 47.
  2. Csaba Holló, Csanád Imreh, A Procedure Based on Automaton Theory Approach for Solving Particular PNS Problems, 4th Joint Conference of Mathematics and Computer Science, Felix, Romania, June 5-10, 2001, 53.
  3. Csaba Holló, Csanád Imreh, Algorithms for a Mixed Scheduling and PNS model, 6th Joint Conference on Mathematics and Computer Science, Pécs, Hungary, July 12-15, 2006, 39.
  4. Csaba Holló, Balázs Imreh, Csanád Imreh, A new reduction technique for PNS problems, VOCAL 2006, Veszprém Optimization Conference: Advanced Algorithms, Veszprém, Hungary, December 13-15, 2006, 77-78.

További konferencia előadások

  1. Z. Blázsik, Cs. Holló, B. Imreh, Explicit bounds for the number of feasible solutions of sepcial PNS-problem classes, Second Joint Conference of Modern Applied Mathematics, Ilieni, Romania, June 3-7, 1997.
  2. Cs. Holló, A Look Ahead Branch-and-Bound Procedure for Solving PNS Problems, Third Joint Conference on Applied Mathematics and Informatics, Visegrád, Hungary, June 7-12, 1999.
  3. Cs. Holló, A Partial Enumeration Algorithm for Solving PNS Problems, 5th International Conference on Applied Mathematics, Eger, Hungary, 28 January - 3 February, 2001.

További konferencia részvételek

  1. Conference of PhD Students in Computer Science, Session: Web (session chair), Szeged, Hungary, June 29 - July 2, 2010.