Lecture Notes in Computer Science - Combinatorial Algorithms
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783319445427, 9783319445434

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Computing Giant Graph Diameters

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-319-44543-4_29 ◽

2016 ◽

pp. 373-384

Author(s):

Peter Damaschke

Crushing Disks Efficiently

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-319-44543-4_4 ◽

2016 ◽

pp. 43-54 ◽

Cited By ~ 2

Author(s):

Stefan Funke ◽

Filip Krumpe ◽

Sabine Storandt

Weighted de Bruijn Graphs for the Menage Problem and Its Generalizations

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-319-44543-4_12 ◽

2016 ◽

pp. 151-162

Author(s):

Max A. Alekseyev

Keyword(s):

De Bruijn Graphs ◽

De Bruijn

A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-319-44543-4_25 ◽

2016 ◽

pp. 321-333 ◽

Cited By ~ 1

Author(s):

K. Subramani ◽

Piotr Wojciechowski

Keyword(s):

Utvpi Constraints

Plane Bichromatic Trees of Low Degree

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-319-44543-4_6 ◽

2016 ◽

pp. 68-80 ◽

Cited By ~ 2

Author(s):

Ahmad Biniaz ◽

Prosenjit Bose ◽

Anil Maheshwari ◽

Michiel Smid

Keyword(s):

Low Degree

On Computing the Total Displacement Number via Weighted Motzkin Paths

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-319-44543-4_33 ◽

2016 ◽

pp. 423-434 ◽

Cited By ~ 1

Author(s):

Andreas Bärtschi ◽

Barbara Geissmann ◽

Daniel Graf ◽

Tomas Hruz ◽

Paolo Penna ◽

...

Keyword(s):

Total Displacement ◽

Motzkin Paths

Evangelism in Social Networks

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-319-44543-4_8 ◽

2016 ◽

pp. 96-108 ◽

Cited By ~ 2

Author(s):

Gennaro Cordasco ◽

Luisa Gargano ◽

Adele A. Rescigno ◽

Ugo Vaccaro

Keyword(s):

Social Networks

Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-319-44543-4_17 ◽

2016 ◽

pp. 213-225 ◽

Cited By ~ 2

Author(s):

Takuya Takagi ◽

Shunsuke Inenaga ◽

Kunihiko Sadakane ◽

Hiroki Arimura

Keyword(s):

Data Structure ◽

String Processing ◽

Efficient Data

Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-319-44543-4_21 ◽

2016 ◽

pp. 266-277 ◽

Cited By ~ 2

Author(s):

Xujin Chen ◽

Zhuo Diao ◽

Xiaodong Hu ◽

Zhongzheng Tang

Keyword(s):

Sufficient Conditions ◽

Packing And Covering

Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-319-44543-4_20 ◽

2016 ◽

pp. 253-265 ◽

Cited By ~ 1

Author(s):

Konrad K. Dabrowski ◽

Vadim V. Lozin ◽

Daniël Paulusma

Keyword(s):

Quasi Ordering

Lecture Notes in Computer Science - Combinatorial AlgorithmsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Computing Giant Graph Diameters

Crushing Disks Efficiently

Weighted de Bruijn Graphs for the Menage Problem and Its Generalizations

A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints

Plane Bichromatic Trees of Low Degree

On Computing the Total Displacement Number via Weighted Motzkin Paths

Evangelism in Social Networks

Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing

Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles

Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes

Lecture Notes in Computer Science - Combinatorial Algorithms
Latest Publications