Publications - Current Year

“A Formal Correctness Proof of Edmonds’ Blossom Shrinking Algorithm,” Journal of Automated Reasoning, vol. 70, no. 2, 2026.

@article{Abdulaziz26,
TITLE = {A Formal Correctness Proof of Edmonds' Blossom Shrinking Algorithm},
AUTHOR = {Abdulaziz, Mohammad and Mehlhorn, Kurt},
LANGUAGE = {eng},
ISSN = {0168-7433},
DOI = {10.1007/s10817-026-09747-y},
PUBLISHER = {D. Reidel Pub. Co.},
ADDRESS = {Dordrecht, Holland},
YEAR = {2026},
DATE = {2026},
JOURNAL = {Journal of Automated Reasoning},
VOLUME = {70},
NUMBER = {2},
EID = {s10817-026-09747-y},
}

%0 Journal Article
%A Abdulaziz, Mohammad
%A Mehlhorn, Kurt 
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T A Formal Correctness Proof of Edmonds' Blossom Shrinking Algorithm : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0012-A6D1-4
%R 10.1007/s10817-026-09747-y
%7 2026-02-16
%D 2026
%J Journal of Automated Reasoning
%V 70
%N 2
%Z sequence number: s10817-026-09747-y
%I D. Reidel Pub. Co.
%C Dordrecht, Holland
%@ false

“On the Complexity of Computing the Co-lexicographic Width of a Regular Language,” Journal of Computer and System Sciences, vol. 158, 2026.

@article{Becker26,
TITLE = {On the Complexity of Computing the Co-lexicographic Width of a Regular Language},
AUTHOR = {Becker, Ruben and Cenzato, Davide and Kim, Sung-Hwan and Kociumaka, Tomasz and Kodric, Bojana and Policriti, Alberto and Prezza, Nicola},
LANGUAGE = {eng},
ISSN = {0022-0000},
DOI = {10.1016/j.jcss.2026.103759},
PUBLISHER = {Elsevier},
ADDRESS = {Amsterdam},
YEAR = {2026},
DATE = {2026},
JOURNAL = {Journal of Computer and System Sciences},
VOLUME = {158},
EID = {103759},
}

%0 Journal Article
%A Becker, Ruben
%A Cenzato, Davide
%A Kim, Sung-Hwan
%A Kociumaka, Tomasz
%A Kodric, Bojana
%A Policriti, Alberto
%A Prezza, Nicola
%+ External Organizations
External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
External Organizations
External Organizations
%T On the Complexity of Computing the Co-lexicographic Width of a Regular
  Language : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-6B67-3
%R 10.1016/j.jcss.2026.103759
%7 2026-01-23
%D 2026
%J Journal of Computer and System Sciences
%V 158
%Z sequence number: 103759
%I Elsevier
%C Amsterdam
%@ false

“Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts,” Theory of Computing Systems, vol. 70, 2026.

@article{Duyster26,
TITLE = {Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts},
AUTHOR = {Duyster, Anouk and Kociumaka, Tomasz},
LANGUAGE = {eng},
ISSN = {1432-4350},
DOI = {10.1007/s00224-026-10266-x},
PUBLISHER = {Springer},
ADDRESS = {New York, NY},
YEAR = {2026},
DATE = {2026},
JOURNAL = {Theory of Computing Systems},
VOLUME = {70},
EID = {11},
}

%0 Journal Article
%A Duyster, Anouk 
%A Kociumaka, Tomasz 
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0012-AD83-5
%R 10.1007/s00224-026-10266-x
%7 2026-02-23
%D 2026
%J Theory of Computing Systems
%V 70
%Z sequence number: 11
%I Springer
%C New York, NY
%@ false

“Minimum s--t Cuts with Fewer Cut Queries,” in Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2026), Vancouver, Canada, 2026.

@inproceedings{JiangSODA26,
TITLE = {Minimum $s$--$t$ Cuts with Fewer Cut Queries},
AUTHOR = {Jiang, Yonggang and Nanongkai, Danupon and Sawettamalya, Pachara},
LANGUAGE = {eng},
ISBN = {978-1-61197-897-1},
DOI = {10.1137/1.9781611978971.12},
PUBLISHER = {SIAM},
YEAR = {2026},
DATE = {2026},
BOOKTITLE = {Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2026)},
PAGES = {258--296},
ADDRESS = {Vancouver, Canada},
}

%0 Conference Proceedings
%A Jiang, Yonggang
%A Nanongkai, Danupon
%A Sawettamalya, Pachara
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T Minimum s--t Cuts with Fewer Cut Queries : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0012-0683-1
%R 10.1137/1.9781611978971.12
%D 2026
%B Thirty-Seventh Annual ACM-SIAM Symposium on Disrete Algorithms
%Z date of event: 2026-01-11 - 2026-01-14
%C Vancouver, Canada
%B Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms 
%P 258 - 296
%I SIAM
%@ 978-1-61197-897-1

“Linear Growth Patterns and Growth Parameter Dynamics in Northern Pike (Esox lucius) Populations From Non-Flowing Water Bodies Across Their Natural Range,” Fisheries Management and Ecology, 2026.

@article{Lobyrev26,
TITLE = {Linear Growth Patterns and Growth Parameter Dynamics in Northern Pike ({E}sox lucius) Populations From Non-Flowing Water Bodies Across Their Natural Range},
AUTHOR = {Lobyrev, Feodor and Emeliyanenko, Pavel},
LANGUAGE = {eng},
DOI = {10.1111/fme.70055},
PUBLISHER = {Wiley},
YEAR = {2026},
JOURNAL = {Fisheries Management and Ecology},
}

%0 Journal Article
%A Lobyrev, Feodor
%A Emeliyanenko, Pavel
%+ External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Linear Growth Patterns and Growth Parameter Dynamics in Northern Pike (Esox lucius) Populations From Non-Flowing Water Bodies Across Their Natural Range : 
%G eng
%U http://hdl.handle.net/21.11116/0000-0012-9FFA-0
%R 10.1111/fme.70055
%7 2026-02-06
%D 2026
%8 06.02.2026
%J Fisheries Management and Ecology
%I Wiley