pglogo.gif KRZYSZTOF GIARO
HOME PAGE		 etilogo.gif

How to contact me:


photo.gif
 I am an Associate Professor at 

Gdańsk University of Technology, ETI Faculty
Department of Algorithms and System Modeling
ul. Narutowicza 11/12, 80-952 Gdańsk, POLAND
Phone: (+48-58) 3472428 Fax: (+48-58) 3471766
Email: giaro@eti.pg.gda.pl
Place: building of ETI Faculty , room 207

The main area of my interest are:

MA Thesis (Computer Science): "Investigation of Compact Tasks Scheduling on Dedicated Processors", PG WETI (1997) - awarded the first prize in the contest for the best MA thesis in Computer Science organized by Polish Information Processing Society.

MA Thesis (Mathematics): "Gröbner's Base. Buchberger's Algorithm", UG WMAT (1998).

Ph.D. Thesis: "Task Scheduling Without 2-Sided Waiting Periods on Dedicated Processors", PG WETI (1999).

D.Sc. (Habilitation) in Computer Science: "Task Scheduling by Graph Coloring", PG WETI (2003).
 

My publications:

 

Articles

  1. K. Giaro, W. Gorzkowski, M. Motylewski, A correct description of the interaction between a magnetic moment and its image, Physica C, 168 (1990), 479-481.
  2. K. Giaro, M. Kubale, M. Małafiejski, Compact scheduling of unit tasks in open shop without interruptions, (in Polish) Zesz. Nauk. Pol. Śl., Ser. Autom. 117 (1996), 29-36.
  3. K. Giaro, The complexity of consecutive D-coloring of bipartite graphs: 4 is easy, 5 is hard, Ars Combinatoria 47 (1997), 287-300.
  4. K. Giaro, M. Kubale, Consecutive edge-colorings of complete and incomplete Cartesian products of graphs, Congr. Numer. 128 (1997), 143-149.
  5. K. Giaro, A system of dipoles near the first type superconductor, Young Physicists' Research Papers , IF PAN, Warszawa (1998) 19-25.
  6. K. Giaro, A network of resistors, Young Physicists' Research Papers , IF PAN, Warszawa (1998) 27-37.
  7. K. Giaro, On the real impedance of a circuit containing coils and capacitors, Young Physicists' Research Papers , IF PAN, Warszawa (1998) 39-42.
  8. K. Giaro, Task scheduling without waiting periods on dedicated processors, (in Polish) Zesz. Nauk. Pol. Śl., Ser. Autom. 123 (1998), 133-144.
  9. K. Giaro, M. Kubale, M. Małafiejski, Compact scheduling in open shop with zero-one time operations, INFOR 37 (1999), 37-47.
  10. K. Giaro, M. Kubale, M. Małafiejski, On the deficiency of bipartite graphs, Disc. Appl. Math. 94 (1999), 193-203.
  11. K. Giaro, Compact coloring of small bipartite graphs.Computer experiments, (in Polish) Zesz. Nauk. Pol. Śl., Ser. Autom. 131 (2000), 75-84.
  12. K. Giaro, M. Kubale, Edge-chromatic sum of trees and bounded cyclicity graphs, Inf. Process. Lett. 75 (2000), 65-69.
  13. K. Giaro, D. Szyfelbein, Compact scheduling of tasks in sparse open shop, (in Polish) Zesz. Nauk. Pol. Śl., Ser. Autom. 129 (2000), 73-82.
  14. K. Giaro, NP-hardness of compact scheduling in simplified open and flow shops, Euro. J. Oper. Res. 130 (2001), 90-98.
  15. K. Giaro, Task scheduling in acyclic Open Shop, (in Polish) Zesz. Nauk. AGH., Ser. Autom. 5 (2001), 213-220.
  16. K. Giaro, On an NP-hard sorting problem, Arch. Contr. Sci. 11 No. 1-2, (2001), 57-62.
  17. K. Giaro, M. Kubale, Complexity of compact scheduling of unit execution tasks in Open, Flow and Mixed Shop, (in Polish) Zesz. Nauk. AGH., Ser. Autom. 5 (2001), 329-334.
  18. K. Giaro, M. Kubale, M. Małafiejski, Consecutive colorings of the edges of general graphs, Disc. Math. 236 (2001), 131-143.
  19. M. Kubale, K. Manuszewski, K. Giaro, On the smallest hard to color sequentially graph, Congr. Numer. 150 (2001), 155-160.
  20. K. Giaro, R. Janczewski, On the frequency assignment problem, T-colorings of graphs and partial k-trees, (in Polish) Zesz. Nauk. Pol. Śl., Ser. Autom. 136 (2002), 67-73.
  21. K. Giaro, M. Kubale, Dynamic programming to solve scheduling problems in systems with acyclic structure, (in Polish) Zesz. Nauk. Pol. Śl., Ser. Autom. 134 (2002), 173-184.
  22. K. Giaro, M. Kubale, K. Piwakowski, Complexity results on open shop scheduling to minimize total cost of operations, IJCSS vol. 3 no. 2 (2002), 84-91.
  23. K. Giaro, R. Janczewski, M. Kubale, M. Małafiejski, A 27/26-approximation algorithm for the chromatic sum of bipartite graphs, LNCS 2462 (2002) 135-145.
  24. K. Giaro, M. Kubale, M. Małafiejski, K. Piwakowski, Dedicated scheduling of biprocessor tasks to minimize mean flow time, LNCS 2328 (2002), 87-96.
  25. K. Giaro, Some applications of nonstandard coloring models in scheduling of biprocessor unit tasks, (in Polish), Zesz. Nauk. AGH., T7 Automatyka, nr 1-2 (2003), 105-111.
  26. K. Giaro, R. Janczewski, M. Małafiejski, The complexity of the T-span problem for graphs with small degree, Disc. Appl. Math. 129 (2003), 361-369.
  27. K. Giaro, R. Janczewski, M. Małafiejski, Polynomial algorithm for finding T-span of generalized cacti, Disc. Appl. Math. 129 (2003), 371-382.
  28. K. Giaro, M. Kubale, Compact scheduling of zero-one time operations in multi-stage systems, Disc. Appl. Math. 145 (2004), 95-103.
  29. M. Małafiejski, K. Giaro, R. Janczewski, M. Kubale, Sum coloring of bipartite graphs with bounded degree, Algorithmica 40 (2004), 235-244.
  30. K. Giaro, M. Kubale, Scheduling is sparse system of unit 1- and 2-processor tasks in time windows, (in Polish), Zesz. Nauk. AGH., T9 Automatyka, nr 1-2 (2005), 85-94.
  31. K. Giaro, M. Kubale, Chromatic scheduling of 1- and 2-processor UET tasks on dedicated machines with availability constraints, LNCS 3911 (2006) 855-862.
  32. H. Furmańczyk, K. Giaro, M. Kubale, Equitable 4-coloring of cacti and edge-cacti in polynomial time, Int. J. of Pure and Applied Math., Vol. 27, No. 3 (2006), 377-389.
  33. K. Giaro, W. Szcześniak, Concepts and methods of task scheduling in reducing the power consumption of digital CMOS circuits, (in Polish), Zesz. Nauk. EiA-PG., nr 22 (2006), 55-62.
  34. K. Giaro, M. Kubale, Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs, Disc. Math. Graph Theory 29 (2009), 361-376.
  35. K. Giaro, M. Kubale, P. Obszarski, A graph coloring approach to scheduling multiprocessor task on dedicated machines with availability constrains, Disc. Appl. Math. 157 (2009), 3625-3630.
  36. D. Bogdanowicz, K. Giaro, R. Janczewski, Consensus models: Computational complexity aspects in modern approaches to the list coloring problem, Theor. Comp. Sci. 412 (2011), 4721-4728.
  37. D. Bogdanowicz, K. Giaro, Matching split distance for unrooted binary phylogenetic trees, IEEE/ACM Trans. on Comp. Biol. and Bioinformatics (to appear).

