Publikacje

  1. Branches in scale-free trees, Journal of Mathematical Sci., (2008) to appear (z M. Dondajewskim).
  2. Concentration of vertex degrees of a scale-free random graph process, Random Structures & Algorithms, 26 (2005), 224-236.
  3. Digraphs whose nodes are multigraphs having exactly two degrees f and 2, Ars Combinatoria, 64 (2002) (z L. V. Quintasem).
  4. Graphs whose vertices are forests with bounded degree: distance problems, The Bulletin of The Institute of Combinatorics and its Applications, 28 (2000), 25-35 (z L. V. Quintasem) (ps).
  5. Branches in recursive trees, Fasciculi Math., 29 (1999), 139-147. (ps)
  6. Vertices of small degrees in random recurive dags, Fasciculi Math., 28 (1998), 28-41 (z M. Dondajewskim). (ps 160KB)
  7. Algorithms for sequential and random generation of recuresive trees and dags, Graph Theory Notes of New York, New York Academy of Science, XXXII:7 (1997), 35-40.
  8. A kinetic approach to the random f-graph process. Paths, cycles and components, Discrete Applied Math., 67 (1996,) 13-25 (z K. T. Balińską, H. Galiną i L. V. Quintasem).
  9. A kinetic approach to the random f-graph process with nonuniform edge probabilities, J. Chem. Inf. Comput. Sci., 36 (1996), 347-350 (z K. T. Balińską, H. Galiną i L. V. Quintasem).
  10. A linear algorithm for the generation of a random plane tree, Graph Theory Notes of New York, XXX (1996), 38-41 (z M. Dondajewskim).
  11. Random recursive forests, Random Structures & Algorithms, 5 (1994), 3-12 (z K. T. Balińską, L. V. Quintasem).
  12. On the structure of random plane-oriented recursive trees and their branches, Random Structures & Algorithms, 4 (1993), 151-176 (z H. M. Mahmoudem i R. T. Smythem)
  13. Nonuniform random recursive trees with bounded degrees, w ,,Sets, Graphs and Numbers," Colloquia Mathematics Societatis Janos Bolyai, 60 (1991), 611-620 (z L. V. Quintasem)
  14. On the complexity of algorithms on recursive trees, Theoretical Computer Sci., 74 (1990), 355-361.
  15. Height of a random recursive tree, Graph Theory Notes of New York, XVI (1988), 23-25.
  16. On the maximum degree and the height of a random recursive tree, w "Random Graphs '87" (M. Karoński, J. Jaworski and A. Rucinski, eds.), John Wiley & Sons, 1990, 313-324.
  17. Wybór agregatów w pompowniach w wyniku przeglądu pewnych wariantów, Zeszyty Naukowe PP, Ser. Budownictwo Lądowe, 29 (1987), 21-33 (z H. Bylką i M. Dondajewskim).
  18. On the nonuniform random recursive tree, Annals of Discrete Math., 33 (1987), 297-306.
  19. Vertex degrees in strata of a random recursive tree, Annals of Discrete Math., 28 (1987), 99-105 (z M. Dondajewskim i P. Kirschenhoferem).
  20. Generating functions of some property of random recursive trees, w "Papers on Numerical Methods and Their Applications," Zeszyty Naukowe AE w Poznaniu. Ser. I, 132 (1985), 23-26 (z M. Dondajewskim).
  21. On the distribution of vertex-degrees in strata of a random recursive tree, Bull. Acad. Polon. Sci. Ser. Sci. Math. XXX, 5-6 (1982), 205-209 (z M. Dondajewskim).
  22. Efektywność obliczeniowa funkcji iteracyjnych, w ,,Informatyka w Wielkopolsce", Poznań, 1978, 59-62 (z M. Dondajewskim).