Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 852
Volume 852, January 2021
- Ker-I Ko, Lidong Wu:
On continuous one-way functions. 1-17 - Konstantinos Georgiou, George Karakostas, Evangelos Kranakis:
Treasure evacuation with one robot on a disk. 18-28 - Shouwei Li, Friedhelm Meyer auf der Heide, Pavel Podlipyan:
The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. 29-40 - Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan:
A continuous strategy for collisionless gathering. 41-60 - Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Time-energy tradeoffs for evacuation by two robots in the wireless model. 61-72 - Abbas Alhakim, Evan Sala, Joe Sawada:
Revisiting the Prefer-same and Prefer-opposite de Bruijn sequence constructions. 73-77 - Patrick Hagge Cording, Travis Gagie
, Mathias Bæk Tejs Knudsen, Tomasz Kociumaka:
Maximal unbordered factors of random strings. 78-83 - Huiping Chen, Grigorios Loukides, Solon P. Pissis, Hau Chan:
Influence maximization in the presence of vulnerable nodes: A ratio perspective. 84-103 - Guillaume Fertin, Julien Fradin, Géraldine Jean:
The Maximum Colorful Arborescence problem: How (computationally) hard can it be? 104-120 - Charles Desharnais, Sylvie Hamel:
Automedian sets of permutations: direct sum and shuffle. 121-131 - Amihood Amir, Eitan Kondratovsky:
Towards a real time algorithm for parameterized longest common prefix computation. 132-137 - Nicola Prezza, Giovanna Rosone:
Space-efficient construction of compressed suffix trees. 138-156 - Shmuel T. Klein, Jakub Radoszewski, Tamar C. Serebro, Dana Shapira:
Optimal skeleton and reduced Huffman trees. 157-171 - Christine Dahn, Nils M. Kriege, Petra Mutzel, Julian Schilling:
Fixed-parameter algorithms for the weighted Max-Cut problem on embedded 1-planar graphs. 172-184 - Arturo Carpi, Flavio D'Alessandro:
On bounded linear codes and the commutative equivalence. 185-196 - Barbara Covella, Fabrizio Frati, Maurizio Patrignani:
On the area requirements of planar straight-line orthogonal drawings of ternary trees. 197-211
a service of 
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.
last updated on 2024-07-30 21:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
