Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
10
search results - page 1 / 2
»
siamdm 1998
Sort
relevance
views
votes
recent
update
View
thumb
title
28
click to vote
SIAMDM
1998
65
views
more
SIAMDM 1998
»
A Greedy Algorithm Estimating the Height of Random Trees
13 years 10 months ago
Download
www.ima.umn.edu
Tomasz Luczak
claim paper
Read More »
26
click to vote
SIAMDM
1998
87
views
more
SIAMDM 1998
»
Sorting by Transpositions
13 years 10 months ago
Download
acgt.cs.tau.ac.il
Vineet Bafna, Pavel A. Pevzner
claim paper
Read More »
20
click to vote
SIAMDM
1998
53
views
more
SIAMDM 1998
»
Two Arc-Disjoint Paths in Eulerian Digraphs
13 years 10 months ago
Download
www.cs.elte.hu
András Frank, Toshihide Ibaraki, Hiroshi Na...
claim paper
Read More »
24
click to vote
SIAMDM
1998
64
views
more
SIAMDM 1998
»
The Ring Loading Problem
13 years 10 months ago
Download
www.cs.ust.hk
Alexander Schrijver, Paul D. Seymour, Peter Winkle...
claim paper
Read More »
26
click to vote
SIAMDM
1998
165
views
more
SIAMDM 1998
»
The Number of Independent Sets in a Grid Graph
13 years 10 months ago
Download
www.ces.clemson.edu
If f(m, n) is the (vertex) independence number of the m × n grid graph, then we show that the double limit η = def limm,n→∞ f(m, n) 1 mn exists, thereby refining earlier res...
Neil J. Calkin, Herbert S. Wilf
claim paper
Read More »
« Prev
« First
page 1 / 2
Last »
Next »