Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Discrete Algorithms, Volume 12
Volume 12, April 2012
- Iain A. Stewart
, Daniël Paulusma, Matthew Johnson:
Editorial. 1 - Paul S. Haynes, Lyuba Alboul, Jacques Penders:
Dynamic graph-based search in unknown environments. 2-13 - Paul S. Bonsma:
Max-leaves spanning tree is APX-hard for cubic graphs. 14-23 - Alexei Vernitski, Artem V. Pyatkin:
Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions. 24-28
- David Gamarnik, Dmitriy Katz:
Correlation decay and deterministic FPTAS for counting colorings of a graph. 29-47 - Martin Senft, Tomás Dvorák:
On-line suffix tree construction with reduced branching. 48-60 - Amihood Amir, Haim Parienty:
Towards a theory of patches. 61-73
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-04-25 04:44 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:
