default search action

combined dblp search
author search
venue search
publication search

ask others

Theoretical Computer Science, Volume 485

> 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 485, May 2013

Contributions

- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/BjorklundO13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BjorklundO13
Johanna Björklund, Lars-Daniel Öhman:
Simulation relations for pattern matching in directed graphs. 1-15
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/Blanchet-SadriF13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Blanchet-SadriF13
Francine Blanchet-Sadri, Nathan Fox:
Abelian-primitive partial words. 16-37
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/DrosteK13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/DrosteK13
Manfred Droste, Werner Kuich:
Weighted finite automata over hemirings. 38-48
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/BeaulieuBD13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BeaulieuBD13
Gabriel Beaulieu, Kyle G. Burke, Éric Duchêne:
Impartial coloring games. 49-60
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/Feldmann13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Feldmann13
Andreas Emil Feldmann:
Fast balanced partitioning is hard even on grids and trees. 61-68
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/BroersmaGP13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BroersmaGP13
Hajo Broersma, Petr A. Golovach, Viresh Patel:
Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. 69-84
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/Kasprzik13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Kasprzik13
Anna Kasprzik:
Four one-shot learners for regular tree languages and their polynomial characterizability. 85-106

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.