![](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 784
Volume 784, September 2019
- Marco Budinich
:
The Boolean SATisfiability Problem in Clifford algebra. 1-10 - Patrizio Angelini
, Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani
:
On 3D visibility representations of graphs with few crossings per edge. 11-20 - Aixia Liu, Shiying Wang, Jun Yuan
, Xue Ma:
The h-extra connectivity of k-ary n-cubes. 21-45 - T.-H. Hubert Chan, Zhihao Gavin Tang
, Xiaowei Wu
, Chenzi Zhang:
Diffusion operator and spectral analysis for directed hypergraph Laplacian. 46-64 - Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang
:
A two-stages tree-searching algorithm for finding three completely independent spanning trees. 65-74 - Paul Balister
, Stefanie Gerke:
The asymptotic number of prefix normal words. 75-80 - Lukasz Merta:
Composition inverses of the variations of the Baum-Sweet sequence. 81-98 - Mouhammad Said, Jacques-Olivier Lachaud:
Analytical description of digital intersections: Minimal parameters and multiscale representation. 99-112 - Bogumil Kaminski
, Tomasz Olczak, Pawel Pralat:
Parallel execution of schedules with random dependency graph. 113-132 - Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira:
Approximability of covering cells with line segments. 133-141
![](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.