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
359
search results - page 7 / 72
»
The Parameterized Complexity of Counting Problems
Sort
relevance
views
votes
recent
update
View
thumb
title
109
click to vote
COCOA
2008
Springer
129
views
Discrete Geometry
»
more
COCOA 2008
»
Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems
15 years 4 months ago
Download
theinf1.informatik.uni-jena.de
Nadja Betzler, Johannes Uhlmann
claim paper
Read More »
101
click to vote
CATS
2008
172
views
Applied Computing
»
more
CATS 2008
»
The Parameterized Complexity of Regular Subgraph Problems and Generalizations
15 years 4 months ago
Download
www.dur.ac.uk
Luke Mathieson, Stefan Szeider
claim paper
Read More »
78
click to vote
CJ
2008
66
views
more
CJ 2008
»
Parameterized Complexity of Cardinality Constrained Optimization Problems
15 years 3 months ago
Download
www.cse.cuhk.edu.hk
Leizhen Cai
claim paper
Read More »
104
click to vote
CORR
2010
Springer
122
views
Education
»
more
CORR 2010
»
Parameterized Complexity of Generalized Domination Problems on Bounded Tree-Width Graphs
14 years 11 months ago
Download
www.lirmm.fr
Mathieu Chapelle
claim paper
Read More »
95
click to vote
APPROX
2000
Springer
84
views
Algorithms
»
more
APPROX 2000
»
On the relative complexity of approximate counting problems
15 years 7 months ago
Download
web.maths.unsw.edu.au
Martin E. Dyer, Leslie Ann Goldberg, Catherine S. ...
claim paper
Read More »
« Prev
« First
page 7 / 72
Last »
Next »