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

9783642169250, 9783642169267

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching

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

10.1007/978-3-642-16926-7_10 ◽

2010 ◽

pp. 88-99 ◽

Cited By ~ 2

Author(s):

Mathieu Liedloff ◽

Ioan Todinca ◽

Yngve Villanger

Keyword(s):

Dominating Set ◽

Maximum Matching

Download Full-text

Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time

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

10.1007/978-3-642-16926-7_9 ◽

2010 ◽

pp. 75-87 ◽

Cited By ~ 4

Author(s):

Pinar Heggernes ◽

Pim van ’t Hof ◽

Daniel Lokshtanov ◽

Jesper Nederlof

Keyword(s):

Linear Time ◽

Permutation Graphs ◽

Bipartite Permutation Graphs

Download Full-text

Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces

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

10.1007/978-3-642-16926-7_25 ◽

2010 ◽

pp. 266-278 ◽

Cited By ~ 28

Author(s):

Nicolas Bonichon ◽

Cyril Gavoille ◽

Nicolas Hanusse ◽

David Ilcinkas

Keyword(s):

Delaunay Triangulations

Download Full-text

Algorithmic Barriers from Phase Transitions in Graphs

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

10.1007/978-3-642-16926-7_1 ◽

2010 ◽

pp. 1-1

Author(s):

Dimitris Achlioptas

Keyword(s):

Phase Transitions

Download Full-text

On Stable Matchings and Flows

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

10.1007/978-3-642-16926-7_7 ◽

2010 ◽

pp. 51-62 ◽

Cited By ~ 5

Author(s):

Tamás Fleiner

Keyword(s):

Stable Matchings

Download Full-text

max-cut and Containment Relations in Graphs

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

10.1007/978-3-642-16926-7_4 ◽

2010 ◽

pp. 15-26 ◽

Cited By ~ 1

Author(s):

Marcin Kamiński

Download Full-text

The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree

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

10.1007/978-3-642-16926-7_28 ◽

2010 ◽

pp. 304-314

Author(s):

Edyta Szymańska

Keyword(s):

Vertex Coloring ◽

Uniform Hypergraphs ◽

High Degree

Download Full-text

Complexity Results for the Spanning Tree Congestion Problem

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

10.1007/978-3-642-16926-7_3 ◽

2010 ◽

pp. 3-14 ◽

Cited By ~ 6

Author(s):

Yota Otachi ◽

Hans L. Bodlaender ◽

Erik Jan van Leeuwen

Keyword(s):

Spanning Tree ◽

Complexity Results

Download Full-text

Parameterized Complexity of the Arc-Preserving Subsequence Problem

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

10.1007/978-3-642-16926-7_23 ◽

2010 ◽

pp. 244-255 ◽

Cited By ~ 1

Author(s):

Dániel Marx ◽

Ildikó Schlotter

Keyword(s):

Parameterized Complexity

Download Full-text

On the Small Cycle Transversal of Planar Graphs

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

10.1007/978-3-642-16926-7_12 ◽

2010 ◽

pp. 112-122

Author(s):

Ge Xia ◽

Yong Zhang

Keyword(s):

Planar Graphs ◽

Small Cycle

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching

Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time

Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces

Algorithmic Barriers from Phase Transitions in Graphs

On Stable Matchings and Flows

max-cut and Containment Relations in Graphs

The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree

Complexity Results for the Spanning Tree Congestion Problem

Parameterized Complexity of the Arc-Preserving Subsequence Problem

On the Small Cycle Transversal of Planar Graphs

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