Sciweavers

1421 search results - page 9 / 285

» Algorithms for subsequence combinatorics

114

COCOON
2005
Springer

88views Combinatorics» more COCOON 2005»

A Linear Time Algorithm for Finding a Maximal Planar Subgraph Based on PC-Trees

15 years 11 months ago

A Linear Time Algorithm for Finding a Maximal Planar Subgraph Based on PC-Trees

Download www.iis.sinica.edu.tw

Wen-Lian Hsu

claim paper

Read More »

103

COCOON
2005
Springer

91views Combinatorics» more COCOON 2005»

A New Algorithm for the Hypergraph Transversal Problem

15 years 11 months ago

A New Algorithm for the Hypergraph Transversal Problem

Download www.mpi-inf.mpg.de

Leonid Khachiyan, Endre Boros, Khaled M. Elbassion...

claim paper

Read More »

101

COCOON
2005
Springer

79views Combinatorics» more COCOON 2005»

Smoothed Analysis of Algorithms and Heuristics

15 years 11 months ago

Smoothed Analysis of Algorithms and Heuristics

Download teach.glencora.org

Shang-Hua Teng

claim paper

Read More »

119

COCOON
2004
Springer

143views Combinatorics» more COCOON 2004»

Algorithms for the On-Line Quota Traveling Salesman Problem

15 years 11 months ago

Algorithms for the On-Line Quota Traveling Salesman Problem

Download www.lamsade.dauphine.fr

Giorgio Ausiello, Marc Demange, Luigi Laura, Vange...

claim paper

Read More »

149

ICALP
2001
Springer

105views Programming Languages» more ICALP 2001»

Combinatorics of Periods in Strings

15 years 10 months ago

Combinatorics of Periods in Strings

Download algo.inria.fr

We consider the set Gn of all period sets of strings of length n over a ﬁnite alphabet. We show that there is redundancy in period sets and introduce the notion of an irreducibl...

Eric Rivals, Sven Rahmann

claim paper

Read More »

« Prev « First page 9 / 285 Last » Next »