default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 646
Volume 646, September 2016
- Steven Kelk, Mareike Fischer
, Vincent Moulton, Taoyang Wu:
Reduction rules for the maximum parsimony distance on phylogenetic trees. 1-15 - Stefano Beretta, Mauro Castelli, Riccardo Dondi:
Parameterized tractability of the maximum-duo preservation string mapping problem. 16-25 - Guy Avni, Tami Tamir:
Cost-sharing scheduling games on restricted unrelated machines. 26-39 - Imed Kacem, Hans Kellerer:
Semi-online scheduling on a single machine with unexpected breakdown. 40-48 - Nhan Bao Ho:
Three-pile Sharing Nim and the quadratic time winning strategy. 49-60 - James Harland:
Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons). 61-85 - Christian Glaßer, Heinz Schmitz, Victor L. Selivanov:
Efficient algorithms for membership in boolean hierarchies of regular languages. 86-108
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-04 22:08 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:
