Digital Library
Close Browse articles from a journal
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             18 results found
no title author magazine year volume issue page(s) type
1 A 2-approximation algorithm and beyond for the minimum diameter k-Steiner forest problem Ding, Wei

840 C p. 1-15
article
2 A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function Nong, Qingqin

840 C p. 177-186
article
3 Algorithm and hardness results on neighborhood total domination in graphs Jha, Anupriya

840 C p. 16-32
article
4 A local characterization for perfect plane near-triangulations M. Salam, Sameera

840 C p. 45-58
article
5 Community-based rumor blocking maximization in social networks: Algorithms and analysis Ni, Qiufen

840 C p. 257-269
article
6 Complete bipartite graphs deleted in Ramsey graphs Li, Yan

840 C p. 212-218
article
7 Covering and packing of rectilinear subdivision Jana, Satyabrata

840 C p. 166-176
article
8 Editorial Board
840 C p. ii
article
9 Efficient scheduling of a mobile charger in large-scale sensor networks Ding, Xingjian

840 C p. 219-233
article
10 Improved learning of k-parities Bhattacharyya, Arnab

840 C p. 249-256
article
11 Limitations of current wireless link scheduling algorithms Halldórsson, Magnús M.

840 C p. 154-165
article
12 LTL to self-loop alternating automata with generic acceptance and back Blahoudek, František

840 C p. 122-142
article
13 Maximum reachability preserved graph cut Miao, Dongjing

840 C p. 187-198
article
14 On the semantic equivalence of language syntax formalisms Buro, Samuele

840 C p. 234-248
article
15 Radio aggregation scheduling Gandhi, Rajiv

840 C p. 143-153
article
16 The amortized analysis of a non-blocking chromatic tree Ko, Jeremy

840 C p. 59-121
article
17 The parameterized complexity and kernelization of resilience for database queries Miao, Dongjing

840 C p. 199-211
article
18 The sparsest additive spanner via multiple weighted BFS trees Censor-Hillel, Keren

840 C p. 33-44
article
                             18 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands