Lecture Notes in Computer Science - Computing and Combinatorics
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783319426334, 9783319426341

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Extending MSVL with Semaphore

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-42634-1_48 ◽

2016 ◽

pp. 599-610 ◽

Cited By ~ 4

Author(s):

Xinfeng Shu ◽

Zhenhua Duan

Combiners for Chosen-Ciphertext Security

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-42634-1_21 ◽

2016 ◽

pp. 257-268 ◽

Cited By ~ 2

Author(s):

Cong Zhang ◽

David Cash ◽

Xiuhua Wang ◽

Xiaoqi Yu ◽

Sherman S. M. Chow

Keyword(s):

Chosen Ciphertext Security

Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-42634-1_18 ◽

2016 ◽

pp. 222-234 ◽

Cited By ~ 5

Author(s):

Li-Hsuan Chen ◽

Dun-Wei Cheng ◽

Sun-Yuan Hsieh ◽

Ling-Ju Hung ◽

Chia-Wei Lee ◽

...

Keyword(s):

Approximation Algorithms ◽

Center Problem ◽

Metric Graphs

Flow Shop for Dual CPUs in Dynamic Voltage Scaling

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-42634-1_42 ◽

2016 ◽

pp. 520-531

Author(s):

Vincent Chau ◽

Ken C. K. Fong ◽

Minming Li ◽

Kai Wang

Keyword(s):

Flow Shop ◽

Voltage Scaling ◽

Dynamic Voltage Scaling ◽

Dynamic Voltage

Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-42634-1_5 ◽

2016 ◽

pp. 55-66

Author(s):

Bireswar Das ◽

Murali Krishna Enduri ◽

I. Vinod Reddy

Keyword(s):

Polynomial Time ◽

Polynomial Time Algorithm ◽

Time Algorithm

Minimum Width Color Spanning Annulus

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-42634-1_35 ◽

2016 ◽

pp. 431-442 ◽

Cited By ~ 1

Author(s):

Ankush Acharyya ◽

Subhas C. Nandy ◽

Sasanka Roy

Keyword(s):

Minimum Width

Automorphisms of the Cube $$n^d$$

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-42634-1_33 ◽

2016 ◽

pp. 405-416

Author(s):

Pavel Dvořák ◽

Tomáš Valla

On the Hardness of Switching to a Small Number of Edges

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-42634-1_13 ◽

2016 ◽

pp. 159-170 ◽

Cited By ~ 1

Author(s):

Vít Jelínek ◽

Eva Jelínková ◽

Jan Kratochvíl

Combinatorial Scoring of Phylogenetic Networks

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-42634-1_45 ◽

2016 ◽

pp. 560-572 ◽

Cited By ~ 1

Author(s):

Nikita Alexeev ◽

Max A. Alekseyev

Keyword(s):

Phylogenetic Networks

From Graph Orientation to the Unweighted Maximum Cut

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-42634-1_30 ◽

2016 ◽

pp. 370-384

Author(s):

Walid Ben-Ameur ◽

Antoine Glorieux ◽

José Neto

Keyword(s):

Graph Orientation ◽

Maximum Cut

Lecture Notes in Computer Science - Computing and CombinatoricsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Extending MSVL with Semaphore

Combiners for Chosen-Ciphertext Security

Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs

Flow Shop for Dual CPUs in Dynamic Voltage Scaling

Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three

Minimum Width Color Spanning Annulus

Automorphisms of the Cube $$n^d$$

On the Hardness of Switching to a Small Number of Edges

Combinatorial Scoring of Phylogenetic Networks

From Graph Orientation to the Unweighted Maximum Cut

Lecture Notes in Computer Science - Computing and Combinatorics
Latest Publications