![](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 470
Volume 470, January 2013
- Geir Agnarsson, Magnús M. Halldórsson
, Elena Losievskaja:
SDP-based algorithms for maximum independent set problems on hypergraphs. 1-9 - Tatsuya Akutsu
, Daiji Fukagawa, Magnús M. Halldórsson
, Atsuhiro Takasu, Keisuke Tanaka
:
Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees. 10-22 - Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng, Mordecai J. Golin
:
Paging mobile users in cellular networks: Optimality versus complexity and simplicity. 23-35 - Janusz A. Brzozowski, Galina Jirásková
, Baiyu Li:
Quotient complexity of ideal languages. 36-52 - Zhigang Cao
, Xiaoguang Yang:
Complementary cooperation, minimal winning coalitions, and power indices. 53-92 - Sze-Hang Chan, Tak Wah Lam
, Lap-Kei Lee
:
Scheduling for weighted flow time and energy with rejection penalty. 93-104 - Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang:
Parameterized top-K algorithms. 105-119
![](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.