Volume 52; Issue 2

Algorithmica

Volume 52; Issue 2
2

Fixed-Parameter Complexity of Minimum Profile Problems

Gregory Gutin, Stefan Szeider, Anders Yeo
Journal:
Algorithmica
Year:
2008
Language:
english
File:
PDF, 440 KB
english, 2008
3

Solving Connected Dominating Set Faster than 2n

Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
Journal:
Algorithmica
Year:
2008
Language:
english
File:
PDF, 371 KB
english, 2008
4

Faster Fixed-Parameter Tractable Algorithms for

M. R. Fellows, C. Knauer, N. Nishimura, P. Ragde, F. Rosamond, U. Stege, D. M. Thilikos, S. Whitesides
Journal:
Algorithmica
Year:
2008
Language:
english
File:
PDF, 319 KB
english, 2008
5

Improved Algorithms and Complexity Results for Power Domination in Graphs

Jiong Guo, Rolf Niedermeier, Daniel Raible
Journal:
Algorithmica
Year:
2008
Language:
english
File:
PDF, 495 KB
english, 2008
6

Short Cycles MakeW-hard Problems Hard: FPT

Venkatesh Raman, Saket Saurabh
Journal:
Algorithmica
Year:
2008
Language:
english
File:
PDF, 473 KB
english, 2008
7

Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings

Andreas Björklund, Thore Husfeldt
Journal:
Algorithmica
Year:
2008
Language:
english
File:
PDF, 505 KB
english, 2008
11

Foreword from the Guest Editors

Jianer Chen, Iyad A. Kanj
Journal:
Algorithmica
Year:
2008
Language:
english
File:
PDF, 108 KB
english, 2008