default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 120
Volume 120, April 2017
- Sandip Banerjee
, Bhargab B. Bhattacharya, Binay Bhattacharya, Arindam Biswas, Sandip Das, Ritankar Mandal, Sasanka Roy:
On representing a simple polygon perceivable to a blind person. 1-5 - Cheng He, Hao Lin:
Notes on a hierarchical scheduling problem on identical machines. 6-10 - Alberto Giudici, Pascal Halffmann, Stefan Ruzika, Clemens Thielen:
Approximation schemes for the parametric knapsack problem. 11-15 - Patrizio Angelini:
Monotone drawings of graphs with few directions. 16-22 - Kai Li, Daowen Qiu, Lvzhou Li, Shenggen Zheng, Zhenbang Rong:
Application of distributed semi-quantum computing model in phase estimation. 23-29 - Evgeny Sherkhonov, Maarten Marx:
Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons. 30-39 - Euiwoong Lee, Melanie Schmidt, John Wright:
Improved and simplified inapproximability for k-means. 40-43 - Davood Bakhshesh, Mohammad Farshi:
Angle-constrained spanners with angle at least π/3. 44-46
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 2025-01-24 17:12 CET 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:
