default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 439
Volume 439, June 2012
- Haitao Jiang, Daming Zhu, Binhai Zhu:
A (1+ε)-approximation algorithm for sorting by short block-moves. 1-8 - Marcin Kaminski, Paul Medvedev, Martin Milanic
:
Complexity of independent set reconfigurability problems. 9-15 - Hervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub:
On the complexity of the Eulerian closed walk with precedence path constraints problem. 16-29 - István Miklós, Eric Tannier:
Approximating the number of Double Cut-and-Join scenarios. 30-40 - Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
A fully dynamic algorithm for the recognition of P4-sparse graphs. 41-57 - Helmut Prodinger:
Approximate counting with m counters: A detailed analysis. 58-68 - Qin Xin, Fredrik Manne, Yan Zhang, Xin Wang:
Almost optimal distributed M2M multicasting in wireless mesh networks. 69-82
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-12-11 20:33 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:
