Lecture Notes in Computer Science - Combinatorial Algorithms
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783319946665, 9783319946672

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

LZ-ABT: A Practical Algorithm for $$\alpha $$-Balanced Grammar Compression

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-319-94667-2_27 ◽

2018 ◽

pp. 323-335

Author(s):

Tatsuya Ohno ◽

Keisuke Goto ◽

Yoshimasa Takabatake ◽

Tomohiro I ◽

Hiroshi Sakamoto

Keyword(s):

Practical Algorithm

Download Full-text

An Efficient Representation of Partitions of Integers

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-319-94667-2_30 ◽

2018 ◽

pp. 361-373

Author(s):

Kentaro Sumigawa ◽

Kunihiko Sadakane

Keyword(s):

Efficient Representation ◽

Partitions Of Integers

Download Full-text

An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-319-94667-2_18 ◽

2018 ◽

pp. 214-223

Author(s):

Christine Markarian

Keyword(s):

Optimal Algorithm ◽

Steiner Forest ◽

Prize Collecting

Download Full-text

Cryptographic Limitations on Polynomial-Time a Posteriori Query Learning

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-319-94667-2_24 ◽

2018 ◽

pp. 285-297

Author(s):

Mikito Nanashima

Keyword(s):

Polynomial Time ◽

A Posteriori ◽

Query Learning

Download Full-text

On the Parameterized Complexity of Colorful Components and Related Problems

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-319-94667-2_20 ◽

2018 ◽

pp. 237-249 ◽

Cited By ~ 1

Author(s):

Neeldhara Misra

Keyword(s):

Parameterized Complexity

Download Full-text

Separating Interaction Effects Using Locating and Detecting Arrays

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-319-94667-2_29 ◽

2018 ◽

pp. 349-360 ◽

Cited By ~ 5

Author(s):

Stephen A. Seidel ◽

Kaushik Sarkar ◽

Charles J. Colbourn ◽

Violet R. Syrotiuk

Keyword(s):

Interaction Effects ◽

Detecting Arrays

Download Full-text

A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-319-94667-2_12 ◽

2018 ◽

pp. 141-152 ◽

Cited By ~ 1

Author(s):

Christine Dahn ◽

Nils M. Kriege ◽

Petra Mutzel

Keyword(s):

Planar Graphs ◽

Fixed Parameter ◽

Max Cut Problem ◽

Fixed Parameter Algorithm

Download Full-text

Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract)

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-319-94667-2_4 ◽

2018 ◽

pp. 39-51 ◽

Cited By ~ 1

Author(s):

Pierluigi Baiocchi ◽

Tiziana Calamoneri ◽

Angelo Monti ◽

Rossella Petreschi

Keyword(s):

Proof Technique

Download Full-text

Minimum Polygons for Fixed Visibility VC-Dimension

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-319-94667-2_6 ◽

2018 ◽

pp. 65-77

Author(s):

Moritz Beck ◽

Sabine Storandt

Keyword(s):

Vc Dimension

Download Full-text

Evaluation of Tie-Breaking and Parameter Ordering for the IPO Family of Algorithms Used in Covering Array Generation

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-319-94667-2_16 ◽

2018 ◽

pp. 189-200 ◽

Cited By ~ 1

Author(s):

Kristoffer Kleine ◽

Ilias Kotsireas ◽

Dimitris E. Simos

Keyword(s):

Covering Array ◽

Array Generation

Download Full-text

Lecture Notes in Computer Science - Combinatorial AlgorithmsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

LZ-ABT: A Practical Algorithm for $$\alpha $$-Balanced Grammar Compression

An Efficient Representation of Partitions of Integers

An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest

Cryptographic Limitations on Polynomial-Time a Posteriori Query Learning

On the Parameterized Complexity of Colorful Components and Related Problems

Separating Interaction Effects Using Locating and Detecting Arrays

A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs

Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract)

Minimum Polygons for Fixed Visibility VC-Dimension

Evaluation of Tie-Breaking and Parameter Ordering for the IPO Family of Algorithms Used in Covering Array Generation

Lecture Notes in Computer Science - Combinatorial Algorithms
Latest Publications