default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 937
Volume 937, November 2022
- Marcel Turkensteen, Gerold Jäger
:
Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems. 1-21 - Mathieu Gascon, Riccardo Dondi, Nadia El-Mabrouk:
MUL-tree pruning for consistency and optimal reconciliation - complexity and algorithms. 22-38 - Jingjing Tan, Fengmin Wang, Weina Ye, Xiaoqing Zhang, Yang Zhou:
Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice. 39-49 - Min Li, Hao Xiao, Qian Liu, Yang Zhou:
The submodularity of two-stage stochastic maximum-weight independent set problems. 50-62 - Shaojie Tang:
Stochastic submodular probing with state-dependent costs. 63-68 - Rongcheng Dong, Yuichi Sudo, Taisuke Izumi, Toshimitsu Masuzawa:
Loosely-stabilizing maximal independent set algorithms with unreliable communications. 69-84 - Xinya Ning, Nan Zhang, Zhenhua Duan, Cong Tian:
PPTL specification mining based on LNFG. 85-95 - Julien Bensmail:
On the hardness of determining the irregularity strength of graphs. 96-107
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 2026-07-17 23:53 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
