default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 126
Volume 126, October 2017
- Moacir Ponti
, Mateus Riva:
An incremental linear-time learning algorithm for the Optimum-Path Forest classifier. 1-6 - Alfredo Rial:
Issuer-free oblivious transfer with access control revisited. 7-11 - Bostjan Bresar, Michael A. Henning:
The game total domination problem is log-complete in PSPACE. 12-17 - Klaus Broelemann, Xiaoyi Jiang, Sudipto Mukherjee, Ananda S. Chowdhury:
Variants of k-regular nearest neighbor graph and their construction. 18-23 - Michael Holzhauser, Sven O. Krumke, Clemens Thielen:
On the complexity and approximability of budget-constrained minimum cost flows. 24-29 - Michael Brand:
Small polyomino packing. 30-34 - Malik Magdon-Ismail:
NP-hardness and inapproximability of sparse PCA. 35-38 - Alan M. Frieze, Michael Anastos:
Randomly coloring simple hypergraphs with fewer colors. 39-42 - Michael Holzhauser, Sven O. Krumke:
An FPTAS for the parametric knapsack problem. 43-47
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-31 22:48 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:
