![](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 719
Volume 719, April 2018
- Catherine S. Greenhill, Matteo Sfragara
:
The switch Markov chain for sampling irregular graphs and digraphs. 1-20 - Christian Schridde:
On the construction of graphs with a planar bipartite double cover from boolean formulas and its application to counting satisfying solutions. 21-45 - Alexander Golovnev, Alexander S. Kulikov
, Alexander V. Smal
, Suguru Tamaki:
Gate elimination: Circuit size lower bounds and #SAT upper bounds. 46-63 - Jørgen Bang-Jensen
, Stéphane Bessy, Frédéric Havet
, Anders Yeo
:
Out-degree reducing partitions of digraphs. 64-72 - Mikhail Barash, Alexander Okhotin
:
Linear-space recognition for grammars with contexts. 73-85 - Wen Chean Teh
, Adrian Atanasiu, Ghajendran Poovanandran
:
On strongly M-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices. 86-93
![](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.