default search action

combined dblp search
author search
venue search
publication search

ask others

Theoretical Computer Science, Volume 439

> Home > Journals > Theoretical Computer Science

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Volume 439, June 2012

Contributions

- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/JiangZZ12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/JiangZZ12
Haitao Jiang, Daming Zhu, Binhai Zhu:
A (1+ε)-approximation algorithm for sorting by short block-moves. 1-8
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/KaminskiMM12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/KaminskiMM12
Marcin Kaminski, Paul Medvedev, Martin Milanic:
Complexity of independent set reconfigurability problems. 9-15
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/KerivinLM12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/KerivinLM12
Hervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub:
On the complexity of the Eulerian closed walk with precedence path constraints problem. 16-29
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/MiklosT12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/MiklosT12
István Miklós, Eric Tannier:
Approximating the number of Double Cut-and-Join scenarios. 30-40
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/NikolopoulosPP12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/NikolopoulosPP12
Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
A fully dynamic algorithm for the recognition of P₄-sparse graphs. 41-57
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/Prodinger12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Prodinger12
Helmut Prodinger:
Approximate counting with m counters: A detailed analysis. 58-68
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/XinMZW12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/XinMZW12
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.