We can proudly announce, that the paper “Connected Partitions via Connected Dominating Sets”, written by Aikaterini Niklanovits, Kirill Simonov, Shaily Verma and Ziena Zeif was accecpted to this years ESA 2025 Conference. Building on the classical Győri–Lovász theorem, the paper shows that connected partitions can be computed in polynomial time when the graph admits k disjoint connected dominating sets. This leads to new efficient constructive versions of the theorem, including
polynomial-time algorithms under high connectivity assumptions and exact constructive results for convex bipartite, biconvex, and interval graphs.The second paper “Text Image Super-Resolution for Improved OCR in Real-Life Scenarios using Swin Transformers ” written by Maximilian Schulze, Philipp Hildebrandt, Sarel Cohen, Vanja Doskoč, Raid Saabni and Tobias Friedrich was accepted the be presented at the DocEng 2025 Conference. We introduce a method that combines image super-resolution, restoration, and OCR, achieving state-of-the-art results on the TextZoom dataset. The approach both improves recognition accuracy and clarity in low-quality, distorted images, outperforming previous methods.