Sciweavers

2612 search results - page 50 / 523
» Switching Graphs and Their Complexity
Sort
View
160
Voted
COCO
2001
Springer
101views Algorithms» more  COCO 2001»
15 years 12 months ago
Resolution Complexity of Independent Sets in Random Graphs
Paul Beame, Russell Impagliazzo, Ashish Sabharwal
176
Voted
ICALP
2001
Springer
15 years 12 months ago
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems
Jochen Alber, Henning Fernau, Rolf Niedermeier
COCOON
1999
Springer
15 years 11 months ago
On the Complexity of Approximating Colored-Graph Problems
Andrea E. F. Clementi, Pierluigi Crescenzi, Gianlu...
WG
1994
Springer
15 years 11 months ago
Complexity of Graph Covering Problems
Jan Kratochvíl, Andrzej Proskurowski, Jan A...