Lecture Notes in Computer Science - Analysis of Experimental Algorithms
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783030340285, 9783030340292

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs

Lecture Notes in Computer Science - Analysis of Experimental Algorithms ◽

10.1007/978-3-030-34029-2_9 ◽

2019 ◽

pp. 125-141 ◽

Cited By ~ 1

Author(s):

Jun Kawahara ◽

Toshiki Saitoh ◽

Hirofumi Suzuki ◽

Ryo Yoshinaka

Keyword(s):

Implicit Enumeration

Download Full-text

On New Rebalancing Algorithm

Lecture Notes in Computer Science - Analysis of Experimental Algorithms ◽

10.1007/978-3-030-34029-2_8 ◽

2019 ◽

pp. 114-124

Author(s):

Koba Gelashvili ◽

Nikoloz Grdzelidze ◽

Mikheil Tutberidze

Download Full-text

Engineering a PTAS for Minimum Feedback Vertex Set in Planar Graphs

Lecture Notes in Computer Science - Analysis of Experimental Algorithms ◽

10.1007/978-3-030-34029-2_7 ◽

2019 ◽

pp. 98-113

Author(s):

Glencora Borradaile ◽

Hung Le ◽

Baigong Zheng

Keyword(s):

Planar Graphs ◽

Feedback Vertex Set ◽

Vertex Set ◽

Minimum Feedback Vertex Set

Download Full-text

Hacker’s Multiple-Precision Integer-Division Program in Close Scrutiny

Lecture Notes in Computer Science - Analysis of Experimental Algorithms ◽

10.1007/978-3-030-34029-2_25 ◽

2019 ◽

pp. 376-391

Author(s):

Jyrki Katajainen

Keyword(s):

Multiple Precision ◽

Integer Division

Download Full-text

Effective Heuristics for Matchings in Hypergraphs

Lecture Notes in Computer Science - Analysis of Experimental Algorithms ◽

10.1007/978-3-030-34029-2_17 ◽

2019 ◽

pp. 248-264

Author(s):

Fanny Dufossé ◽

Kamer Kaya ◽

Ioannis Panagiotas ◽

Bora Uçar

Download Full-text

Fixed Set Search Applied to the Minimum Weighted Vertex Cover Problem

Lecture Notes in Computer Science - Analysis of Experimental Algorithms ◽

10.1007/978-3-030-34029-2_31 ◽

2019 ◽

pp. 490-504 ◽

Cited By ~ 2

Author(s):

Raka Jovanovic ◽

Stefan Voß

Keyword(s):

Vertex Cover ◽

Vertex Cover Problem ◽

Fixed Set ◽

Weighted Vertex ◽

Cover Problem

Download Full-text

Assessing Algorithm Parameter Importance Using Global Sensitivity Analysis

Lecture Notes in Computer Science - Analysis of Experimental Algorithms ◽

10.1007/978-3-030-34029-2_26 ◽

2019 ◽

pp. 392-407

Author(s):

Alessio Greco ◽

Salvatore Danilo Riccio ◽

Jon Timmis ◽

Giuseppe Nicosia

Keyword(s):

Sensitivity Analysis ◽

Global Sensitivity Analysis ◽

Global Sensitivity

Download Full-text

Minimum and Maximum Category Constraints in the Orienteering Problem with Time Windows

Lecture Notes in Computer Science - Analysis of Experimental Algorithms ◽

10.1007/978-3-030-34029-2_23 ◽

2019 ◽

pp. 343-358

Author(s):

Konstantinos Ameranis ◽

Nikolaos Vathis ◽

Dimitris Fotakis

Keyword(s):

Time Windows ◽

Orienteering Problem

Download Full-text

Quantum-Inspired Evolutionary Algorithms for Covering Arrays of Arbitrary Strength

Lecture Notes in Computer Science - Analysis of Experimental Algorithms ◽

10.1007/978-3-030-34029-2_20 ◽

2019 ◽

pp. 300-316 ◽

Cited By ~ 2

Author(s):

Michael Wagner ◽

Ludwig Kampel ◽

Dimitris E. Simos

Keyword(s):

Evolutionary Algorithms ◽

Covering Arrays ◽

Arbitrary Strength

Download Full-text

Efficient Split-Radix and Radix-4 DCT Algorithms and Applications

Lecture Notes in Computer Science - Analysis of Experimental Algorithms ◽

10.1007/978-3-030-34029-2_13 ◽

2019 ◽

pp. 184-201

Author(s):

Sirani M. Perera ◽

Daniel Silverio ◽

Austin Ogle

Download Full-text

Lecture Notes in Computer Science - Analysis of Experimental AlgorithmsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs

On New Rebalancing Algorithm

Engineering a PTAS for Minimum Feedback Vertex Set in Planar Graphs

Hacker’s Multiple-Precision Integer-Division Program in Close Scrutiny

Effective Heuristics for Matchings in Hypergraphs

Fixed Set Search Applied to the Minimum Weighted Vertex Cover Problem

Assessing Algorithm Parameter Importance Using Global Sensitivity Analysis

Minimum and Maximum Category Constraints in the Orienteering Problem with Time Windows

Quantum-Inspired Evolutionary Algorithms for Covering Arrays of Arbitrary Strength

Efficient Split-Radix and Radix-4 DCT Algorithms and Applications

Lecture Notes in Computer Science - Analysis of Experimental Algorithms
Latest Publications