default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 565
Volume 565, February 2015
- Henning Fernau
, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh:
On the parameterized complexity of vertex cover and edge cover with connectivity constraints. 1-15 - Marc Hellmuth, Tilen Marc:
On the Cartesian skeleton and the factorization of the strong product of digraphs. 16-29 - Shyong Jian Shyu:
Visual cryptograms of random grids for threshold access structures. 30-49 - Nicholas Faulkner, Reem Yassawi:
A family of sand automata. 50-62 - Péter Györgyi, Tamás Kis:
Reductions between scheduling problems with non-renewable resources and knapsack problems. 63-76 - Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan:
Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms. 77-89 - Jean-Marc Fedou, Gabriele Fici:
Vertical representation of C∞-words. 90-101 - Adam Kasperski, Pawel Zielinski:
Combinatorial optimization problems with uncertain costs and the OWA criterion. 102-112
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-12-13 20: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:
