![](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
Journal of Discrete Algorithms, Volume 19
Volume 19, March 2013
- Laurent Bulteau, Guillaume Fertin
, Irena Rusu:
Maximal strip recovery problem with gaps: Hardness and approximation algorithms. 1-22 - Wing-Kai Hon
, Tsung-Han Ku, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter
:
Compressed text indexing with wildcards. 23-29 - Takuro Fukunaga
:
Approximating minimum cost source location problems with local vertex-connectivity demands. 30-38 - Nedialko B. Dimitrov, C. Greg Plaxton:
Optimal cover time for a graph-based coupon collector process. 39-51
- Xiangzhi Wei, Ajay Joneja
:
An improved algorithm for the shortest descending path on a convex terrain. 52-56
![](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.