default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 485
Volume 485, May 2013
- Johanna Björklund
, Lars-Daniel Öhman:
Simulation relations for pattern matching in directed graphs. 1-15 - Francine Blanchet-Sadri, Nathan Fox:
Abelian-primitive partial words. 16-37 - Manfred Droste, Werner Kuich:
Weighted finite automata over hemirings. 38-48 - Gabriel Beaulieu, Kyle G. Burke, Éric Duchêne:
Impartial coloring games. 49-60 - Andreas Emil Feldmann:
Fast balanced partitioning is hard even on grids and trees. 61-68 - Hajo Broersma, Petr A. Golovach, Viresh Patel:
Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. 69-84 - 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.
last updated on 2025-12-05 22:23 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:
