Theoretical Computer Science

ISSNs: 0304-3975

Elsevier BV, Netherlands

BFI (2017): BFI-level 2, Scopus rating (2016): CiteScore 0.97 SJR 0.569 SNIP 1.006, ISI indexed (2013): ISI indexed yes, Web of Science (2017): Indexed Yes

Central database

Journal

  1. 2017
  2. Accepted/In press

    Motif trie: An efficient text index for pattern discovery with don't cares. / Grossi, Roberto; Menconi, Giulia; Pisanti, Nadia; Trani, Roberto; Vind, Søren Juhl.

    In: Theoretical Computer Science, 2017.

    Publication: Research - peer-reviewJournal article – Annual report year: 2017

  3. 2016
  4. Published

    Longest common extensions in trees. / Bille, Philip; Gawrychowski, Pawel; Gørtz, Inge Li; Landau, Gad M.; Weimann, Oren.

    In: Theoretical Computer Science, Vol. 638, 2016, p. 98-107.

    Publication: Research - peer-reviewJournal article – Annual report year: 2016

  5. 2015
  6. Published

    Improved time complexity analysis of the Simple Genetic Algorithm. / Oliveto, Pietro S.; Witt, Carsten.

    In: Theoretical Computer Science, Vol. 605, 2015, p. 21-41.

    Publication: Research - peer-reviewJournal article – Annual report year: 2015

  7. Published

    Runtime analysis of ant colony optimization on dynamic shortest path problems. / Lissovoi, Andrei; Witt, Carsten.

    In: Theoretical Computer Science, Vol. 561, No. Part A, 2015, p. 73-85.

    Publication: Research - peer-reviewJournal article – Annual report year: 2015

  8. 2014
  9. Published

    Compact q-gram profiling of compressed strings. / Bille, Philip; Cording, Patrick Hagge; Gørtz, Inge Li.

    In: Theoretical Computer Science, Vol. 550, 2014, p. 51-58.

    Publication: Research - peer-reviewJournal article – Annual report year: 2014

  10. Published

    On the runtime analysis of the Simple Genetic Algorithm. / Oliveto, Pietro S.; Witt, Carsten.

    In: Theoretical Computer Science, Vol. 545, 2014, p. 2-19.

    Publication: Research - peer-reviewJournal article – Annual report year: 2014

  11. Published

    Towards optimal packed string matching. / Ben-Kiki, Oren; Bille, Philip; Breslauer, Dany; Ga̧sieniec, Leszek; Grossi, Roberto; Weimann, Oren.

    In: Theoretical Computer Science, Vol. 525, 2014, p. 111-129.

    Publication: Research - peer-reviewJournal article – Annual report year: 2014

  12. 2012
  13. Published

    Analysis of an iterated local search algorithm for vertex cover in sparse random graphs. / Witt, Carsten.

    In: Theoretical Computer Science, Vol. 425, 2012, p. 117-125.

    Publication: Research - peer-reviewJournal article – Annual report year: 2012

  14. Published

    String matching with variable length gaps. / Bille, Philip; Gørtz, Inge Li; Vildhøj, Hjalte Wedel; Wind, David Kofoed.

    In: Theoretical Computer Science, Vol. 443, 2012, p. 25-34.

    Publication: Research - peer-reviewJournal article – Annual report year: 2012

  15. 2011
  16. Published

    Runtime analysis of the 1-ANT ant colony optimizer. / Doerr, Benjamin; Neumann, Frank; Sudholt, Dirk; Witt, Carsten.

    In: Theoretical Computer Science, Vol. 412, No. 17, 2011, p. 1629-1644.

    Publication: Research - peer-reviewJournal article – Annual report year: 2011

Previous 1 2 3 Next
Download list:
Download as PDF
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
Word