default search action
Theoretical Computer Science, Volume 648
Volume 648, October 2016
- Bostjan Bresar, Paul Dorbec
, Sandi Klavzar
Complexity of the game domination problem. 1-7 - Paolo Boldi
Efficient optimally lazy algorithms for minimal-interval semantics. 8-25 - Van Bang Le, Andrea Oversberg, Oliver Schaudt:
A unified approach to recognize squares of split graphs. 26-33 - Tridib Dutta, Lenwood S. Heath, V. S. Anil Kumar
Labeled cuts in graphs. 34-39 - Meirav Zehavi
Parameterized approximation algorithms for packing problems. 40-55 - Carme Àlvarez, Maria J. Blesa, Amalia Duch, Arnau Messegué, Maria J. Serna
Celebrity games. 56-71 - Peng Zhang
The label cut problem with respect to path length and label frequency. 72-83 - Tomasz Kociumaka
Maximum number of distinct and nonequivalent nonstandard squares in a word. 84-95 - Diodato Ferraioli, Paul W. Goldberg
Decentralized dynamics for finite opinion games. 96-115 - Guy Feigenblat, Ofra Itzhaki, Ely Porat:
Corrigendum to "The frequent items problem, under polynomial decay, in the streaming model" [Theoret. Comput. Sci. 411(34-36) (2010) 3048-3054]. 116
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-01-13 00:52 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: