2 papers
cs.DS2021
On Solving the Minimum Common String Partition Problem by Decision Diagrams
Miloš Chromý, Markus Sinnl
In the Minimum Common String Partition Problem (MCSP), we are given two strings on input, and we want to partition both into the same collection of substrings, minimizing the numbe…
cs.DS2018
Phase Transition in Matched Formulas and a Heuristic for Biclique Satisfiability
Miloš Chromý, Petr Kučera
A matched formula is a CNF formula whose incidence graph admits a matching which matches a distinct variable to every clause. We study phase transition in a context of matched form…