default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 142
Volume 142, February 2019
- Nikolaj Tatti
:
Strongly polynomial efficient approximation scheme for segmentation. 1-8 - Shang-En Huang, Seth Pettie:
Thorup-Zwick emulators are universally optimal hopsets. 9-13 - A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty:
Bottleneck bichromatic full Steiner trees. 14-19 - Weibo Lin, Mingyu Xiao:
A (3 + ϵ)k-vertex kernel for edge-disjoint triangle packing. 20-26 - Khaled A. S. Abdel-Ghaffar:
Sets of binary sequences with small total Hamming distances. 27-29 - Andreas Brandstädt, Martin Milanic:
A dichotomy for weighted efficient dominating sets with bounded degree vertices. 30-34 - Lin Xiao, Kenli Li, Zhiguo Tan, Zhijun Zhang, Bolin Liao, Ke Chen, Long Jin, Shuai Li:
Nonlinear gradient neural network for solving system of linear equations. 35-40 - Guanqun Ni, Feifeng Zheng, Yinfeng Xu:
Competitive analysis of online revenue management with hierarchical resources. 41-45 - E. Zhang, Ming Liu, Feifeng Zheng, Yinfeng Xu:
Single machine lot scheduling to minimize the total weighted (discounted) completion time. 46-51 - Xuepeng Cai, Elkin Vumar:
The super connectivity of folded crossed cubes. 52-56 - Jung-Heum Park, Insung Ihm:
A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph. 57-63 - Michitaka Furuya, Naoki Matsumoto:
A note on domination 3-edge-critical planar graphs. 64-67 - Hans L. Bodlaender, Tom C. van der Zanden:
On exploring always-connected temporal graphs of small pathwidth. 68-71 - Shlomi Dolev, Anat Eyal, Danny Hendler, Philip Derbeko, Marina Sadetsky:
Upper bounds for multi-level multi-server paging. 72-76 - Alexey Milovanov:
#P-completeness of counting roots of a sparse polynomial. 77-79 - Huazhong Lü:
On the conjecture of vertex-transitivity of DCell. 80-83 - Eminjan Sabir, Jixiang Meng:
Parallel routing in regular networks with faults. 84-89 - Stasys Jukna, Hannes Seiwert:
Greedy can beat pure dynamic programming. 90-95
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-08-09 22:59 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.
