default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 132
Volume 132, April 2018
- Adam Polak
:
Why is it hard to beat O(n2) for Longest Common Weakly Increasing Subsequence? 1-5 - Dekel Tsur:
Succinct data structures for nearest colored node in a tree. 6-10 - Kaveh Khoshkhah, Dirk Oliver Theis:
Fooling sets and the Spanning Tree polytope. 11-13 - Nicolas Gillis:
Multiplicative updates for polynomial root finding. 14-18 - Serge Haddad:
Memoryless determinacy of finite parity games: Another simple proof. 19-21 - Omrit Filtser:
Universal approximate simplification under the discrete Fréchet distance. 22-27 - Günther Eder, Martin Held:
Computing positively weighted straight skeletons of simple polygons based on a bisector arrangement. 28-32 - Lucas Boppre Niehues, Ricardo Felipe Custódio, Daniel Panario:
Fast modular reduction and squaring in GF(2m). 33-38 - Shir Fiszman, Gur Mosheiov:
Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection. 39-43 - Irena Rusu:
Sorting signed permutations by reversals using link-cut trees. 44-48 - Zhiren Sun, Sizhong Zhou:
A generalization of orthogonal factorizations in digraphs. 49-54 - Thiago Braga Marcilon, Rudini Menezes Sampaio:
The P3 infection time is W[1]-hard parameterized by the treewidth. 55-61
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-11-01 22:21 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:
