default search action
Theoretical Computer Science, Volume 562
Volume 562, January 2015
- Ching-Hao Liu, Sheung-Hung Poon
, Jin-Yong Lin:
Independent dominating set problem revisited. 1-22 - Yiannis Giannakopoulos
Competitive analysis of maintaining frequent items of a stream. 23-32 - Amihood Amir, Alberto Apostolico, Gad M. Landau, Ely Porat, Oren Sar Shalom:
A PTAS for the Square Tiling Problem. 33-45 - Hao Fu, Guo-Niu Han:
On t-extensions of the Hankel determinants of certain automatic sequences. 46-56 - Yang Wang, Man Ho Au
Optimistic fair exchange in the enhanced chosen-key model. 57-74 - Olivier Delmas, Frédéric Havet, Mickaël Montassier, Stéphane Pérennes:
Design of fault-tolerant on-board networks with variable switch sizes. 75-89 - Angelo Fanelli
The ring design game with fair cost allocation. 90-100 - Lucas de Oliveira, Cid C. de Souza
On the complexity of the traveling umpire problem. 101-111 - Xiaofeng Chen, Willy Susilo
Efficient algorithms for secure outsourcing of bilinear pairings. 112-121 - Tian-Ming Bu, Chen Yuan
Computing on binary strings. 122-128 - Maximilien Gadouleau, Søren Riis
Memoryless computation: New results, constructions, and extensions. 129-145 - Lantao You, Jianxi Fan, Yuejuan Han, Xiaohua Jia
One-to-one disjoint path covers on alternating group graphs. 146-164 - Hans L. Bodlaender
Exact algorithms for Kayles. 165-176 - Qiong Huang, Guomin Yang
Ambiguous optimistic fair exchange: Definition and constructions. 177-193 - Xiao Tan
Concurrent signature without random oracles. 194-212 - Chenchen Wu, Donglei Du
Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach. 213-226 - Alexander Gavruskin
Dynamic algorithms for monotonic interval scheduling problem. 227-242 - Jianxin Wei
Solution to a conjecture on words that are bad and 2-isometric. 243-251 - Pinar Heggernes, Pim van 't Hof
Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs. 252-269 - Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar
Voronoi game on graphs. 270-282 - Jørgen Bang-Jensen
Finding a subdivision of a digraph. 283-303 - Flavio D'Alessandro, Benedetto Intrigila:
On the commutative equivalence of bounded context-free and regular languages: The code case. 304-319 - Dekel Tsur
Succinct representation of labeled trees. 320-329 - Sergio Bermudo
Combinatorics for smaller kernels: The differential of a graph. 330-345 - Olivier Ruatta, Mark Sciabica, Ágnes Szántó:
Overdetermined Weierstrass iteration and the nearest consistent system. 346-364 - Shiva Kintali, Nishad Kothari
Approximation algorithms for digraph width parameters. 365-376 - Yasmina Seddik, Christophe Gonzales, Safia Kedad-Sidhoum:
Performance guarantees for a scheduling problem with common stepwise job payoffs. 377-394 - Xin Han, Yasushi Kawase
Randomized algorithms for online knapsack problems. 395-405 - Leonardo I. L. Oliveira, Valmir Carneiro Barbosa
The predecessor-existence problem for k-reversible processes. 406-418 - Gruia Calinescu
Bounding the payment of approximate truthful mechanisms. 419-435 - Mikael Gast, Mathias Hauptmann, Marek Karpinski:
Inapproximability of dominating set on power law graphs. 436-452 - Jean-Claude Bermond, Bi Li
Data gathering and personalized broadcasting in radio grids with interference. 453-475 - Flavio D'Alessandro, Benedetto Intrigila:
On the commutative equivalence of semi-linear sets of Nk. 476-495 - Jianer Chen, Jia-Hao Fan
Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees. 496-512 - Asaf Levin
The benefit of adaptivity in stochastic packing problems with probing. 513-523 - George B. Mertzios, Mordechai Shalom
Optimizing busy time on parallel machines. 524-541 - Yi-Chun Wang, Justie Su-tzu Juan
Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes. 542-556 - Yann Disser, Andreas Emil Feldmann
Improving the Hk-bound on the price of stability in undirected Shapley network design games. 557-564 - Limei Lin, Li Xu, Shuming Zhou:
Conditional diagnosability and strong diagnosability of Split-Star Networks under the PMC model. 565-580 - Jing Fan, Xiwen Lu, Peihai Liu
Integrated scheduling of production and delivery on a single machine with availability constraint. 581-589 - Maohua Jing
Postfix automata. 590-605 - Daniel Meister:
Using swaps and deletes to make strings match. 606-620 - Atalay Mert Ileri
A simple yet time-optimal and linear-space algorithm for shortest unique substring queries. 621-633 - Jean-François Couturier, Romain Letourneur, Mathieu Liedloff:
On the number of minimal dominating sets on some graph classes. 634-642 - Davide Bilò
Specializations and generalizations of the Stackelberg minimum spanning tree game. 643-657
- Tero Harju
A note on short palindromes in square-free words. 658-659
- Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono
Corrigendum to "On the approximability and hardness of minimum topic connected overlay and its special instances" [Theoret. Comput. Sci. 429(2012) 144-154]. 660-661
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-11-22 19:43 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: