A note on selection networks. - Krzysztof Diks (Symposium on Computation Theory, 1984)

Embeddings of Binary Trees in Lines. - Krzysztof Diks (Theor. Comput. Sci., 1985)

A Fast Parallel Algorithm for Six-Colouring of Planar Graphs (Extended Abstract). - Krzysztof Diks (MFCS, 1986)

Saturating Flows in Networks. - Bogdan S. Chlebus; Marek Chrobak; Krzysztof Diks (FCT, 1987)

Parallel 5-Colouring of Planar Graphs. - Torben Hagerup; Marek Chrobak; Krzysztof Diks (ICALP, 1987)

Parallel Recognition of Outerplanar Graphs. - Krzysztof Diks (Parallel Algorithms and Architectures, 1987)

Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models. - Bogdan S. Chlebus; Krzysztof Diks; Torben Hagerup; Tomasz Radzik (MFCS, 1988)

Testing Isomorphism of Outerplanar Graphs in Parallel. - Bogdan S. Chlebus; Krzysztof Diks; Tomasz Radzik (MFCS, 1988)

Edge Separators for Planar Graphs and Their Applications. - Krzysztof Diks; Hristo N. Djidjev; Ondrej Sýkora; Imrich Vrto (MFCS, 1988)

New Simulations between CRCW PRAMs. - Bogdan S. Chlebus; Krzysztof Diks; Torben Hagerup; Tomasz Radzik (FCT, 1989)

Parallel Complexity of Lexicographically First Order Problems for Tree-Structured Graphs (Extended Abstract). - Bogdan S. Chlebus; Krzysztof Diks; Wojciech Rytter; Tomasz Szymacha (MFCS, 1989)

Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract). - Krzysztof Diks; Torben Hagerup; Wojciech Rytter (MFCS, 1989)

Optimal Parallel Computations for Halin Graphs. - Krzysztof Diks; Wojciech Rytter (Optimal Algorithms, 1989)

Optimal Parallel 5-Colouring of Planar Graphs. - Torben Hagerup; Marek Chrobak; Krzysztof Diks (SIAM J. Comput., 1989)

Optimal Broadcasting in Faulty Hypercubes. - Bogdan S. Chlebus; Krzysztof Diks; Andrzej Pelc (FTCS, 1991)

On Optimal Parallel Computations for Sequences of Brackets. - Krzysztof Diks; Wojciech Rytter (Theor. Comput. Sci., 1991)

Improved Deterministic Parallel Integer Sorting - P. C. P. Bhatt; Krzysztof Diks; Torben Hagerup; V. C. Prasad; Tomasz Radzik; Sanjeev Saxena (Inf. Comput., 1991)

Almost Safe Gossiping in Bounded Degree Networks. - Krzysztof Diks; Andrzej Pelc (SIAM J. Discret. Math., 1992)

Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings. - Krzysztof Diks; Oscar Garrido; Andrzej Lingas (Int. J. Found. Comput. Sci., 1993)

Fast Diagnosis of Multiprocessor Systems with Random Faults. - Krzysztof Diks; Andrzej Pelc (RAIRO Theor. Informatics Appl., 1993)

Edge Separators of Planar and Outerplanar Graphs with Applications. - Krzysztof Diks; Hristo N. Djidjev; Ondrej Sýkora; Imrich Vrto (J. Algorithms, 1993)

Waking up an Anonymous Faulty Network from a Single Source. - Bogdan S. Chlebus; Krzysztof Diks; Andrzej Pelc (HICSS (2), 1994)

The Buffer Potential of a Network. - Krzysztof Diks; Evangelos Kranakis; A. Malinowsky; Andrzej Pelc (SIROCCO, 1994)

Fast gossiping with short unreliable messages. - Bogdan S. Chlebus; Krzysztof Diks; Andrzej Pelc (Discret. Appl. Math., 1994)

Optimal Coteries and Voting Schemes. - Krzysztof Diks; Evangelos Kranakis; Danny Krizanc; Bernard Mans; Andrzej Pelc (Inf. Process. Lett., 1994)

Sparse Networks Supporting Efficient Reliable Broadcasting. - Bogdan S. Chlebus; Krzysztof Diks; Andrzej Pelc (Nord. J. Comput., 1994)

Reliable Token Despersal with Random Faults. - Krzysztof Diks; Adam Malinowski; Andrzej Pelc (Parallel Process. Lett., 1994)

Sorting on a Mesh-Connected Computer with Delaying Links. - Bogdan S. Chlebus; Krzysztof Diks; Andrzej Pelc (SIAM J. Discret. Math., 1994)

O(log log n)-Time Integer Geometry on the CRCW PRAM. - Bogdan S. Chlebus; Krzysztof Diks; Miroslaw Kowaluk (Algorithmica, 1995)

Token Transfer in a Faulty Network. - Krzysztof Diks; Adam Malinowski; Andrzej Pelc (RAIRO Theor. Informatics Appl., 1995)

Anonymous Wireless Rings. - Krzysztof Diks; Evangelos Kranakis; Adam Malinowski; Andrzej Pelc (Theor. Comput. Sci., 1995)

