A Local Distributed Algorithm to Approximate MST in Unit Disc Graphs. - Krzysztof Krzywdzinski (FCT, 2009)

Efficient Construction of (d+1, 3d)-Ruling Set in Wireless Ad Hoc Networks. - Krzysztof Krzywdzinski (ICCCI (SCI Volume), 2009)

Efficient Coloring of Wireless Ad Hoc Networks With Diminished Transmitter Power. - Krzysztof Krzywdzinski (IMCSIT, 2010)

Fast Construction of Broadcast Scheduling and Gossiping in Dynamic Ad Hoc Networks. - Krzysztof Krzywdzinski (IMCSIT, 2010)

Geometric Graphs with Randomly Deleted Edges - Connectivity and Routing Protocols. - Krzysztof Krzywdzinski; Katarzyna Rybarczyk (MFCS, 2011)

Brief Announcement: Distributed Approximations for the Semi-matching Problem. - Andrzej Czygrinow; Michal Hanckowiak; Krzysztof Krzywdzinski; Edyta Szymanska; Wojciech Wawrzyniak (DISC, 2011)

On the complexity of distributed BFS in ad hoc networks with spontaneous wake-up. - Krzysztof Krzywdzinski; Dariusz R. Kowalski (Discret. Math. Theor. Comput. Sci., 2013)

On a local similarity of graphs. - Tomasz Dzido; Krzysztof Krzywdzinski (Discret. Math., 2015)

Distributed algorithms for random graphs. - Krzysztof Krzywdzinski; Katarzyna Rybarczyk (Theor. Comput. Sci., 2015)