Publikacje

  1. Nair M.M. de Abreu, Krystyna T. Balińska, Slobodan K. Simić, Krzysztof T. Zwierzyński, More on Non-regular Bipartite Integral Graphs with Maximum Degree 4 not having ±1 as Eigenvalues, Appl. Anal. Discrete Math. 8 (2014), pp. 123–154.
  2. Krzysztof T. Zwierzyński, Adam Meissner, Magdalena A. Niwińska, A method involving constraint programming for generating integral graphs without ±1 in the spectrum. A case study, Wydawnictwo PTPN, Studia z Automatyki i Informatyki, Tom 35, Poznań, 2010, pp. 105-114.
  3. Beata M. Jankowska, Magdalena Szymkowiak, Krzysztof T. Zwierzyński, Cost-Effectiveness Analysis of Transferring Medical Data over P2P Network, in: Computers in Medical Activity, series Advances in Soft Computing, Volume 65/2009, Springer Berlin/Heidelberg, 2009, pp. 201-210.
  4. Krystyna T. Balińska, Krzysztof T. Zwierzyński, On Minimal Nonperfect Graphs, Wydawnictwo PTPN, Studia z Automatyki i Informatyki, Tom 33, Poznań, 2008, pp. 7–12.
  5. Adam Meissner, Magdalena A. Niwińska, Krzysztof T. Zwierzyński, Computing an Irregularity Strength of Connected Graphs by Parallel Constraint Solving in the Mozart System, Lecture Notes in Computer Science, Volume 4967/2008, Springer, 2008, pp.1096-1103.
  6. Krystyna T. Balińska, Slobodan K. Simić, Krzysztof T. Zwierzyński, On generating graphs with bounded degree and a given chromatic number, Studia z Automatyki i Informatyki, tom 32, 2007, s. 7-16.
  7. Krystyna T. Balińska, Louis V. Quintas, Krzysztof T. Zwierzyński, Extremal size graphs with bounded degree, Ars Combinatoria Vol. 81 (October 2006), pp. 235-246.
  8. Krystyna T. Balińska, Slobodan K. Simić, Krzysztof T. Zwierzyński, On generating 4-regular integral graphs, Wydawnictwo PTPN, Studia z Automatyki i Informatyki, Tom 31, Poznań, 2006, s. 7-16.
  9. Adam Meissner, Magdalena A. Niwińska, Krzysztof T. Zwierzyński, Computing an irregularity strength of selected graphs • SHORT COMMUNICATION • Electronic Notes in Discrete Mathematics, Volume 24, 15 July 2006, Pages 137-144.
  10. Krystyna T. Balińska, Michael L. Gargano, Louis V. Quintas, Krzysztof T. Zwierzyński, Hamilton paths in graphs whose vertices are graphs, Journal of Combinatorial Mathematics and Combinatorial Computing, Vol. 56 (February 2006), pp. 3-16.
  11. Adam Meissner, Krzysztof T. Zwierzyński, Vertex-Magic Total Labeling of a Graph by Distributed Constraint Solving in the Mozart System, Lecture Notes in Computer Science, Volume 3911, 2006, pp. 952 - 959 (10.1007/11752578_115).
  12. Krystyna T. Balińska, Slobodan K. Simić, Krzysztof T. Zwierzyński, Which non-regular bipartite integral graphs with maximum degree four do not have ± 1 as eigenvalues?, Discrete Mathematics, Volume 286, Issues 1-2, 6 September 2004, Pages 15-24.
  13. Krzysztof T. Zwierzyński, Wybrane metody wyszukiwania klik w grafach, XII Konferencja Naukowo-Techniczna Stowarzyszenia Elektryków Polskich i Wydziału Elektrycznego Politechniki Poznańskiej "Urządzenia i usługi elektroenergetyczne, telekomunikacyjne i informatyczne u progu XXI wieku", Poznań, 17-18 września 2003, 139-142.
  14. Krystyna T. Balińska, Krzysztof T. Zwierzyński, Michael L. Gargano, Louis V. Quintas, Extremal Size Problems for Graphs with Non-Traceable Edges, Congressus Numerantium 162 (2003), pp.55-64.
  15. Krystyna T. Balińska, Slobodan K. Simić, Krzysztof T. Zwierzyński, On Finite and Infinite Sets of Integral Graphs, Collection of papers of the Faculty of Maritime Studies at Kotor, N° 20/2003, pp. 319-336.
  16. Krystyna Balińska, Krzysztof T. Zwierzyński, Projektowanie algorytmów grafowych, Wydawnictwo Politechniki Poznańskiej, Poznań, 2002 (ISBN 83-7143-548-7).
  17. Krystyna T. Balińska, Mirosław Kupczyk, Krzysztof T. Zwierzyński, Algorithms for generating integral graphs, Miscellanea Algebraicae, WZiA AŚ Kielce Rok 5, No.1 2001, 7-21.

