Lecture Notes in Computer Science - Combinatorial Algorithms
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642452772, 9783642452789

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Motif Matching Using Gapped Patterns

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-642-45278-9_41 ◽

2013 ◽

pp. 448-452 ◽

Cited By ~ 1

Author(s):

Emanuele Giaquinta ◽

Kimmo Fredriksson ◽

Szymon Grabowski ◽

Esko Ukkonen

Download Full-text

An FPT Certifying Algorithm for the Vertex-Deletion Problem

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-642-45278-9_45 ◽

2013 ◽

pp. 468-472

Author(s):

Haiko Müller ◽

Samuel Wilson

Keyword(s):

Vertex Deletion ◽

Certifying Algorithm

Download Full-text

Tight Bound on the Diameter of the Knödel Graph

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-642-45278-9_18 ◽

2013 ◽

pp. 206-215 ◽

Cited By ~ 1

Author(s):

Hayk Grigoryan ◽

Hovhannes A. Harutyunyan

Keyword(s):

Tight Bound

Download Full-text

Dynamising Interval Scheduling: The Monotonic Case

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-642-45278-9_16 ◽

2013 ◽

pp. 178-191 ◽

Cited By ~ 1

Author(s):

Alexander Gavruskin ◽

Bakhadyr Khoussainov ◽

Mikhail Kokho ◽

Jiamou Liu

Keyword(s):

Interval Scheduling

Download Full-text

SAT and IP Based Algorithms for Magic Labeling with Applications

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-642-45278-9_22 ◽

2013 ◽

pp. 258-268

Author(s):

Gerold Jäger

Download Full-text

Phase Transition of Random Non-uniform Hypergraphs

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-642-45278-9_12 ◽

2013 ◽

pp. 127-139

Author(s):

Élie de Panafieu

Keyword(s):

Phase Transition ◽

Uniform Hypergraphs

Download Full-text

Cluster Editing with Locally Bounded Modifications Revisited

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-642-45278-9_38 ◽

2013 ◽

pp. 433-437

Author(s):

Peter Damaschke

Keyword(s):

Cluster Editing

Download Full-text

Construction Techniques for Digraphs with Minimum Diameter

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-642-45278-9_28 ◽

2013 ◽

pp. 327-336

Author(s):

Mirka Miller ◽

Slamin ◽

Joe Ryan ◽

Edy Tri Baskoro

Keyword(s):

Minimum Diameter ◽

Construction Techniques

Download Full-text

Degree Sequences of PageRank Uniform Graphs and Digraphs with Prime Outdegrees

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-642-45278-9_26 ◽

2013 ◽

pp. 303-313 ◽

Cited By ~ 1

Author(s):

Nacho López ◽

Francesc Sebé

Keyword(s):

Degree Sequences

Download Full-text

Maximum Spectral Radius of Graphs with Connectivity at Most k and Minimum Degree at Least δ

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-642-45278-9_25 ◽

2013 ◽

pp. 297-302

Author(s):

Hongliang Lu ◽

Yuqing Lin

Keyword(s):

Spectral Radius ◽

Minimum Degree

Download Full-text

Lecture Notes in Computer Science - Combinatorial AlgorithmsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Motif Matching Using Gapped Patterns

An FPT Certifying Algorithm for the Vertex-Deletion Problem

Tight Bound on the Diameter of the Knödel Graph

Dynamising Interval Scheduling: The Monotonic Case

SAT and IP Based Algorithms for Magic Labeling with Applications

Phase Transition of Random Non-uniform Hypergraphs

Cluster Editing with Locally Bounded Modifications Revisited

Construction Techniques for Digraphs with Minimum Diameter

Degree Sequences of PageRank Uniform Graphs and Digraphs with Prime Outdegrees

Maximum Spectral Radius of Graphs with Connectivity at Most k and Minimum Degree at Least δ

Lecture Notes in Computer Science - Combinatorial Algorithms
Latest Publications