Karolina Soltys

According to our database, Karolina Soltys authored at least 5 papers between 2011 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2013

A Completeness Theory for Polynomial (Turing) Kernelization.

Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

2012

Review of permutation patterns, edited by Steve Linton, Nik Ruškuc, Vincent Vatter.

Karolina Soltys

SIGACT News, 2012

Scrabble Is PSPACE-Complete.

Michael Lampis, Valia Mitsou, Karolina Soltys

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

2011

Hierarchies of Inefficient Kernelizability

Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu

CoRR, 2011

The Hardness of Median in the Synchronized Bit Communication Model.

Karolina Soltys

Proceedings of the Theory and Applications of Models of Computation, 2011