Sciweavers

MEMBRANE
2009
Springer
15 years 29 days ago
An Overview of P-Lingua 2.0
Manuel García-Quismondo, Rosa Gutiér...
MEMBRANE
2009
Springer
15 years 29 days ago
Solving NP-Complete Problems by Spiking Neural P Systems with Budding Rules
Tseren-Onolt Ishdorj, Alberto Leporati, Linqiang P...
MEMBRANE
2009
Springer
15 years 29 days ago
From P to MP Systems
Vincenzo Manca
MEMBRANE
2009
Springer
15 years 29 days ago
On Reversibility and Determinism in P Systems
Artiom Alhazov, Kenichi Morita
MEMBRANE
2009
Springer
15 years 29 days ago
Tuning P Systems for Solving the Broadcasting Problem
Raluca Lefticaru, Florentin Ipate, Marian Gheorghe...
MEMBRANE
2009
Springer
15 years 29 days ago
An Improved Membrane Algorithm for Solving Time-Frequency Atom Decomposition
Chunxiu Liu, Gexiang Zhang, Hongwen Liu, Marian Gh...
IWPEC
2009
Springer
15 years 29 days ago
Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
Peter Damaschke
IWPEC
2009
Springer
15 years 29 days ago
Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
Petr A. Golovach, Dimitrios M. Thilikos
IWPEC
2009
Springer
15 years 29 days ago
An Exponential Time 2-Approximation Algorithm for Bandwidth
The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent vertices differ by ...
Martin Fürer, Serge Gaspers, Shiva Prasad Kas...
IWPEC
2009
Springer
15 years 29 days ago
On Digraph Width Measures in Parameterized Algorithmics
Robert Ganian, Petr Hlinený, Joachim Kneis,...