Refined Search Tree Technique for DOMINATING SET on Planar Graphs
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
On efficient fixed-parameter algorithms for weighted vertex cover
Journal of Algorithms
An efficient fixed-parameter algorithm for 3-hitting set
Journal of Discrete Algorithms
Call control with k rejections
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
On the existence of subexponential parameterized algorithms
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Refined memorization for vertex cover
Information Processing Letters
A refined search tree technique for Dominating Set on planar graphs
Journal of Computer and System Sciences
Invitation to data reduction and problem kernelization
ACM SIGACT News
Two fixed-parameter algorithms for Vertex Covering by Paths on Trees
Information Processing Letters
Fixed parameter algorithms for one-sided crossing minimization revisited
Journal of Discrete Algorithms
Going Weighted: Parameterized Algorithms for Cluster Editing
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Efficiency in exponential time for domination-type problems
Discrete Applied Mathematics
Fixed-parameter algorithms for Kemeny rankings
Theoretical Computer Science
Going weighted: Parameterized algorithms for cluster editing
Theoretical Computer Science
Refined memorization for vertex cover
Information Processing Letters
Graph-modeled data clustering: fixed-parameter algorithms for clique generation
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
A probabilistic beam search approach to the shortest common supersequence problem
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Problem kernels for NP-complete edge deletion problems: split and related graphs
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
New fixed-parameter algorithms for the minimum quartet inconsistency problem
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Improved upper bounds for vertex cover
Theoretical Computer Science
Algorithms and theory of computation handbook
Cograph editing: complexity and parameterized algorithms
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Polynomial kernels for proper interval completion and related problems
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Improved Fixed-Parameter Algorithms for Minimum-Flip Consensus Trees
ACM Transactions on Algorithms (TALG)
A More Relaxed Model for Graph-Based Data Clustering: $s$-Plex Cluster Editing
SIAM Journal on Discrete Mathematics
On making directed graphs transitive
Journal of Computer and System Sciences
Memetic algorithms with partial lamarckism for the shortest common supersequence problem
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
Parameterized complexity of generalized vertex cover problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Applying modular decomposition to parameterized bicluster editing
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Towards a taxonomy of techniques for designing parameterized algorithms
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
A golden ratio parameterized algorithm for cluster editing
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
A parameterized complexity tutorial
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
A golden ratio parameterized algorithm for Cluster Editing
Journal of Discrete Algorithms
Exact combinatorial algorithms and experiments for finding maximum k-plexes
Journal of Combinatorial Optimization
Complexity and parameterized algorithms for Cograph Editing
Theoretical Computer Science
Parallel vertex cover: a case study in dynamic load balancing
AusPDC '11 Proceedings of the Ninth Australasian Symposium on Parallel and Distributed Computing - Volume 118
Polynomial kernels for Proper Interval Completion and related problems
Information and Computation
On the generalized multiway cut in trees problem
Journal of Combinatorial Optimization
| Hi-index | 0.90 |