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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
543
search results - page 6 / 109
»
New Upper Bounds for MaxSat
Sort
relevance
views
votes
recent
update
View
thumb
title
101
click to vote
CORR
2008
Springer
90
views
Education
»
more
CORR 2008
»
A New Upper Bound on the Capacity of a Class of Primitive Relay Channels
15 years 6 months ago
Download
www.ece.umd.edu
Ravi Tandon, Sennur Ulukus
claim paper
Read More »
111
click to vote
COMBINATORICS
2006
105
views
more
COMBINATORICS 2006
»
New Upper Bound for a Class of Vertex Folkman Numbers
15 years 6 months ago
Download
www.maths.tcd.ie
N. Kolev, N. Nenov
claim paper
Read More »
123
click to vote
COMBINATORICS
2007
84
views
more
COMBINATORICS 2007
»
A New Upper Bound on the Total Domination Number of a Graph
15 years 6 months ago
Download
www.combinatorics.org
Michael A. Henning, Anders Yeo
claim paper
Read More »
147
click to vote
JGT
2008
92
views
more
JGT 2008
»
A new upper bound for the bipartite Ramsey problem
15 years 6 months ago
Download
www.dpmms.cam.ac.uk
We consider the following question: how large does n have to be to guarantee that in any two-colouring of the edges of the complete graph Kn,n there is a monochromatic Kk,k? In th...
David Conlon
claim paper
Read More »
81
Voted
JGT
2006
28
views
more
JGT 2006
»
New upper bounds on the decomposability of planar graphs
15 years 6 months ago
Download
users.uoa.gr
Fedor V. Fomin, Dimitrios M. Thilikos
claim paper
Read More »
« Prev
« First
page 6 / 109
Last »
Next »