default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 167
Volume 167, April 2021
- Divesh Aggarwal, Eldon Chung
:
A note on the concrete hardness of the shortest independent vector in lattices. 106065 - Dekel Tsur:
Algorithms for deletion problems on split graphs. 106066 - D. Ellis Hershkowitz, Gregory Kehne, R. Ravi:
An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph. 106067 - Joost Engelfriet:
Computability by monadic second-order logic. 106074 - Vladica Andrejic, Alin Bostan, Milos Tatarevic:
Improved algorithms for left factorial residues. 106078 - Matthias Englert, Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Juliusz Straszynski:
A lower bound for the coverability problem in acyclic pushdown VAS. 106079 - Adam S. Jobson, André E. Kézdy, Jeno Lehel:
Minimal 2-connected graphs satisfying the even cut condition. 106080 - Jeffrey O. Shallit:
Robbins and Ardila meet Berstel. 106081 - Dekel Tsur:
Kernel for Kt-free Edge Deletion. 106082
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-09 19: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:
