Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 838
Volume 838, October 2020
- Xinfeng Shu, Nan Zhang, Xiaobing Wang, Liang Zhao:
Efficient decision procedure for propositional projection temporal logic. 1-16 - Hung Le
, Baigong Zheng:
Local search is a PTAS for feedback vertex set in minor-free graphs. 17-24 - Liang Zhao, Xiaobing Wang, Xinfeng Shu, Nan Zhang:
A sound and complete proof system for a unified temporal logic. 25-44 - Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa:
Diameter of colorings under Kempe changes. 45-57 - Yicheng Xu, Dachuan Xu, Yong Zhang, Juan Zou:
MpUFLP: Universal facility location problem in the p-th power of metric space. 58-67 - Krishnamoorthy Dinesh, Jayalal Sarma:
Sensitivity, affine transforms and quantum communication complexity. 68-80 - Kai Jin:
On 1-factorizations of bipartite Kneser graphs. 81-93 - Ivan Bliznets, Danil Sagunov:
Lower bounds for the happy coloring problems. 94-110 - Ruidong Yan, Hongwei Du, Yi Li, Wenping Chen, Yongcai Wang, Yuqing Zhu, Deying Li:
Target users' activation probability maximization with different seed set constraints in social networks. 111-125 - Girish Raguvir J, Manas Jyoti Kashyop, N. S. Narayanaswamy:
Dynamic data structures for interval coloring. 126-142 - Xiaoming Sun, Yuan Sun, Zhiyu Xia, Jialin Zhang:
The one-round multi-player discrete Voronoi game on grids and trees. 143-159 - Pengcheng Liu, Zhao Zhang, Xiaohui Huang:
Approximation algorithm for minimum weight connected-k-subgraph cover. 160-167 - Fernanda Couto, Luís Felipe I. Cunha:
Hardness and efficiency on minimizing maximum distances in spanning trees. 168-179 - Xujin Chen, Xiaodong Hu, Chenhao Wang, Xiaoying Wu:
The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler. 180-194 - Xiangyu Gao, Jianzhong Li, Dongjing Miao, Xianmin Liu:
Recognizing the tractability in big data computing. 195-207 - Mirza Galib Anwarul Husain Baig, Deepanjan Kesh:
Improved bounds for two query adaptive bitprobe schemes storing five elements. 208-230 - Guichen Gao, Li Ning, Hing-Fung Ting, Yicheng Xu, Yong Zhang, Yifei Zou:
Approximation algorithms for the partial assignment problem. 231-237 - Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima:
Exact algorithms for the repetition-bounded longest common subsequence problem. 238-249
a service of 
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-04-19 20:15 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:
