![](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 516
Volume 516, January 2014
- Gianlorenzo D'Angelo
, Mattia D'Emidio
, Daniele Frigioni
:
A loop-free shortest-path routing algorithm for dynamic networks. 1-19 - Éric Duchêne, Gabriel Renault:
Vertex Nim played on graphs. 20-27 - Dyi-Rong Duh, Tzu-Lung Chen, Yue-Li Wang:
(n-3)-edge-fault-tolerant weak-pancyclicity of (n, k)-star graphs. 28-39 - Alberto Dennunzio, Enrico Formenti
, Michael Weiss:
Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues. 40-59 - Mikael Gast, Mathias Hauptmann:
Approximability of the vertex cover problem in power-law graphs. 60-70 - F. Abbes, M. Hbaib, M. Merkhi:
β-expansion and transcendence in Fq((x-1)). 71-77 - T. Karthick:
On atomic structure of P5-free subclasses and Maximum Weight Independent Set problem. 78-85 - Lukasz Kowalik
, Marcin Mucha
:
A 9k kernel for nonseparating independent set in planar graphs. 86-95 - Frédéric Maffray:
Fast recognition of doubled graphs. 96-100 - Alexander Okhotin
:
Parsing by matrix multiplication generalized to Boolean grammars. 101-120
- Asaf Levin
, Aleksander Vainer:
Adaptivity in the stochastic blackjack knapsack problem. 121-126 - Alexander Meduna
, Petr Zemek:
One-sided random context grammars with a limited number of right random context rules. 127-132 - Wei-Ping Ni, Jian-Liang Wu:
Edge coloring of planar graphs which any two short cycles are adjacent at most once. 133-138
![](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.