Reliable Broadcasting in Hypercubes with Random Link and Node Failures. - Bogdan S. Chlebus; Krzysztof Diks; Andrzej Pelc (Comb. Probab. Comput., 1996)

Parallel Maximum Independent Set in Convex Bipartite Graphs. - Artur Czumaj; Krzysztof Diks; Teresa M. Przytycka (Inf. Process. Lett., 1996)

Broadcasting with universal lists. - Krzysztof Diks; Andrzej Pelc (Networks, 1996)

Fault-Tolerant Linear Broadcasting. - Krzysztof Diks; Andrzej Pelc (Nord. J. Comput., 1996)

Efficient Gossiping by Packets in Networks with Random Faults. - Krzysztof Diks; Andrzej Pelc (SIAM J. Discret. Math., 1996)

Reliable Computations on Faulty EREW PRAM. - Krzysztof Diks; Andrzej Pelc (Theor. Comput. Sci., 1996)

Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes (Extended Abstract). - Krzysztof Diks; Andrzej Pelc (ESA, 1997)

Transition-Optimal Token Distribution. - Bogdan S. Chlebus; Krzysztof Diks; Andrzej Pelc (Fundam. Informaticae, 1997)

Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures. - Piotr Berman; Krzysztof Diks; Andrzej Pelc (J. Algorithms, 1997)

Globally Optimal Diagnosis in Systems with Random Faults. - Krzysztof Diks; Andrzej Pelc (IEEE Trans. Computers, 1997)

Perfect Broadcasting in Unlabeled Networks. - Krzysztof Diks; Evangelos Kranakis; Andrzej Pelc (Discret. Appl. Math., 1998)

Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages. - Krzysztof Diks; Stefan Dobrev; Evangelos Kranakis; Andrzej Pelc; Peter Ruzicka (Inf. Process. Lett., 1998)

Broadcasting in Unlabeled Tori. - Krzysztof Diks; Evangelos Kranakis; Andrzej Pelc (Parallel Process. Lett., 1998)

More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. - Krzysztof Diks; Torben Hagerup (Theor. Comput. Sci., 1998)

System Diagnosis with Smallest Risk of Error. - Krzysztof Diks; Andrzej Pelc (Theor. Comput. Sci., 1998)

The Impact of Knowledge on Broadcasting Time in Radio Networks. - Krzysztof Diks; Evangelos Kranakis; Danny Krizanc; Andrzej Pelc (ESA, 1999)

An Optimal Algorithm for Broadcasting Multiple Messages in Trees. - Krzysztof Diks; Andrzej Lingas; Andrzej Pelc (J. Parallel Distributed Comput., 1999)

Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes. - Krzysztof Diks; Andrzej Pelc (Algorithmica, 2000)

Reliable Minimum Finding Comparator Networks. - Piotr Denejko; Krzysztof Diks; Andrzej Pelc; Marek Piotrów (Fundam. Informaticae, 2000)

A New 3-Color Criterion for Planar Graphs. - Krzysztof Diks; Lukasz Kowalik; Maciej Kurowski (WG, 2002)

The impact of information on broadcasting time in linear radio networks. - Krzysztof Diks; Evangelos Kranakis; Danny Krizanc; Andrzej Pelc (Theor. Comput. Sci., 2002)

Tree exploration with little memory. - Krzysztof Diks; Pierre Fraigniaud; Evangelos Kranakis; Andrzej Pelc (J. Algorithms, 2004)

Exploring Planar Graphs Using Unoriented Maps. - Krzysztof Diks; Stefan Dobrev; Andrzej Pelc (J. Interconnect. Networks, 2006)

Dynamic Plane Transitive Closure. - Krzysztof Diks; Piotr Sankowski (ESA, 2007)

From Top Coders to Top IT Professionals. - Krzysztof Diks; Jan Madey (ISSEP, 2008)

Perfect Matching for Biconnected Cubic Graphs in O(n log2n) Time. - Krzysztof Diks; Piotr Stanczyk (SOFSEM, 2010)

Algorithms for Communication Problems for Mobile Agents Exchanging Energy. - Jerzy Czyzowicz; Krzysztof Diks; Jean Moussi; Wojciech Rytter (CoRR, 2015)

Communication Problems for Mobile Agents Exchanging Energy. - Jurek Czyzowicz; Krzysztof Diks; Jean Moussi; Wojciech Rytter (SIROCCO, 2016)

Energy-Optimal Broadcast in a Tree with Mobile Agents. - Jerzy Czyzowicz; Krzysztof Diks; Jean Moussi; Wojciech Rytter (ALGOSENSORS, 2017)

Broadcast with Energy-Exchanging Mobile Agents Distributed on a Tree. - Jurek Czyzowicz; Krzysztof Diks; Jean Moussi; Wojciech Rytter (SIROCCO, 2018)

Energy-optimal broadcast and exploration in a tree using mobile agents. - Jurek Czyzowicz; Krzysztof Diks; Jean Moussi; Wojciech Rytter (Theor. Comput. Sci., 2019)