![](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 873
Volume 873, June 2021
- Cristina Bazgan, Pierre Cazals, Janka Chlebíková
:
Degree-anonymization using edge rotations. 1-15 - Yunlong Liu, Jie Chen, Jingui Huang
, Jianxin Wang:
On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering. 16-24 - Ioannis Lamprou, Russell Martin, Sven Schewe
, Ioannis Sigalas, Vassilis Zissimopoulos:
Maximum rooted connected expansion. 25-37 - Tesshu Hanaka, Yasuaki Kobayashi
, Taiga Sone:
A (probably) optimal algorithm for Bisection on bounded-treewidth graphs. 38-46 - Jingjing Ma, Daming Zhu, Haitao Jiang, Binhai Zhu:
On the solution bound of two-sided scaffold filling. 47-63 - Luyi Li, Xueliang Li:
Digraphs with proper connection number two. 64-75 - Di Yan
, Yu Yu, Hanlin Liu, Shuoyao Zhao, Jiang Zhang:
An improved algorithm for learning sparse parities in the presence of noise. 76-86 - Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Koji Watase:
Almost linear time algorithms for minsum k-sink problems on dynamic flow path networks. 87-113
![](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.