Algorithms and Computation - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540620488, 9783540496335

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Vertex ranking of asteroidal triple-free graphs

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/bfb0009493 ◽

1996 ◽

pp. 174-182 ◽

Cited By ~ 4

Author(s):

Ton Kloks ◽

Haiko Müller ◽

C. K. Wong

Keyword(s):

Vertex Ranking ◽

Asteroidal Triple

Download Full-text

Optimal augmentation for bipartite componentwise biconnectivity in linear time

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/bfb0009497 ◽

1996 ◽

pp. 213-222 ◽

Cited By ~ 3

Author(s):

Tsan-sheng Hsu ◽

Ming-Yang Kao

Keyword(s):

Linear Time

Download Full-text

Minimizing wavelengths in an all-optical ring network

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/bfb0009511 ◽

1996 ◽

pp. 346-355 ◽

Cited By ~ 9

Author(s):

Gordon Wilfong

Keyword(s):

Ring Network ◽

All Optical ◽

Optical Ring

Download Full-text

Extremal problems for geometric hypergraphs

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/bfb0009486 ◽

1996 ◽

pp. 105-114 ◽

Cited By ~ 1

Author(s):

Tamal K. Dey ◽

János Pach

Keyword(s):

Extremal Problems ◽

Geometric Hypergraphs

Download Full-text

The multi-variable modular polynomial and its applications to cryptography

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/bfb0009515 ◽

1996 ◽

pp. 386-396 ◽

Cited By ~ 1

Author(s):

Tsuyoshi Takagi ◽

Shozo Naito

Keyword(s):

Modular Polynomial

Download Full-text

Minimum convex partition of a polygon with holes by cuts in given directions

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/bfb0009508 ◽

1996 ◽

pp. 315-325 ◽

Cited By ~ 3

Author(s):

A. Lingas ◽

V. Soltan

Keyword(s):

Convex Partition

Download Full-text

Computing fair and bottleneck matchings in geometric graphs

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/bfb0009487 ◽

1996 ◽

pp. 115-125 ◽

Cited By ~ 2

Author(s):

Alon Efrat ◽

Matthew J. Katz

Keyword(s):

Geometric Graphs

Download Full-text

Separating and shattering long line segments

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/bfb0009479 ◽

1996 ◽

pp. 36-44

Author(s):

Alon Efrat ◽

Otfried Schwarzkopf

Keyword(s):

Line Segments ◽

Long Line

Download Full-text

An algorithm for enumerating all directed spanning trees in a directed graph

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/bfb0009492 ◽

1996 ◽

pp. 166-173 ◽

Cited By ~ 7

Author(s):

Takeaki Uno

Keyword(s):

Directed Graph ◽

Spanning Trees

Download Full-text

Finding edge-disjoint paths in partial k-trees

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/bfb0009496 ◽

1996 ◽

pp. 203-212 ◽

Cited By ~ 2

Author(s):

Xiao Zhou ◽

Syurei Tamura ◽

Takao Nishizeki

Keyword(s):

Disjoint Paths ◽

Edge Disjoint

Download Full-text

Algorithms and Computation - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Vertex ranking of asteroidal triple-free graphs

Optimal augmentation for bipartite componentwise biconnectivity in linear time

Minimizing wavelengths in an all-optical ring network

Extremal problems for geometric hypergraphs

The multi-variable modular polynomial and its applications to cryptography

Minimum convex partition of a polygon with holes by cuts in given directions

Computing fair and bottleneck matchings in geometric graphs

Separating and shattering long line segments

An algorithm for enumerating all directed spanning trees in a directed graph

Finding edge-disjoint paths in partial k-trees

Algorithms and Computation - Lecture Notes in Computer Science
Latest Publications