
This special issue contains five articles which are based on extended abstracts presented at the 35th Symposium on Theoretical Aspects of Computer Science (STACS). The conference was held at the Technical University of Berlin from March 13 to March 16, 2019. The extended abstracts were chosen among the top papers of those which were selected for presentation in a highly competitive peer-review process (after which only 54 papers out of 260 submissions were accepted, putting it among the most competitive conferences in Theoretical Computer Science).
distributed algorithms, 510 Mathematik, computer science, algorithmic graph theory, linear dynamical systems, automata theory, parameterized complexity analysis, ddc: ddc:510
distributed algorithms, 510 Mathematik, computer science, algorithmic graph theory, linear dynamical systems, automata theory, parameterized complexity analysis, ddc: ddc:510
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