Conference papers

  1. K. Giaro, M. Kubale, On the edge-chromatic sum of a graph, Paul Erdös and his Mathematics, Budapest (1999), 81-82.
  2. K. Giaro, M. Kubale, M. Małafiejski, K. Piwakowski, Chromatic scheduling of dedicated 2-processor UET tasks to minimize mean flow time, ETFA'99, Barcelona (1999), 343-347.
  3. K. Giaro, M. Kubale, Compact scheduling of zero-one time operations in open and flow shops, PMS 2000, Osnabrueck (2000), 138-139.
  4. K. Giaro, M. Kubale, D. Szyfelbein, Consecutive graph coloring for school timetabling, PATAT 2000, Konstanz (2000), 212-221.
  5. K. Giaro, M. Kubale, K. Piwakowski, Complexity results on Open Shop scheduling to minimize mean flow time of operations, Proc. 10-th SMC Conf., Zakopane (2001), 207-210.
  6. K. Giaro, M. Kubale, Efficient list cost coloring of vertices and/or edges of some sparse graphs, ICNAAM 2007, Corfu (2007), 241-243.
  7. D. Bogdanowicz, K. Giaro, Some Results on Trading Model in a Consensus List Coloring, 1st International Conference on Information Technology, Gdańsk (2008), 293 - 296.
  8. J. Truszkowski, K. Giaro, Inferring Perfect Phylogenies with Restrictions on Character State Transitions, 1st International Conference on Information Technology, Gdańsk (2008), 399 - 402.
  9. 48. D. Bogdanowicz, K. Giaro, Comparing arbitrary unrooted phylogenetic trees using generalized matching split distance, 2st International Conference on Information Technology, Gdańsk (2010), 259 - 262.

