![](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
Theoretical Computer Science, Volume 863
Volume 863, April 2021
- Marc Demange, David Ellison, Bertrand Jouve:
Orienteering problem with time-windows and updating delay. 1-18 - GwangSu Ju, UnGwang Ko:
Research on a novel construction of probabilistic visual cryptography scheme (k, n, 0, 1, 1)-PVCS for threshold access structures. 19-39 - Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini
:
Ortho-polygon visibility representations of 3-connected 1-plane graphs. 40-52 - Takeshi Yamada, Ryuhei Uehara:
Shortest reconfiguration of sliding tokens on subclasses of interval graphs. 53-68 - Georgios Amanatidis
, Georgios Birmpas, Aris Filos-Ratsikas
, Alexandros Hollender
, Alexandros A. Voudouris
:
Maximum Nash welfare and other stories about EFX. 69-85 - Joey McCollum
, Thomas Krauss
:
QUBO formulations of the longest path problem. 86-101 - Susanne Albers, Leon Ladewig:
New results for the k-secretary problem. 102-119 - Marko Milosevic, Narad Rampersad:
Squarefree words with interior disposable factors. 120-126 - Keita Emura
, Jae Hong Seo, Yohei Watanabe:
Efficient revocable identity-based encryption with short public parameters. 127-155
![](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.