Computational Geometry and Graphs - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642452802, 9783642452819

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Affine Classes of 3-Dimensional Parallelohedra - Their Parametrization -

Computational Geometry and Graphs - Lecture Notes in Computer Science ◽

10.1007/978-3-642-45281-9_6 ◽

2013 ◽

pp. 64-72

Author(s):

Nikolai Dolbilin ◽

Jin-ichi Itoh ◽

Chie Nara

Keyword(s):

3 Dimensional

Download Full-text

The Number of Diagonal Transformations in Quadrangulations on the Sphere

Computational Geometry and Graphs - Lecture Notes in Computer Science ◽

10.1007/978-3-642-45281-9_11 ◽

2013 ◽

pp. 110-119 ◽

Cited By ~ 2

Author(s):

Naoki Matsumoto ◽

Atsuhiro Nakamoto

Download Full-text

Spanning Caterpillars Having at Most k Leaves

Computational Geometry and Graphs - Lecture Notes in Computer Science ◽

10.1007/978-3-642-45281-9_9 ◽

2013 ◽

pp. 95-100

Author(s):

Mikio Kano ◽

Tomoki Yamashita ◽

Zheng Yan

Download Full-text

On Non 3-Choosable Bipartite Graphs

Computational Geometry and Graphs - Lecture Notes in Computer Science ◽

10.1007/978-3-642-45281-9_4 ◽

2013 ◽

pp. 42-56

Author(s):

W. Charoenpanitseri ◽

N. Punnim ◽

C. Uiyyasathian

Keyword(s):

Bipartite Graphs

Download Full-text

GDDs with Two Associate Classes and with Three Groups of Sizes 1, n, n and λ 1 < λ 2

Computational Geometry and Graphs - Lecture Notes in Computer Science ◽

10.1007/978-3-642-45281-9_10 ◽

2013 ◽

pp. 101-109

Author(s):

Wannee Lapchinda ◽

Narong Punnim ◽

Nittiya Pabhapote

Download Full-text

On Simplifying Deformation of Smooth Manifolds Defined by Large Weighted Point Sets

Computational Geometry and Graphs - Lecture Notes in Computer Science ◽

10.1007/978-3-642-45281-9_15 ◽

2013 ◽

pp. 150-161 ◽

Cited By ~ 1

Author(s):

Ke Yan ◽

Ho-Lun Cheng

Keyword(s):

Smooth Manifolds ◽

Point Sets ◽

Weighted Point

Download Full-text

A Necessary and Sufficient Condition for a Bipartite Distance-Hereditary Graph to Be Hamiltonian

Computational Geometry and Graphs - Lecture Notes in Computer Science ◽

10.1007/978-3-642-45281-9_14 ◽

2013 ◽

pp. 143-149 ◽

Cited By ~ 1

Author(s):

Masahide Takasuga ◽

Tomio Hirata

Keyword(s):

Sufficient Condition ◽

Necessary And Sufficient Condition ◽

Necessary And Sufficient

Download Full-text

Greedy Approximation Algorithms for Generalized Maximum Flow Problem towards Relation Extraction in Information Networks

Computational Geometry and Graphs - Lecture Notes in Computer Science ◽

10.1007/978-3-642-45281-9_13 ◽

2013 ◽

pp. 132-142

Author(s):

Yusuke Nojima ◽

Yasuhito Asano ◽

Masatoshi Yoshikawa

Keyword(s):

Approximation Algorithms ◽

Flow Problem ◽

Relation Extraction ◽

Maximum Flow ◽

Information Networks ◽

Greedy Approximation ◽

Maximum Flow Problem

Download Full-text

Remarks on Schur’s Conjecture

Computational Geometry and Graphs - Lecture Notes in Computer Science ◽

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

2013 ◽

pp. 120-131 ◽

Cited By ~ 3

Author(s):

Filip Morić ◽

János Pach

Download Full-text

How to Generalize Janken – Rock-Paper-Scissors-King-Flea

Computational Geometry and Graphs - Lecture Notes in Computer Science ◽

10.1007/978-3-642-45281-9_8 ◽

2013 ◽

pp. 85-94 ◽

Cited By ~ 1

Author(s):

Hiro Ito

Download Full-text

Computational Geometry and Graphs - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Affine Classes of 3-Dimensional Parallelohedra - Their Parametrization -

The Number of Diagonal Transformations in Quadrangulations on the Sphere

Spanning Caterpillars Having at Most k Leaves

On Non 3-Choosable Bipartite Graphs

GDDs with Two Associate Classes and with Three Groups of Sizes 1, n, n and λ 1 < λ 2

On Simplifying Deformation of Smooth Manifolds Defined by Large Weighted Point Sets

A Necessary and Sufficient Condition for a Bipartite Distance-Hereditary Graph to Be Hamiltonian

Greedy Approximation Algorithms for Generalized Maximum Flow Problem towards Relation Extraction in Information Networks

Remarks on Schur’s Conjecture

How to Generalize Janken – Rock-Paper-Scissors-King-Flea

Computational Geometry and Graphs - Lecture Notes in Computer Science
Latest Publications