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
6
search results - page 2 / 2
»
Inapproximability of Hypergraph Vertex Cover and Application...
Sort
relevance
views
votes
recent
update
View
thumb
title
28
click to vote
TAMC
2007
Springer
114
views
Applied Computing
»
more
TAMC 2007
»
Kernelizations for Parameterized Counting Problems
14 years 2 months ago
Download
www.eecs.berkeley.edu
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
Marc Thurley
claim paper
Read More »
« Prev
« First
page 2 / 2
Last »
Next »