default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 616
Volume 616, February 2016
- Frank Gurski
, Egon Wanke, Eda Yilmaz:
Directed NLC-width. 1-17 - Joost Engelfriet, Sebastian Maneth, Helmut Seidl:
Look-ahead removal for total deterministic top-down tree transducers. 18-58 - Sergey V. Avgustinovich, Sergey Kitaev, Vladimir N. Potapov, Vincent Vajnovszki:
Gray coding cubic planar maps. 59-69 - Prosenjit Bose, Jean-Lou De Carufel, Pat Morin, André van Renssen, Sander Verdonschot:
Towards tight bounds on theta-graphs: More is not always better. 70-93 - Dakui Jiang, Jiayin Tan:
Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines. 94-99 - Xiao-Tao Lü, Jin Chen, Yingjun Guo, Zhi-Xiong Wen:
On the permutation complexity of the Cantor-like sequences. 100-110 - Palash Dey, Neeldhara Misra, Y. Narahari:
Kernelization complexity of possible winner and coalitional manipulation problems in voting. 111-125 - Nikolett Bereczky, Amalia Duch, Krisztián Németh, Salvador Roura:
Quad-kd trees: A general framework for kd trees and quad trees. 126-140 - Artur Jez:
A really simple approximation of smallest grammar. 141-150
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-12-23 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:
