default search action
Theoretical Computer Science, Volume 609
Volumes 609, Part 1, January 2016
- Leo van Iersel, Steven Kelk, Nela Lekic, Simone Linz
:
Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees. 1-21 - Bey-Chi Lin, Chin-Tau Lea
Repackable multi-Log2N networks. 22-31 - Jian Li
Range queries on uncertain data. 32-48 - Willy Susilo
Efficient dynamic threshold identity-based encryption with constant-size ciphertext. 49-59 - Joe Sawada, Aaron Williams
Successor rules for flipping pancakes and burnt pancakes. 60-75 - Ken C. K. Fong, Minming Li
Average-case complexity of the min-sum matrix product problem. 76-86 - Jessica A. Enright
Games on interval and permutation graph representations. 87-103 - Jan Kratochvíl
Computational complexity of covering three-vertex multigraphs. 104-117 - Eric Goles, Pedro Montealegre
PSPACE-completeness of majority automata networks. 118-128 - Richard Beal, Donald A. Adjeroh:
Compressed parameterized pattern matching. 129-142 - Ching-Nung Yang
Extended color visual cryptography for black and white secret image. 143-161 - Cunquan Qu, Guanghui Wang, Jian-Liang Wu, Xiaowei Yu:
On the neighbor sum distinguishing total coloring of planar graphs. 162-170 - Shantanu Das
Autonomous mobile robots with lights. 171-184 - Xin Han, Kazuhisa Makino:
Online minimization knapsack problem. 185-196 - Xi Wang, Jianxi Fan, Xiaohua Jia
An efficient algorithm to construct disjoint path covers of DCell networks. 197-210 - Takuya Akiba, Yoichi Iwata:
Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover. 211-225 - Marie-Pierre Béal, Michel Blockelet, Catalin Dima
Sofic-Dyck shifts. 226-244 - Tiphaine Viard
Computing maximal cliques in link streams. 245-252 - Linming Gong, Shundong Li, Qing Mao, Daoshun Wang, Jiawei Dou:
A homomorphic encryption scheme with adaptive chosen ciphertext security but without random oracle. 253-261 - Fei-Huang Chang, Ma-Lian Chia
All-to-all broadcast problems on Cartesian product graphs. 262-271 - Christopher Hanrui Chak, Rusins Freivalds, Frank Stephan
On block pumpable languages. 272-285
Volumes 609, Part 2, January 2016
- Fabrício Benevides
The maximum infection time in the geodesic and monophonic convexities. 287-295 - Kun-Tze Chen, Chi-Long Li, Hsien-Tai Chiu, Chin Lung Lu:
An efficient algorithm for one-sided block ordering problem under block-interchange distance. 296-305 - Thomas Bläsius
A new perspective on clustered planarity as a combinatorial embedding problem. 306-315 - Mordecai J. Golin
Encoding 2D range maximum queries. 316-327 - Dieter Kratsch, Van Bang Le:
Algorithms solving the Matching Cut problem. 328-335 - Ran Gu, Xueliang Li, Zhongmei Qin:
Proper connection number of random graphs. 336-343 - Jing Tian, Xianzhong Zhao
On structure and representations of cyclic automata. 344-360 - François Bonnet
Tight bound on mobile Byzantine Agreement. 361-373 - Ljiljana Brankovic
Linear-time superbubble identification algorithm for genome assembly. 374-383 - Sabina Zejnilovic
Extending the metric dimension to graphs with missing edges. 384-394 - Ming Xu
Analyzing ultimate positivity for solvable systems. 395-412 - Rong-Xia Hao, Mei-Mei Gu
The pessimistic diagnosabilities of some general regular graphs. 413-420 - Shuming Zhou, Sulin Song
On conditional fault tolerance and diagnosability of hierarchical cubic networks. 421-433 - Wenbin Chen, Nagiza F. Samatova, Matthias F. Stallmann
On size-constrained minimum s-t cut problems and size-constrained dense subgraph problems. 434-442 - Zhongzhi Zhang
The number and degree distribution of spanning trees in the Tower of Hanoi graph. 443-455 - James D. Currie
Growth rate of binary words avoiding xxxR. 456-468 - Emily Allen, Francine Blanchet-Sadri, Michelle Bodnar, Brian Bowers, Joe Hidakatsu, John Lensmire:
Combinatorics on partial word borders. 469-493 - Xie-Bin Chen:
Paired 2-disjoint path covers of faulty k-ary n-cubes. 494-499 - Qizhi Fang, Bo Li
Computing the least-core and nucleolus for threshold cardinality matching games. 500-510
- Luciano N. Grippo
Convex p-partitions of bipartite graphs. 511-514
Volumes 609, Part 3, January 2016
- Zhipeng Cai
Special issue on Computing and Combinatorics Conference. 515
- Suman Kalyan Bera, Syamantak Das, Amit Kumar
Minimizing average flow-time under knapsack constraint. 516-525 - Xujin Chen
Approximation for the minimum cost doubly resolving set problem. 526-543 - Zhenhua Duan, Cong Tian, Nan Zhang:
A canonical form based decision procedure and model checking approach for propositional projection temporal logic. 544-560 - Minghui Jiang, Haitao Wang:
Shortest color-spanning intervals. 561-568 - François Le Gall, Harumichi Nishimura
Quantum algorithms for finding constant-sized sub-hypergraphs. 569-582 - Xianmin Liu, Jianzhong Li, Hong Gao:
On the hardness of labeled correlation clustering problem: A parameterized complexity view. 583-593 - Dongjing Miao
On the complexity of sampling query feedback restricted database repair of functional dependency violations. 594-605 - Subhankar Mishra
Optimal packet scan against malicious attacks in smart grids. 606-619 - Weitian Tong
Smoothed heights of tries and patricia tries. 620-626 - Di Wu, Zhao Zhang, Weili Wu:
Approximation algorithm for the balanced 2-connected k-partition problem. 627-638 - Nan Zhang, Zhenhua Duan, Cong Tian:
A complete axiom system for propositional projection temporal logic with cylinder computation model. 639-657 - Peng Zhang
A new approximation algorithm for the unbalanced Min s-t Cut problem. 658-665
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-11-09 23:10 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: