Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 634
Volume 634, June 2016
- Othon Michail
, Paul G. Spirakis:
Traveling salesman problems in temporal graphs. 1-23 - Jung-Heum Park:
Paired many-to-many disjoint path covers in restricted hypercube-like graphs. 24-34 - Leslie Ann Goldberg, Mark Jerrum:
The complexity of counting locally maximal satisfying assignments of Boolean CSPs. 35-46 - Wenbin Chen, Hao Lei, Ke Qi:
Lattice-based linearly homomorphic signatures in the standard model. 47-54 - Anup Bhattacharya, Ragesh Jaiswal, Nir Ailon:
Tight lower bound instances for k-means++ in two dimensions. 55-66 - Marios Mavronicolas, Burkhard Monien:
The complexity of equilibria for risk-modeling valuations. 67-96 - Cheng-Kuan Lin, Lili Zhang, Jianxi Fan, Dajin Wang:
Structure connectivity and substructure connectivity of hypercubes. 97-107 - Tsunehiko Kameda, Ichiro Suzuki, Masafumi Yamashita:
An alternative proof for the equivalence of ∞-searcher and 2-searcher. 108-119 - Payam Khanteimouri, Ali Mohades, Mohammad Ali Abam, Mohammad Reza Kazemi:
Efficiently approximating color-spanning balls. 120-126
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-05-31 18:38 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:
