Sciweavers

CPM
2000
Springer
136views Combinatorics» more  CPM 2000»
13 years 9 months ago
Approximating the Maximum Isomorphic Agreement Subtree Is Hard
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
Paola Bonizzoni, Gianluca Della Vedova, Giancarlo ...
COCOON
2000
Springer
13 years 9 months ago
Parameterized Complexity of Finding Subgraphs with Hereditary Properties
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...
Subhash Khot, Venkatesh Raman
COCOON
2000
Springer
13 years 9 months ago
Maximum Induced Matchings of Random Cubic Graphs
William Duckworth, Nicholas C. Wormald, Michele Zi...
COCOON
2000
Springer
13 years 9 months ago
On Computation of Arbitrage for Markets with Friction
Xiaotie Deng, Zhongfei Li, Shouyang Wang
COCOON
2000
Springer
13 years 9 months ago
Approximating Uniform Triangular Meshes in Polygons
Franz Aurenhammer, Naoki Katoh, Hiromichi Kojima, ...
COCOON
2000
Springer
13 years 9 months ago
Recent Progress and Prospects for Integer Factorisation Algorithms
The integer factorisation and discrete logarithm problems are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presum...
Richard P. Brent
DMCCG
2001
Springer
136views Combinatorics» more  DMCCG 2001»
13 years 9 months ago
Megamaps: Construction and Examples
Alexander Zvonkin
DMCCG
2001
Springer
113views Combinatorics» more  DMCCG 2001»
13 years 9 months ago
The Many Faces of Alternating-Sign Matrices
James Gary Propp
DMCCG
2001
Springer
117views Combinatorics» more  DMCCG 2001»
13 years 9 months ago
On the Toppling of a Sand Pile
Jean-Christophe Novelli, Dominique Rossin