Monographs, textbooks, studies

  1. K. Giaro, Task Scheduling Without 2-Sided Waiting Periods on Dedicated Processors, (in Polish), Ph. D. Thesis, PG WETI, Gdańsk (1999).
  2. K. Giaro,  Computational Complexity in Exercises, (in Polish), WPG, Gdańsk (2002).
  3. K. Giaro, Compact edge coloring, [in:] Discrere Optimization. Models and Methods of Graph Coloring, (in Polish), (M. Kubale, Ed.), WNT (2002), 167-189.
  4. H. Furmańczyk, K. Giaro, Restricted (p1,p2,..,pk) vertex coloring of simple graphs, [in:] Modeling and Optimisation - Methods and Applications, (in Polish), (J. Kasprzyk, J. Węglarz, Ed.), Exit, Warszawa (2002), 1-8.
  5. K. Giaro, Task Scheduling by Graph Coloring, (in Polish), D. Sc. Thesis, Wyd. PG, Monografie 37, Gdańsk (2003).
  6. K. Giaro, M. Kamiński, Introduction to Qauntum Algorithms, (in Polish), Exit, Warszawa (2003).
  7. K. Giaro, Interval edge-coloring of graphs, [in:] Graph Colorings, (M. Kubale, Ed.), Contemporary Mathematics 352, AMS (2004), 105-121.

Unpublished

Grants in which I participated

  1. KBN 8 T11C 012 11, Classical and Ramsey Methods of Graph Coloring and its Application, (1996-99).
  2. KBN 8 T11C 030 15, Task Scheduling Without Waiting Periods on Dedicated Processors, (1998-99).
  3. KBN 8 T11C 011 17, Development of the Chromatic Method and its Technical Applications, (1999-2002).
  4. KBN 4 T11C 047 25, Development of the Chromatic Method and its Technical Applications II, (2003-2006).
  5. KBN 3 T11B 015 27, Hybrid System for Reducing the Power Consumption of Digital VLSI CMOS Circuits, (2004-2006).
  6. MNiSW N516 029 31/2941, Models and Methods of Graph Coloring in Scientific and Technical Applications, (2006-2009).
  7. MNiSW N519 025 32/3054, Chromatic Methods for Network Routing, (2007).
  8. N N519 405837, Development and Implementation of Algorithmic Tools Based on Graph Chromatic Theory for Scientific and Technical Applications, (2009-2012).

Teaching

My schedule (14.02.2011 - 7.06.2011)

  Monday Tuesday Wednesday Thursday Friday
815-900         OWSIiZ
915-1000   RW    
1015-1100   Ex EA 06   Ex EA 06
1115-1200   Cons.  EA 207   Lec EA 234
1215-1300    
1315-1400 Ex NE 233     OWSIiZ
1415-1500   Ex NE 209  
1515-1600 Lec NE A1L      
1615-1700     Ex NE 209
1715-1800 Ex NE 209      
1815-1900       Ex NE 209
Subjects: Operational Research (BO) Quantum Computing (OK)

Automata Theory


Miscellaneous

Hobbies: fantasy books, mountain tourism, music.

Play checkers!

statystyka