default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Discrete Algorithms, Volume 27
Volume 27, July 2014
- Maciej Liskiewicz
, Martin R. Schuster:
A new upper bound for the traveling salesman problem in cubic graphs. 1-20 - Sanguthevar Rajasekaran, Marius Nicolae:
An elegant algorithm for the construction of suffix arrays. 21-28 - Ron Y. Pinter, Meirav Zehavi:
Algorithms for topology-free and alignment network queries. 29-53 - Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora:
Parameterized approximability of maximizing the spread of influence in networks. 54-65
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-12-04 01:28 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:
