Stop the war!
Остановите войну!
for scientists:
default search action
Theoretical Computer Science, Volume 481
Volume 481, April 2013
- Gabriele Fici, Luca Q. Zamboni:
On the least number of palindromes contained in an infinite word. 1-8 - Chia Wei Lu, Chin Lung Lu, Richard C. T. Lee:
A new filtration method and a hybrid strategy for approximate string matching. 9-17 - Lily Chen, Xueliang Li, Huishu Lian:
Further hardness results on the rainbow vertex-connection number of graphs. 18-23 - Yuan Li, John O. Adeyeye, David Murrugarra, Boris Aguilar, Reinhard C. Laubenbacher:
Boolean nested canalizing functions: A comprehensive analysis. 24-36 - Antoniy Ganchev, Lata Narayanan, Sunil M. Shende:
A tight characterization of strategic games with a unique equilibrium. 37-50 - Nick D. L. Owens, Andrew J. Greensted, Jon Timmis, Andy M. Tyrrell:
The Receptor Density Algorithm. 51-73 - Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Increasing the minimum degree of a graph by contractions. 74-84 - Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider:
Satisfiability of acyclic and almost acyclic CNF formulas. 85-99 - Athanasios Kehagias, Dieter Mitsche, Pawel Pralat:
Cops and invisible robbers: The cost of drunkenness. 100-120
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.