default search action
Theoretical Computer Science, Volume 871
Volume 871, June 2021
- Nicolas Fröhlich, Stefan Ruzika:
On the hardness of covering-interdiction problems. 1-15 - Priyanka Dutta, Willy Susilo, Dung Hoang Duong, Partha Sarathi Roy:
Collusion-resistant identity-based Proxy Re-encryption: Lattice-based constructions in Standard Model. 16-29 - Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang:
Approximate ridesharing of personal vehicles problem. 30-50 - Huaqiang Zhang, Xin Zhang:
Theoretical aspects of equitable partition of networks into sparse modules. 51-61 - Georgios Amanatidis, Peter Fulla, Evangelos Markakis, Krzysztof Sornat:
Inequity aversion pricing over social networks: Approximation algorithms and hardness results. 62-78 - Chuang-Chieh Lin, Chi-Jen Lu, Po-An Chen:
How good is a two-party election game? 79-93 - Vinod Kumar, Krishnendra Shekhawat:
A transformation algorithm to construct a rectangular floorplan. 94-106 - Paolo Ferragina, Fabrizio Lillo, Giorgio Vinciguerra:
On the performance of learned data structures. 107-120 - Yuxing Yang:
Embedded connectivity of ternary n-cubes. 121-125 - Xin Wang, Suogang Gao, Bo Hou, Lidong Wu, Wen Liu:
Approximation algorithms for the submodular edge cover problem with submodular penalties. 126-133 - Ömer Egecioglu, Elif Saygi, Zülfükar Saygi:
The number of short cycles in Fibonacci cubes. 134-146
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.