Raporty

  1. Krystyna T. Balińska, Krzysztof T. Zwierzyński, Louis V. Quintas, Edgar G. DuCasse, Domination in graphs whose vertices are forests with bounded degree, Computer Science Center Report No. 634, The Technical University of Poznań, 2012, pp. 1-17.
  2. Krystyna T. Balińska, Krzysztof T. Zwierzyński, Louis V. Quintas, The maximum number of one-edge extensions for graphs with bounded degree, Computer Science Center Report No. 579, The Technical University of Poznań, 2009, pp. 1-14.
  3. Krystyna T. Balińska, Slobodan K. Simić, Krzysztof T. Zwierzyński, Some properties of integral graphs on 13 vertices, Computer Science Center Report No. 578, The Technical University of Poznań, 2009, pp. 1-63.
  4. Krystyna T. Balińska, Louis V. Quintas, Krzysztof T. Zwierzyński, One-edge extentions of graphs with bounded degree, Computer Science Center Report No. 576, The Technical University of Poznań, 2008, pp. 1-15.
  5. Beata M. Jankowska, Magdalena Szymkowiak, Krzysztof T. Zwierzyński, Cost-Effectiveness Analysis of Transferring Medical Data over P2P Network, Computer Science Center Report No. 553, The Technical University of Poznań, 2007, pp. 1-11.
  6. Krystyna T. Balińska, Slobodan K. Simić, Krzysztof T. Zwierzyński, There are 65 4-regular integral graphs of order less than twenty, Computer Science Center Report No. 525, The Technical University of Poznań, 2006, pp. 1-17.
  7. Krzysztof T. Zwierzyński, An evolutionary algorithm for generating graphs with a given spectrum, Computer Science Center Report No. 519, The Technical University of Poznań, 2005, pp. 1-?.
  8. Magdalena A. Niwińska, Krzysztof T. Zwierzyński, Algorytmy generowania drzew, Instytut Automatyki i Inżynierii Informatycznej, Raport 520, Politechnika Poznańska, 2005, s. 1-?.
  9. Mirko Lepović, Slobodan K. Simić, Krystyna T. Balińska, Krzysztof T. Zwierzyński, There are 93 non-regular, bipartite integral graphs with maximum degree four, Computer Science Center Report No. 511, The Technical University of Poznań, 2005, pp. 1-17.
  10. Krystyna T. Balińska, Krzysztof T. Zwierzyński, Michael L. Gargano, Louis V. Quintas, Graphs with non-traceable edges, Computer Science Center Report No. 485, The Technical University of Poznań, 2002, pp. 1-21.
  11. Krystyna T. Balińska, Louis V. Quintas, Krzysztof T. Zwierzyński, Extremal size problems for graphs with bounded degree, Computer Science Center Report No. 484, The Technical University of Poznań, 2002, pp. 1-39.
  12. Krystyna T. Balińska, Mirosław Kupczyk, Slobodan K. Simić, Krzysztof T. Zwierzyński, On generating all integral graphs on 13 vertices, Computer Science Center Report No. 483, The Technical University of Poznań, 2002, pp. 1-42.
  13. Krystyna T. Balińska, Mirosław Kupczyk, Slobodan K. Simić, Krzysztof T. Zwierzyński, On generating all integral graphs on 12 vertices, Computer Science Center Report No. 482, The Technical University of Poznań, 2001, pp. 1-36.
  14. Krystyna T. Balińska, Mirosław Kupczyk, Slobodan K. Simić, Krzysztof T. Zwierzyński, On generating all integral graphs on 11 vertices, Computer Science Center Report No. 469, The Technical University of Poznań, 1999/2000, pp. 1-53.
  15. Krystyna T. Balińska, Krzysztof T. Zwierzyński, Algorithms for the maximum outdegree problem, Computer Science Center Report No. 463, The Technical University of Poznań, 1999, pp. 1-?.
  16. Krystyna T. Balińska , Mirosław Kupczyk, Krzysztof T. Zwierzyński, Methods of generating integral graphs, Computer Science Center Report No. 457, The Technical University of Poznań, 1998, pp. 1-68.
  17. Krzysztof T. Zwierzyński, An algorithm for the enumeration of graph automorphisms, Computer Science Center Report No. 446, The Technical University of Poznań, 1996, pp. 1-10.
  18. Krzysztof T. Zwierzyński, Zliczanie grafów samodopełniających, Computer Science Center Report No. 443, The Technical University of Poznań, 1995, pp. 1-7.
  19. Krzysztof T. Zwierzyński, Algorytm wyznaczania liczby grafów metodą Pólya'i, Computer Science Center Report No. 442, The Technical University of Poznań, 1995, pp. 1-12.

