Improved Parameterized Algorithms for Planar Dominating Set
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Parameterized Counting Problems
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
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
Graph Separator Algorithms: A Refined Analysis
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Computing small partial coverings
Information Processing Letters
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
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
On the existence of subexponential parameterized algorithms
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Graph separators: a parameterized view
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
An efficient parameterized algorithm for m-set packing
Journal of Algorithms
Polynomial-time data reduction for dominating set
Journal of the ACM (JACM)
A fixed-parameter tractable algorithm for matrix domination
Information Processing Letters
Linear FPT reductions and computational lower bounds
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Parameterized complexity: exponential speed-up for planar graph problems
Journal of Algorithms
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Refined memorization for vertex cover
Information Processing Letters
The method of extremal structure on the k-maximum cut problem
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation
Measure and conquer: a simple O(20.288n) independent set algorithm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A refined search tree technique for Dominating Set on planar graphs
Journal of Computer and System Sciences
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
Theoretical Computer Science - Parameterized and exact computation
Reducing to independent set structure: the case of k-internal spanning tree
Nordic Journal of Computing
On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4]
Theoretical Computer Science - Algorithmic applications in management
Strong computational lower bounds via parameterized complexity
Journal of Computer and System Sciences
Invitation to data reduction and problem kernelization
ACM SIGACT News
Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms
INFORMS Journal on Computing
Genus characterizes the complexity of certain graph problems: Some tight results
Journal of Computer and System Sciences
Crown reductions for the Minimum Weighted Vertex Cover problem
Discrete Applied Mathematics
A fixed-parameter algorithm for the directed feedback vertex set problem
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A fixed-parameter algorithm for the directed feedback vertex set problem
Journal of the ACM (JACM)
A Problem Kernelization for Graph Packing
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Journal of Discrete Algorithms
Algorithms for optimal outlier removal
Journal of Discrete Algorithms
On parameterized exponential time complexity
Theoretical Computer Science
A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
On Parameterized Exponential Time Complexity
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Linear Kernel for Planar Connected Dominating Set
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Fixed-parameter evolutionary algorithms and the vertex cover problem
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
An Improved SAT Algorithm in Terms of Formula Length
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Additive pattern database heuristics
Journal of Artificial Intelligence Research
A Linear Vertex Kernel for Maximum Internal Spanning Tree
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation
Refined memorization for vertex cover
Information Processing Letters
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Parameterized algorithms for d-Hitting Set: The weighted case
Theoretical Computer Science
Graph-modeled data clustering: fixed-parameter algorithms for clique generation
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Genus characterizes the complexity of graph problems: some tight results
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Kernelizations for parameterized counting problems
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
An exact algorithm based on chain implication for the Min-CVCB problem
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Optimal parameterized rectangular coverings
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
An improved kernel size for rotation distance in binary trees
Information Processing Letters
An improved kernelization algorithm for r-Set Packing
Information Processing Letters
Improved upper bounds for vertex cover
Theoretical Computer Science
Separator-based data reduction for signed graph balancing
Journal of Combinatorial Optimization
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A linear kernel for co-path/cycle packing
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
A hybrid graph representation for recursive backtracking algorithms
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Algorithms and theory of computation handbook
The curse of connectivity: t-total vertex (edge) cover
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
A note on vertex cover in graphs with maximum degree 3
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Kernelization hardness of connectivity problems in d-degenerate graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
SIAM Journal on Computing
An Extension of the Nemhauser-Trotter Theorem to Generalized Vertex Cover with Applications
SIAM Journal on Discrete Mathematics
A linear kernel for a planar connected dominating set
Theoretical Computer Science
3-Hitting set on bounded degree hypergraphs: upper and lower bounds on the kernel size
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
A generalization of Nemhauser and Trotter's local optimization theorem
Journal of Computer and System Sciences
Discrete Applied Mathematics
A kernel of order 2k-clogk for vertex cover
Information Processing Letters
Journal of Combinatorial Optimization
Enumerate and expand: improved algorithms for connected vertex cover and tree cover
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Kernelization as heuristic structure for the vertex cover problem
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
W-hardness under linear FPT-reductions: structural properties and further applications
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Lower bounds and parameterized approach for longest common subsequence
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Enumerate and expand: new runtime bounds for vertex cover variants
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Computing optimal solutions for the MIN 3-SET COVERING problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On product covering in supply chain models: natural complete problems for W[3] and W[4]
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Parameterized algorithms for HITTING SET: the weighted case
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Improved parameterized upper bounds for vertex cover
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Parametric duality and kernelization: lower bounds and upper bounds on kernel size
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Maximum independent set in graphs of average degree at most three in O(1.08537n)
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Parameterized complexity of generalized vertex cover problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Vertex cover approximations: experiments and observations
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Some new directions and questions in parameterized complexity
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Linear kernels in linear time, or how to save k colors in O(n2) steps
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Fixed-parameter approximation: conceptual framework and approximability results
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
On the effective enumerability of NP problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Random separation: a new method for solving fixed-cardinality optimization problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Extension of the nemhauser and trotter theorem to generalized vertex cover with applications
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Algorithmic graph minor theory: improved grid minor bounds and wagner's contraction
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Exact algorithms for finding the minimum independent dominating set in graphs
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Intuitive algorithms and t-vertex cover
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Safe approximation and its relation to kernelization
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Discrete Optimization
Kernelization --- preprocessing with a guarantee
The Multivariate Algorithmic Revolution and Beyond
Parameterized complexity and subexponential-time computability
The Multivariate Algorithmic Revolution and Beyond
Constraint satisfaction problems parameterized above or below tight bounds: a survey
The Multivariate Algorithmic Revolution and Beyond
The Multivariate Algorithmic Revolution and Beyond
Kernel(s) for problems with no kernel: On out-trees with many leaves
ACM Transactions on Algorithms (TALG)
Kernelization hardness of connectivity problems in d-degenerate graphs
Discrete Applied Mathematics
Linear problem kernels for NP-hard problems on planar graphs
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Kernelization algorithms for d-hitting set problems
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
A linear vertex kernel for maximum internal spanning tree
Journal of Computer and System Sciences
European Journal of Combinatorics
Efficient algorithms for the max k-vertex cover problem
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Parameterized top-K algorithms
Theoretical Computer Science
Note: Towards optimal kernel for connected vertex cover in planar graphs
Discrete Applied Mathematics
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
A novel parameterised approximation algorithm for minimum vertex cover
Theoretical Computer Science
A note on the complexity of minimum dominating set
Journal of Discrete Algorithms
| Hi-index | 0.01 |