Search Sciweavers | Sciweavers

9842 search results - page 99 / 1969

» The Complexity of the Matching-Cut Problem

click to vote

FOCS
2002
IEEE

116views Theoretical Computer Science» more FOCS 2002»

The Parameterized Complexity of Counting Problems

14 years 3 months ago

Download www2.informatik.hu-berlin.de

Jörg Flum, Martin Grohe

claim paper

Read More »

click to vote

CPM
2010
Springer

134views Combinatorics» more CPM 2010»

On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs

14 years 2 months ago

Download cs.nyu.edu

Minghui Jiang

claim paper

Read More »

click to vote

IWOCA
2009
Springer

112views Algorithms» more IWOCA 2009»

The Guarding Problem - Complexity and Approximation

14 years 2 months ago

Download www.cse.iitm.ac.in

T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Ra...

claim paper

Read More »

click to vote

ICALP
2001
Springer

86views Programming Languages» more ICALP 2001»

Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems

14 years 2 months ago

Download theinf1.informatik.uni-jena.de

Jochen Alber, Henning Fernau, Rolf Niedermeier

claim paper

Read More »

click to vote

APPROX
2000
Springer

84views Algorithms» more APPROX 2000»

On the relative complexity of approximate counting problems

14 years 2 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers