default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical 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
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.
last updated on 2024-10-08 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
