default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 134
Volume 134, June 2018
- Ting Jiang, Xiao Jian Zhou:
Gradient/Hessian-enhanced least square support vector regression. 1-8 - Junqing Cai
, Hao Li, Yuzhong Zhang:
An implicit degree condition for k-connected 2-heavy graphs to be hamiltonian. 9-13 - Yanamandram B. Venkatakrishnan, Balakrishna Krishnakumari:
An improved upper bound of edge-vertex domination number of a tree. 14-17 - Alexandre Dolgui, Vladimir Kotov, Aliaksandr Nekrashevich, Alain Quilliot:
General parametric scheme for the online uniform machine scheduling problem with two different speeds. 18-23 - Hong Lai, Mingxing Luo, Josef Pieprzyk, Zhiguo Qu, Mehmet A. Orgun:
Efficient quantum key distribution using Fibonacci-number coding with a biased basis choice. 24-30 - Xiujun Zhang, Zepeng Li, Huiqin Jiang, Zehui Shao:
Double Roman domination in trees. 31-34 - Konrad K. Dabrowski, Daniël Paulusma:
On colouring (2P2, H)-free and (P5, H)-free graphs. 35-41 - Mingqiang An, Liming Xiong:
Some results on the inverse sum indeg index of a graph. 42-46 - Sándor Vágvölgyi:
Intersection of the reflexive transitive closures of two rewrite relations induced by term rewriting systems. 47-51 - Mei-Mei Gu, Rong-Xia Hao, Jian-Bing Liu:
The pessimistic diagnosability of data center networks. 52-56 - Miroslaw Kowaluk, Andrzej Lingas:
Are unique subgraphs not easier to find? 57-61 - Stefan Dziembowski, Tomasz Kazana, Maciej Zdanowicz:
Quasi chain rule for min-entropy. 62-66 - Yuzhuo Zhang, Xia Zhang:
On f-colorings of nearly bipartite graphs. 67-71 - Shangwei Lin, Ya'nan Jin, Chunfang Li:
Cartesian product digraphs with optimal restricted arc connectivity. 72-75
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-03 23:17 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:
