default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 166
Volume 166, February 2021
- Konstantinos Mastakas:
Drawing a rooted tree as a rooted y-monotone minimum spanning tree. 106035 - Jing Li, Xujing Li, Eddie Cheng:
Super spanning connectivity of split-star networks. 106037 - Debsoumya Chakraborti, Alan M. Frieze, Simi Haber
, Mihir Hasabnis:
Isomorphism for random k-uniform hypergraphs. 106039 - Iqra Altaf Gillani, Amitabha Bagchi:
A queueing network-based distributed Laplacian solver for directed graphs. 106040 - Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum:
An A⁎ search algorithm for the constrained longest common subsequence problem. 106041 - William E. Devanny, Michael T. Goodrich, Sandy Irani:
A competitive analysis for the Start-Gap algorithm for online memory wear leveling. 106042 - Jie Chen, Shou-Jun Xu:
A characterization of 3-γ-critical graphs which are not bicritical. 106062 - Mohammad Ali Abam, Mohammad Javad Rezaei Seraji:
Geodesic spanners for points in R3 amid axis-parallel boxes. 106063 - Benjamin Doerr:
Runtime analysis of evolutionary algorithms via symmetry arguments. 106064
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-11-08 20:34 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:
