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
3
search results - page 1 / 1
»
Strong-Diameter Decompositions of Minor Free Graphs
Sort
relevance
views
votes
recent
update
View
thumb
title
28
click to vote
MST
2010
74
views
more
MST 2010
»
Strong-Diameter Decompositions of Minor Free Graphs
13 years 4 months ago
Download
research.microsoft.com
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi ...
claim paper
Read More »
27
click to vote
SODA
2010
ACM
216
views
Algorithms
»
more
SODA 2010
»
Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs
14 years 7 months ago
Download
erikdemaine.org
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
claim paper
Read More »
24
click to vote
FSTTCS
2009
Springer
120
views
Software Engineering
»
more
FSTTCS 2009
»
Domination Problems in Nowhere-Dense Classes
14 years 4 months ago
Download
www.cl.cam.ac.uk
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
Anuj Dawar, Stephan Kreutzer
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »