Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 975
Volume 975, October 2023
- Wlodzimierz Drabent
:
A relaxed condition for avoiding the occur-check. 114107
- Steve Alpern:
The Faulty Satnav (GPS) Problem: Search for home in networks with unreliable directions. 114109
- Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru:
Corrigendum to "Complexity and approximability of the happy set problem" [Theor. Comput. Sci. 866 (2021) 123-144]. 114114
- Franz Brauße, Konstantin Korovin, Margarita V. Korovina, Norbert Th. Müller:
The ksmt calculus is a δ-complete decision procedure for non-linear constraints. 114125
- Bhaskar DasGupta, Elena Grigorescu, Tamalika Mukherjee:
On computing discretized Ricci curvatures of graphs: Local algorithms and (localized) fine-grained reductions. 114127 - Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu:
Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails. 114128 - Csilla Bujtás, Nima Ghanbari, Sandi Klavzar:
Computational complexity aspects of super domination. 114137 - John Burkardt, Marcus R. Garvie:
An integer linear programming approach to solving the Eternity Puzzle. 114138 - Tian Bai, Mingyu Xiao:
A parameterized algorithm for subset feedback vertex set in tournaments. 114139 - Yuqiao He, Guoliang Qiu, Chihao Zhang:
Approximability of the complementarily symmetric Holant problems on cubic graphs. 114140 - Hui Dong, Mengjie Lv, Weibei Fan, Guijuan Wang:
Reliability evaluation of half hypercube networks. 114142
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-07-02 20:31 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:
