![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 833
Volume 833, September 2020
- Ran Gu, Yaping Mao
, Guoju Ye:
Note on matching preclusion number of random graphs. 1-10 - Hugo A. Akitaya, Maarten Löffler, Csaba D. Tóth:
Multi-colored spanning graphs. 11-25 - Feodor F. Dragan, Heather M. Guarnera
:
Eccentricity function in distance-hereditary graphs. 26-40 - Rong-Xia Hao, Mei-Mei Gu
, Jou-Ming Chang
:
Relationship between extra edge connectivity and component edge connectivity for regular graphs. 41-55 - Junichi Tomida
:
Tightly secure inner product functional encryption: Multi-input and function-hiding constructions. 56-86 - Ei Ando
, Shuji Kijima
:
An FPTAS for the volume of some V-polytopes - It is hard to compute the volume of the intersection of two cross-polytopes. 87-106 - Travis Gagie
, Meng He
, Gonzalo Navarro, Carlos Ochoa
:
Tree path majority data structures. 107-119 - Hayk A. Grigoryan, Samvel K. Shoukourian:
Polynomial algorithm for equivalence problem of deterministic multitape finite automata. 120-132 - Sang Won Bae:
Minimum-width double-strip and parallelogram annulus. 133-146 - Jonathan Jedwab
, Tara Petrie, Samuel Simon:
An infinite class of unsaturated rooted trees corresponding to designable RNA secondary structures. 147-163 - Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika:
Quadratic vertex kernel for split vertex deletion. 164-172
![](https://dblp.dagstuhl.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.