default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarika Ivanová
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j3]Marika Ivanová
, Dag Haugland, Bård Hennning Tvedt:
Strong bounds and exact solutions to the minimum broadcast time problem. Int. Trans. Oper. Res. 32(1): 314-352 (2025)- 2022
- [c9]Jirí Svancara, Marika Ivanová, Roman Barták:
Coordinated Collision-free Movement of Groups of Agents. ICAART (1) 2022: 26-33 - 2021
- [c8]Roman Barták, Marika Ivanová, Jirí Svancara:
Colored Multi-Agent Path Finding: Solving Approaches. FLAIRS 2021 - [c7]Marika Ivanová, Pavel Surynek:
Adversarial Multi-Agent Path Finding is Intractable. ICTAI 2021: 481-486 - [c6]Roman Barták, Marika Ivanová, Jirí Svancara:
From Classical to Colored Multi-Agent Path Finding. SOCS 2021: 150-152
2010 – 2019
- 2019
- [j2]Marika Ivanová, Dag Haugland:
Integer programming formulations for the shared multicast tree problem. J. Comb. Optim. 38(3): 927-956 (2019) - 2018
- [c5]Marika Ivanová, Pavel Surynek, Diep Thi Ngoc Nguyen:
Maintaining Ad-Hoc Communication Network in Area Protection Scenarios with Adversarial Agents. FLAIRS 2018: 348-353 - [c4]Marika Ivanová, Pavel Surynek, Katsutoshi Hirayama:
Area Protection in Adversarial Path-finding Scenarios with Multiple Mobile Agents on Graphs - A Theoretical and Experimental Study of Strategies for Defense Coordination. ICAART (1) 2018: 184-191 - 2017
- [i2]Marika Ivanová, Pavel Surynek:
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. CoRR abs/1708.07285 (2017) - [i1]Marika Ivanová, Pavel Surynek, Diep Thi Ngoc Nguyen:
Maintaining Ad-Hoc Communication Network in Area Protection Scenarios with Adversarial Agents. CoRR abs/1709.01070 (2017) - 2016
- [j1]Marika Ivanová:
The Shared Broadcast Tree Problem and MST. Electron. Notes Discret. Math. 55: 5-8 (2016) - [c3]Marika Ivanová:
Shared Multicast Trees in Ad Hoc Wireless Networks. ISCO 2016: 273-284 - 2014
- [c2]Marika Ivanová, Pavel Surynek:
Adversarial Cooperative Path-Finding: Complexity and Algorithms. ICTAI 2014: 75-82 - 2013
- [c1]Marika Ivanová, Pavel Surynek:
Adversarial Cooperative Path-Finding: A First View. AAAI (Late-Breaking Developments) 2013
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 23:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
