![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Information Processing Letters, Volume 185
Volume 185, March 2024
- Konstantinos Panagiotou, Simon Reisser:
The effect of iterativity on adversarial opinion forming. 106453 - Mislav Blazevic, Stefan Canzar
, Khaled Elbassioni, Domagoj Matijevic
:
Anti Tai mapping for unordered labeled trees. 106454 - Debasish Pattanayak
, Andrzej Pelc:
Deterministic treasure hunt and rendezvous in arbitrary connected graphs. 106455 - B. S. Panda
, Soumyashree Rana, Sounaka Mishra:
On the complexity of co-secure dominating set problem. 106463 - Nikolas Klug:
Computing minimal solutions to the ring loading problem. 106466 - Vugar E. Ismailov:
Approximation error of single hidden layer neural networks with fixed weights. 106467 - Daniele Dell'Erba, Sven Schewe
, Qiyi Tang
, Tansholpan Zhanabekova:
Semantic flowers for good-for-games and deterministic automata. 106468 - Caroline Brosse, Oscar Defrain
, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa:
On the hardness of inclusion-wise minimal separators enumeration. 106469 - Qi Wei
, Xiaolin Yao, Wenxin Zhang, Ruiyue Zhang, Yonggong Ren:
On-line exploration of rectangular cellular environments with a rectangular hole. 106470 - Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar
, Tomohiro Koana:
FPT approximation and subexponential algorithms for covering few or many edges. 106471
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.