Katarzyna Rybarczyk
POWRÓT  BACK  
CV
2010 - PhD in theoretical computer science on the Faculty of Mathematics and Computer Science at the Adam Mickiewicz University in Poznań, subject: "Random intersection graphs. Networks modeling and their analysis.
(PhD Thesis PDF file)
2005 - Master's degree in mathematics on the Faculty of Mathematics and Computer Science at the Adam Mickiewicz University in Poznań, subject of the Master Thesis: "On some applications of random hypergraphs" (in Polish); suprvisor prof. J.Jaworski
(Master Thesis PS file)
2005 - Master's degree in architecture on the Faculty of Architecture at the Technical University in Poznań, subject of the Master Thesis: "A school in a small town" (in Polish); suprvisors prof. H. Zaniewska and  dr S. Sipiński


GRANTS

2015-2017: director and principal investigator in grant 2014/13/D/ST1/01175; Algorithmic aspects of random graphs

2011-2014: principal investigator in grant 2011/01/B/ST1/03943; An analysis of the structure of graphs basing on random mappings and intersections of random sets

2008-2010: principal investigator in grant NN 206 258535; Modelowanie i analiza sieci za pomoca losowych grafow przeciec

PUBLICATIONS

submitted
  1. Hamilton cycles in the line graph of a random graph
  2. Finding Hamilton cycles in random intersection graphs.
  3. GHS algorithm on a graph with random weights.

2017
  1. The chromatic number of random intersection graphs. Discussiones Mathematicae Graph Theory, 37 (2), 465-476
  2. The coupling method for inhomogeneous random intersection graphs The Electronic Jourlal of Combinatorics, 24 (2), P2.10 (pp. 45)
  3. Poisson approximation of counts of subgraphs in random intersection graphs. (joint work with D. Stark) Discrete Mathematics, 340 (9), 2183-2193 ( arxiv ) ;

2015
  1. Distributed algorithms for random graphs. (joint work with K. Krzywdziński), Theoretical Computer Science, 605, 95-105 ( preprint's PDF file );
  2. On the chromatic index of random uniform hypergraphs. (joint work with V. Kurauskas) SIAM J. Discrete Math., 29(1), 541–558 ; ( preprint's PDF file )
  3. Mixing in random digraphs with application to the forward-secure key evolution in wireless sensor networks. (joint work with M. Klonowski, M. Kutyłowski and M. Ren) ACM Transactions on Sensor Networks, 11 (2), Article No. 29 ( preprint's PDF file );
  4. [survey] Recent Progress in Complex Network Analysis: Models of Random Intersection Graphs. (joint work with M. Bloznelis, E. Godehardt , J. Jaworski, and V. Kurauskas) In: B. Lausen, S. Krolak-Schwerdt, and M. Boehmer (Eds.): Data Science, Learning by Latent Structures, and Knowledge Discovery, Studies in Classification, Data Analysis, and Knowledge Organization, pp 69-78 ( preprint's PDF file );
  5. [survey] Recent Progress in Complex Network Analysis: Properties of Random Intersection Graphs. (joint work with M. Bloznelis, E. Godehardt , J. Jaworski, and V. Kurauskas) In: B. Lausen, S. Krolak-Schwerdt, and M. Boehmer (Eds.): Data Science, Learning by Latent Structures, and Knowledge Discovery, Studies in Classification, Data Analysis, and Knowledge Organization, pp 79-88 ( preprint's PDF file );

2014
  1. k-connectivity of uniform s-intersection graphs. (joint work with M. Bloznelis) Discrete Mathematics 333, 94-100 ( preprint's PDF file ) ;
  2. Constructions of independent sets in random intersection graphs. Theoretical Computer Science 524, 103–125; ( preprint's PDF file )

2013
  1. Coupling methods to establish threshold functions in random graphs. Electronic Notes in Discrete Mathematics 43, 57-62 (extended abstract of The coupling method for inhomogeneous random intersection graphs ) ;

2012
  1. The Degree Distribution in Random Intersection Graphs; Challenges at the Interface of Data Analysis, Computer Science, and Optimization: Studies in Classification, Data Analysis, and Knowledge Organization 43, 291-299;  
  2. Clustering Coefficient of Random Intersection Graphs, (joint work with E. Godehardt and J. Jaworski), Challenges at the Interface of Data Analysis, Computer Science, and Optimization: Studies in Classification, Data Analysis, and Knowledge Organization 43, 243-253;

2011
  1. Equivalence of the random intersection graph and G(n,p); Random Structures and Algorithms, 38, 205-234, 2011; ( arxiv )
  2. Sharp Threshold Functions for Random Intersection Graphs via a Coupling Method; The Electronic Journal of Combinatorics, 18(1), P36, 2011;
  3. Diameter, connectivity, and phase transition of the uniform random intersection graph.; Discrete Mathematics, 311(17), 1998-2019, 2011 ( preprint's PDF file );
  4. Geometric Graphs with Randomly Deleted Edges - Connectivity and Routing Protocols. (joint work with K. Krzywdziński); LNCS 6907, 2011, 544-555 ( preprint's PDF file );

2010
  1. Poisson approximation of the number of cliques in a random intersection graph (joint work with D. Stark), Journal of Applied Probability, 47 (3), 826 - 840, 2010; 
  2. Isolated Vertices in Random Intersection Graphs (joint work with E. Godehardt and J. Jaworski), Studies in Classification, Data Analysis, and Knowledge Organization 36, Springer, 135--145, 2010;
2009
  1. Component evolution in a secure wireless sensor network (joint work with M. Bloznelis and J. Jaworski), Networks, 53 (1), 19-26, 2009;
  2. Random Key Predistribution for Wireless Sensor Networks Using Deployment Knowledge (joint work with J. Jaworski and M. Ren), Computing, 85 (1-2), 57–76, 2009;
2007
  1. Random Intersection Graphs and Classification (joint work with E. Godehardt and J. Jaworski), Studies in Classification Data Analysis, and Knowledge Organization 33, Springer, 67-74, 2007 ;
  2. Forward-Secure Key Evolution in Wireless Sensor Networks (joint work with M. Klonowski, M. Kutyłowski and M. Ren), LNCS 4856, CANS 2007, Springer, 102-120, 2007;