default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Computer and System Sciences, Volume 84
Volume 84, March 2017
- Michael Etscheid, Stefan Kratsch, Matthias Mnich
, Heiko Röglin:
Polynomial kernels for weighted problems. 1-10 - Joel D. Day, Daniel Reidenbach, Markus L. Schmid:
Closure properties of pattern languages. 11-31 - Ali Çivril:
Sparse approximation is provably hard under coherent dictionaries. 32-43 - Ching-Lueh Chang:
A lower bound for metric 1-median selection. 44-51 - Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini:
Strong partial clones and the time complexity of SAT problems. 52-78 - Leah Epstein, Asaf Levin:
An AFPTAS for variable sized bin packing with general activation costs. 79-96 - Mingyu Xiao:
On a generalization of Nemhauser and Trotter's local optimization theorem. 97-106 - Gregory Z. Gutin, Mark Jones, Bin Sheng:
Parameterized complexity of the k-arc Chinese Postman Problem. 107-119 - Fahad Panolan, Geevarghese Philip, Saket Saurabh:
On the parameterized complexity of b-chromatic number. 120-131 - Dmitry V. Zakablukov:
On asymptotic gate complexity and depth of reversible circuits without additional memory. 132-143 - Tomás Brázdil, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera:
Trading performance for stability in Markov decision processes. 144-170 - Guy Feigenblat, Ely Porat, Ariel Shiftan:
d-k-min-wise independent family of hash functions. 171-184 - Daniel Bundala, Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp, Jakub Závodný:
Optimal-depth sorting networks. 185-204 - Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter:
Fast algorithms for Abelian periods in words and greatest common divisor queries. 205-218 - Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar:
Kernelization using structural parameters on sparse graph classes. 219-242 - Sven Schewe:
Solving parity games in big steps. 243-262 - Lila Kari, Steffen Kopecki:
Deciding whether a regular language is generated by a splicing system. 263-287 - Julien Cassaigne, Nicolas Ollinger, Rodrigo Torres-Avilés:
A small minimal aperiodic reversible Turing machine. 288-301
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-16 23:37 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:
