Milos Chromý

According to our database, Milos Chromý authored at least 6 papers between 2014 and 2022.

Collaborative distances:

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

2022

On Solving the Minimum Common String Partition Problem by Decision Diagrams.

Milos Chromý, Markus Sinnl

Proceedings of the 11th International Conference on Operations Research and Enterprise Systems, 2022

2020

Properties of Switch-List Representations of Boolean Functions.

Milos Chromý, Ondrej Cepek

J. Artif. Intell. Res., 2020

Compiling SL representations of Boolean functions into OBDDs.

Milos Chromý, Ondrej Cepek

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2020

Switch-List Representations in a Knowledge Compilation Map.

Ondrej Cepek, Milos Chromý

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019

Phase Transition in Matched Formulas and a Heuristic for Biclique Satisfiability.

Milos Chromý, Petr Kucera

Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

2014

The Impact of a Bi-connected Graph Decomposition on Solving Cooperative Path-finding Problems.

Pavel Surynek, Petra Surynková, Milos Chromý

Fundam. Informaticae, 2014