default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 917
Volume 917, May 2022
- Guozhen Rong, Yongjie Yang
, Wenjun Li, Jianxin Wang:
A divide-and-conquer approach for reconstruction of {C≥5}-free graphs via betweenness queries. 1-11 - Zonglei Bai, Yongzhi Cao, Hanpin Wang:
Zero-freeness and approximation of real Boolean Holant problems. 12-30 - Solène J. Esnay, Etienne Moutot:
Aperiodic SFTs on Baumslag-Solitar groups. 31-50 - Shengjun Xie, Haodi Feng, Haitao Jiang, Daming Zhu:
Approximation algorithms for sorting by bounded singleton moves. 51-65 - Magnus Bordewich, Charles Semple, Kristina Wicke:
On the complexity of optimising variants of phylogenetic diversity on phylogenetic networks. 66-80 - Md. Manzurul Hasan, Debajyoti Mondal, Md. Saidur Rahman:
Positive planar satisfiability problems under 3-connectivity constraints. 81-93 - Devin C. Jean, Suk Jai Seo:
Extremal cubic graphs for fault-tolerant locating domination. 94-106 - Guoyao Rao, Yongcai Wang, Wenping Chen, Deying Li, Weili Wu:
Union acceptable profit maximization in social networks. 107-121
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 2025-01-09 11:55 CET 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:
