Adversarial Cooperative Path-Finding: A First View. - Marika Ivanová; Pavel Surynek (AAAI (Late-Breaking Developments), 2013)

Adversarial Cooperative Path-Finding: Complexity and Algorithms. - Marika Ivanová; Pavel Surynek (ICTAI, 2014)

Shared Multicast Trees in Ad Hoc Wireless Networks. - Marika Ivanová (ISCO, 2016)

The Shared Broadcast Tree Problem and MST. - Marika Ivanová (Electron. Notes Discret. Math., 2016)

Area Protection in Adversarial Path-Finding Scenarios with Multiple Mobile Agents on Graphs: a theoretical and experimental study of target-allocation strategies for defense coordination. - Marika Ivanová; Pavel Surynek (CoRR, 2017)

Maintaining Ad-Hoc Communication Network in Area Protection Scenarios with Adversarial Agents. - Marika Ivanová; Pavel Surynek; Diep Thi Ngoc Nguyen (FLAIRS, 2018)

Area Protection in Adversarial Path-finding Scenarios with Multiple Mobile Agents on Graphs - A Theoretical and Experimental Study of Strategies for Defense Coordination. - Marika Ivanová; Pavel Surynek; Katsutoshi Hirayama (ICAART (1), 2018)

Integer programming formulations for the shared multicast tree problem. - Marika Ivanová; Dag Haugland (J. Comb. Optim., 2019)

Colored Multi-Agent Path Finding: Solving Approaches. - Roman Barták; Marika Ivanová; Jirí Svancara (FLAIRS, 2021)

Adversarial Multi-Agent Path Finding is Intractable. - Marika Ivanová; Pavel Surynek (ICTAI, 2021)

From Classical to Colored Multi-Agent Path Finding. - Roman Barták; Marika Ivanová; Jirí Svancara (SOCS, 2021)

Coordinated Collision-free Movement of Groups of Agents. - Jirí Svancara; Marika Ivanová; Roman Barták (ICAART (1), 2022)

Strong bounds and exact solutions to the minimum broadcast time problem. - Marika Ivanová; Dag Haugland; Bård Hennning Tvedt (Int. Trans. Oper. Res., 2025)