Combinatorial Optimization and Applications - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540850960, 9783540850977

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Simplicial Powers of Graphs

Combinatorial Optimization and Applications - Lecture Notes in Computer Science ◽

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

2008 ◽

pp. 160-170 ◽

Cited By ~ 3

Author(s):

Andreas Brandstädt ◽

Van Bang Le

Download Full-text

The Clique Corona Operation and Greedoids

Combinatorial Optimization and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-85097-7_36 ◽

2008 ◽

pp. 384-392 ◽

Cited By ~ 2

Author(s):

Vadim E. Levit ◽

Eugen Mandrescu

Download Full-text

On the Stable Set Polytope of Claw-Free Graphs

Combinatorial Optimization and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-85097-7_32 ◽

2008 ◽

pp. 339-350 ◽

Cited By ~ 1

Author(s):

Anna Galluccio ◽

Claudio Gentile ◽

Paolo Ventura

Keyword(s):

Stable Set ◽

Stable Set Polytope

Download Full-text

Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries

Combinatorial Optimization and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-85097-7_3 ◽

2008 ◽

pp. 23-31 ◽

Cited By ~ 1

Author(s):

Rhonda Chaytor ◽

Patricia A. Evans ◽

Todd Wareham

Keyword(s):

Fixed Parameter Tractability ◽

Fixed Parameter

Download Full-text

Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph

Combinatorial Optimization and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-85097-7_24 ◽

2008 ◽

pp. 255-264

Author(s):

Zhao Zhang ◽

Xiaofeng Gao ◽

Weili Wu

Keyword(s):

Unit Disk ◽

Polynomial Time ◽

Approximation Scheme ◽

Vertex Cover ◽

Unit Disk Graph ◽

Polynomial Time Approximation Scheme ◽

Time Approximation ◽

Connected Vertex Cover ◽

Connected Vertex ◽

Polynomial Time Approximation

Download Full-text

Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order

Combinatorial Optimization and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-85097-7_20 ◽

2008 ◽

pp. 211-224 ◽

Cited By ~ 6

Author(s):

Gerold Jäger ◽

Paul Molitor

Keyword(s):

Experimental Study ◽

Traveling Salesman Problem ◽

Second Order ◽

Traveling Salesman ◽

The Traveling Salesman Problem

Download Full-text

Protean Graphs with a Variety of Ranking Schemes

Combinatorial Optimization and Applications - Lecture Notes in Computer Science ◽

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

2008 ◽

pp. 149-159 ◽

Cited By ~ 1

Author(s):

Paweł Prałat

Download Full-text

An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem

Combinatorial Optimization and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-85097-7_27 ◽

2008 ◽

pp. 286-295 ◽

Cited By ~ 8

Author(s):

Zhipeng Cai ◽

Zhi-Zhong Chen ◽

Guohui Lin ◽

Lusheng Wang

Keyword(s):

Approximation Algorithm ◽

Multicast Tree ◽

Routing Problem ◽

Tree Routing

Download Full-text

Parameterized Graph Editing with Chosen Vertex Degrees

Combinatorial Optimization and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-85097-7_2 ◽

2008 ◽

pp. 13-22 ◽

Cited By ~ 2

Author(s):

Luke Mathieson ◽

Stefan Szeider

Keyword(s):

Vertex Degrees

Download Full-text

Enumerating Isolated Cliques in Synthetic and Financial Networks

Combinatorial Optimization and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-85097-7_38 ◽

2008 ◽

pp. 405-416 ◽

Cited By ~ 5

Author(s):

Falk Hüffner ◽

Christian Komusiewicz ◽

Hannes Moser ◽

Rolf Niedermeier

Keyword(s):

Financial Networks

Download Full-text

Combinatorial Optimization and Applications - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Simplicial Powers of Graphs

The Clique Corona Operation and Greedoids

On the Stable Set Polytope of Claw-Free Graphs

Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries

Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph

Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order

Protean Graphs with a Variety of Ranking Schemes

An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem

Parameterized Graph Editing with Chosen Vertex Degrees

Enumerating Isolated Cliques in Synthetic and Financial Networks

Combinatorial Optimization and Applications - Lecture Notes in Computer Science
Latest Publications