Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540748380

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74839-7_16 ◽

2007 ◽

pp. 154-165

Author(s):

Angelo Monti ◽

Paolo Penna ◽

Riccardo Silvestri

Keyword(s):

Load Balancing ◽

Equivalent Version

Download Full-text

A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74839-7_14 ◽

2007 ◽

pp. 145-150 ◽

Cited By ~ 1

Author(s):

Torben Hagerup

Keyword(s):

Planar Graphs ◽

Practical Algorithm

Download Full-text

A Characterisation of the Minimal Triangulations of Permutation Graphs

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74839-7_10 ◽

2007 ◽

pp. 99-108

Author(s):

Daniel Meister

Keyword(s):

Permutation Graphs ◽

Minimal Triangulations

Download Full-text

Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74839-7_30 ◽

2007 ◽

pp. 316-327 ◽

Cited By ~ 3

Author(s):

Matthias Hagen

Keyword(s):

Lower Bounds

Download Full-text

Approximation Algorithms for Geometric Intersection Graphs

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74839-7_15 ◽

2007 ◽

pp. 151-153 ◽

Cited By ~ 2

Author(s):

Klaus Jansen

Keyword(s):

Approximation Algorithms ◽

Intersection Graphs ◽

Geometric Intersection Graphs

Download Full-text

Monotonicity of Non-deterministic Graph Searching

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74839-7_4 ◽

2007 ◽

pp. 33-44 ◽

Cited By ~ 2

Author(s):

Frédéric Mazoit ◽

Nicolas Nisse

Keyword(s):

Graph Searching

Download Full-text

Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74839-7_1 ◽

2007 ◽

pp. 1-11 ◽

Cited By ~ 3

Author(s):

Petr Golovach ◽

Jan Kratochvíl

Keyword(s):

Computational Complexity ◽

Chordal Graphs

Download Full-text

On Restrictions of Balanced 2-Interval Graphs

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74839-7_6 ◽

2007 ◽

pp. 55-65 ◽

Cited By ~ 5

Author(s):

Philippe Gambette ◽

Stéphane Vialette

Keyword(s):

Interval Graphs

Download Full-text

Tree-Width and Optimization in Bounded Degree Graphs

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74839-7_5 ◽

2007 ◽

pp. 45-54 ◽

Cited By ~ 2

Author(s):

Vadim Lozin ◽

Martin Milanič

Keyword(s):

Bounded Degree ◽

Tree Width ◽

Bounded Degree Graphs

Download Full-text

Obtaining a Planar Graph by Vertex Deletion

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74839-7_28 ◽

2007 ◽

pp. 292-303 ◽

Cited By ~ 9

Author(s):

Dániel Marx ◽

Ildikó Schlotter

Keyword(s):

Planar Graph ◽

Vertex Deletion

Download Full-text

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem

A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs

A Characterisation of the Minimal Triangulations of Permutation Graphs

Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation

Approximation Algorithms for Geometric Intersection Graphs

Monotonicity of Non-deterministic Graph Searching

Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs

On Restrictions of Balanced 2-Interval Graphs

Tree-Width and Optimization in Bounded Degree Graphs

Obtaining a Planar Graph by Vertex Deletion

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science
Latest Publications