![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Information Processing Letters, Volume 168
Volume 168, June 2021
- Masashi Kiyomi, Takashi Horiyama, Yota Otachi:
Longest common subsequence in sublinear space. 106084 - Verónica Becher
, Lucas Cortés:
Extending de Bruijn sequences to larger alphabets. 106085 - Filippo Brunelli, Pierluigi Crescenzi
, Laurent Viennot
:
On computing Pareto optimal paths in weighted time-dependent networks. 106086 - Olaf Beyersdorff, Joshua Blinkhorn:
A simple proof of QBF hardness. 106093 - Elena V. Konstantinova
, Alexey N. Medvedev
:
Small cycles, generalized prisms and Hamiltonian cycles in the Bubble-sort graph. 106094 - Dekel Tsur:
Faster parameterized algorithm for Bicluster Editing. 106095 - Robin Fritsch:
Online graph exploration on trees, unicyclic graphs and cactus graphs. 106096 - Hideo Bannai
, Shunsuke Inenaga, Neerja Mhaskar:
Longest previous overlapping factor array. 106097 - Xujin Chen, Xiaodong Hu, Zhongzheng Tang, Chenhao Wang
:
Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game. 106098
![](https://dblp.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.