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
3019
search results - page 9 / 604
»
Approximating the Domatic Number
Sort
relevance
views
votes
recent
update
View
thumb
title
12
click to vote
FOCS
1998
IEEE
72
views
Theoretical Computer Science
»
more
FOCS 1998
»
Approximating a Finite Metric by a Small Number of Tree Metrics
13 years 11 months ago
Download
www.cis.upenn.edu
Moses Charikar, Chandra Chekuri, Ashish Goel, Sudi...
claim paper
Read More »
28
click to vote
CPM
1997
Springer
111
views
Combinatorics
»
more
CPM 1997
»
Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem
13 years 11 months ago
Download
www.csc.liv.ac.uk
Mary Cryan, Leslie Ann Goldberg, Cynthia A. Philli...
claim paper
Read More »
18
click to vote
CPC
2004
68
views
more
CPC 2004
»
Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs
13 years 7 months ago
Download
www.dur.ac.uk
Magnus Bordewich
claim paper
Read More »
18
click to vote
COMPUTING
2000
89
views
more
COMPUTING 2000
»
Condition Numbers of Approximate Schur Complements in Two- and Three-Dimensional Discretizations on Hierarchically Ordered Grids
13 years 7 months ago
Download
www.springerlink.com
We investigate multilevel incomplete factorizations of M-matrices arising from
J. K. Kraus, C. W. Brand
claim paper
Read More »
30
click to vote
ISAAC
2007
Springer
183
views
Algorithms
»
more
ISAAC 2007
»
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
14 years 1 months ago
Download
www.imsc.res.in
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, So...
claim paper
Read More »
« Prev
« First
page 9 / 604
Last »
Next »