Referaty

  1. Krzysztof T. Zwierzyński, Generating integral graphs using PRACE Research Infrastructure, Cracow Grid Workshops 2012, Kraków, October 22-24, 2012
  2. Krystyna T. Balińska, Krzysztof T. Zwierzyński*, On minimal graphs with a given difference between their chromatic and clique numbers, The Eighteenth Workshop on Cycles and Colourings, Tatranská Štrba, High Tatras, Slovakia, September 6-11, 2009.
  3. Magdalena Szymkowiak*, Beata Jankowska, Krzysztof T. Zwierzyński, Designing of Medical Rule-Based Systems from Heterogeneous Data, CMS 2007, Computer Methods and Systems, Metody i systemy komputerowe w projektowaniu inżynierskim, November 21-23, Krakov, Poland.
  4. Adam Meissner*, Magdalena Niwińska, Krzysztof T. Zwierzyński Computing an Irregularity Strength of Connected Graphs by Parallel Constraint Solving in the Mozart System, PPAM 2007, SEVENTH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING AND APPLIED MATHEMATICS September 9-12, 2007, Gdansk, POLAND.
  5. Krzysztof T. Zwierzyński*, Beata Jankowska, Magdalena Szymkowiak, Analysis of Effectivenes of Medical Data Transfer over P2P Network, Computers in Medical Activity, September 19-21, Łódź, Poland.
  6. Krzysztof T. Zwierzyński, An algorithm for generating random spanning trees 16th Workshop "3in1" GRAPHS 2007, November 8-10, 2007, Krynica, Poland.
  7. Krystyna T. Balińska*, Louis V. Quintas, Krzysztof T. Zwierzyński, An algorithm for generating graphs with a given chromatic number, CID 2007, Colourings, Independence and Domination, 12th Workshop on Graph Theory, September 16-21, 2007, Karpacz, Poland.
  8. Krystyna T. Balińska*, Louis V. Quintas, Krzysztof T. Zwierzyński, An extremal problem for graphs with bounded degree, 15th Workshop "3in1" GRAPHS 2006, November 9-11, 2006, Krynica, Poland.
  9. Krzysztof T. Zwierzyński*, A reconstruction problem for integral graphs, Poznań - Zielona Góra Workshop on Combinatorics, October 15-18, 2006, Będlewo, Poland.
  10. Krystyna T. Balińska*, Krzysztof T. Zwierzyński, Slobodan K. Simić, Algorithms for generating integral graphs, Poznań - Zielona Góra Workshop on Combinatorics, October 15-18, 2006, Będlewo, Poland.
  11. Krzysztof T. Zwierzynski*, Magdalena A. Niwińska, Adam Meissner, Computing an irregularity strength of selected graphs, Fifth Cracow Conference On Graph Theory "Ustron '06", September 11-15, 2006, Ustroń, Poland.
  12. Krzysztof T. Zwierzyński*, An evolutionary algorithm for generating integral graphs with a given spectrum, Aveiro Workshop on Graph Spectra, April 10 – 12, 2006 University of Aveiro, Aveiro – Portugal.
  13. Krystyna T. Balińska*, Krzysztof T. Zwierzyński, Slobodan K. Simić, On generating 4-regular integral graphs, Aveiro Workshop on Graph Spectra, April 10 – 12, 2006 University of Aveiro, Aveiro – Portugal.
  14. Krzysztof T. Zwierzyński*, On generating graphs with a given spectrum, The 7th Workshop on Combinatorics, Universita' degli Studi di Messina, Messina, Italy, October 4-8, 2005.
  15. Krystyna T. Balińska*, Slobodan K. Simić, Krzysztof T. Zwierzyński, Algorithms for generating integral graphs, The 7th Workshop on Combinatorics, Universita' degli Studi di Messina, Messina, Italy, October 4-8, 2005.
  16. Krzysztof T. Zwierzyński*, Ewolucyjny algorytm generowania grafów całkowitych, Seminarium z algorytmów grafowych, UAM, Poznań, 2 listopada 2004.
  17. Krzysztof T. Zwierzyński*, An edge partition problem concerning Hamilton cycles, The Thirteenth Workshop Cycles and Colourings, Tatranská Štrba, High Tatras, Slovakia, September 5-10, 2004.
  18. Krystyna T. Balińska, Tomasz Lubiński*, Krzysztof T. Zwierzyński, An algorithm for generating regular graphs, 10th workshop on graph theory: Colourings, Independence and Domination, Karpacz, September 22-26, 2003.
  19. Krzysztof T. Zwierzyński, Algorytmy losowe w metodach generowania, badania i wizualizacji obiektów kombinatorycznych, Seminarium monograficzne, Zakład Technologii i Systemów Informatycznych, Poznań, 27 luty 2003.
  20. Krystyna T. Balińska, Michael L. Gargano, Louis V. Quintas, Krzysztof T. Zwierzyński*, On an edge colouring problem, UAM, Poznań, December 10, 2002.
  21. Krystyna T. Balińska*, Louis V. Quintas, Krzysztof T. Zwierzyński, On extremal size problems for graphs with bounded degree, Fourth Cracow Conference on Graph Theory "Czorsztyn '02", September 16-20, 2002.
  22. Krystyna T. Balińska, Michael L. Gargano, Louis V. Quintas, Krzysztof T. Zwierzyński*, On an edge colouring problem, Workshop Cycles and Colourings, Stará Lesná, Slovac Republic, September 9-13, 2002.
  23. Krystyna T. Balińska, Slobodan K. Simić*, Krzysztof T. Zwierzyński, Some Remarks On Non-regular Integral Graphs With Maximum Degree Four, Workshop Cycles and Colourings, Stará Lesná, Slovac Republic, September 9-14, 2001.
  24. Krystyna T. Balińska*, Louis V. Quintas, Krzysztof T. Zwierzyński, Edge maximal graphs with bounded degree, The 9th International Workshop in Mathematics, Gronów, 22 September, 2001.
  25. Krystyna T. Balińska*, Slobodan K. Simić, Krzysztof T. Zwierzyński, Graphs with integral spectra, Special session AMS:SSM1 dedicated to Frank Harary on his 80th Birthday, USA, New Jersey, Hoboken April 28-29, 2001.
  26. Krystyna T. Balińska*, Slobodan K. Simić, Krzysztof T. Zwierzyński, Generating integeral graphs of a given order, Pace University Mathemathics and Computer Science Seminar, New York, USA, April 25, 2001.
  27. Krystyna T. Balińska*, Slobodan K. Simić, Krzysztof T. Zwierzyński, On Infinite Families of Bipartite Integral Graphs, Finite and Infinite Combinatorics, Budapest, Hungary, January 5-10, 2001.
  28. Krzysztof T. Zwierzyński*, An Heuristic Algorithm for Generating Integral Graphs, Finite and Infinite Combinatorics, Budapest, Hungary, January 5-10, 2001.
  29. Krystyna T. Balińska*, Krzysztof T. Zwierzyński, Slobodan K. Simić, New infinite families of integral graphs, The Eighth International Workshop in Mathematics "Gronów 2000", September 25-29, 2000.
  30. Krzysztof T. Zwierzyński*, An Evolutionary Algorithm of Generating Integral Graphs, Czech and Slovak Conference "Graph 2000", Liptovsky Trnovec - Slovakia, May 15-19, 2000.
  31. Krystyna T. Balińska*, Krzysztof T. Zwierzyński, Slobodan K. Simić, Methods of generating and some properties of integral graphs, Czech and Slovak Conference "Graph 2000", Liptovsky Trnovec - Slovakia, May 15-19, 2000.
  32. Krystyna T. Balińska*, Krzysztof T. Zwierzyński, ???, Fifth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Prague, July 6-11, 1998.
  33. Krystyna T. Balińska*, Krzysztof T. Zwierzyński, Algorithms for the graph isomorphism/automorphism problems, Minisemester, Selected Topics in Discrete Mathematics, Stefan Banach International Mathematical Center, September 16, Warsaw, 1996.
*) - osoba wygłaszająca