


Остановите войну!
for scientists:


default search action
Information Processing Letters, Volume 175
Volume 175, April 2022
- Sang Won Bae:
Faster counting empty convex polygons in a planar point set. 106221 - Axel Dahlberg
, Jonas Helsen, Stephanie Wehner:
The complexity of the vertex-minor problem. 106222 - Adrian Atanasiu, Ghajendran Poovanandran
, Abdalhadi Abu Zeyneh, Wen Chean Teh
:
Erasure and error correcting ability of Parikh matrices. 106223 - Xiaomin Huang, Chenhao Wang
:
Discrete load balancing on complete bipartite graphs. 106224 - Haoxuan Wu, Jincheng Zhuang, Qianheng Duan, Yuqing Zhu:
Non-uniform birthday problem revisited: Refined analysis and applications to discrete logarithms. 106225 - Vorapong Suppakitpaisarn:
Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools. 106226 - Jose Luis Álvarez-Rebollar, Jorge Cravioto-Lagos, Nestaly Marín
, Erick Solís-Villarreal, Jorge Urrutia
:
Representing point sets on the plane as permutations. 106228 - Hendrik Molter
:
The complexity of finding temporal separators under waiting time constraints. 106229 - Therese Biedl
:
Horton-Strahler number, rooted pathwidth and upward drawings of trees. 106230 - Béatrice Bérard
, Serge Haddad:
Corrigendum to "Revisiting reachability in polynomial interrupt timed automata" [Information Processing Letters 174 (2022) 106208]. 106231

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.