![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 566
Volume 566, February 2015
- Alexander Okhotin
, Kai Salomaa:
Descriptional complexity of unambiguous input-driven pushdown automata. 1-11 - Shiri Chechik, David Peleg:
The fault-tolerant capacitated K-center problem. 12-25 - Ondrej Turek:
Abelian properties of Parry words. 26-38 - Luisa Gargano
, Adele A. Rescigno
:
Complexity of conflict-free colorings of graphs. 39-49 - Wenwen Zhang, Jian-Liang Wu:
Some sufficient conditions for 1-planar graphs to be Class 1. 50-58 - Júlio Araújo
, Nathann Cohen, Susanna F. de Rezende
, Frédéric Havet, Phablo F. S. Moura
:
On the proper orientation number of bipartite graphs. 59-75
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.