The Hardness of Median in the Synchronized Bit Communication Model. - Karolina Soltys (TAMC, 2011)

Hierarchies of Inefficient Kernelizability - Danny Hermelin; Stefan Kratsch; Karolina Soltys; Magnus Wahlström; Xi Wu 001 (CoRR, 2011)

Review of permutation patterns, edited by Steve Linton, Nik Ruškuc, Vincent Vatter. - Karolina Soltys (SIGACT News, 2012)

A Completeness Theory for Polynomial (Turing) Kernelization. - Danny Hermelin; Stefan Kratsch; Karolina Soltys; Magnus Wahlström; Xi Wu 001 (Algorithmica, 2015)

Scrabble is PSPACE-Complete. - Michael Lampis; Valia Mitsou; Karolina Soltys (J. Inf. Process., 2015)