A survey of graph layout problems
ACM Computing Surveys (CSUR)
An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Subexponential Parameterized Algorithms Collapse the W-Hierarchy
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Upper Bounds for MaxSat: Further Improved
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
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
Improved Exact Algorithms for MAX-SAT
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
A Characterization of Graphs with Vertex Cover Six
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Some Prospects for Efficient Fixed Parameter Algorithms
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Vertex Cover: Further Observations and Further Improvements
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in 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
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
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
Solving large FPT problems on coarse-grained parallel machines
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
An efficient parameterized algorithm for m-set packing
Journal of Algorithms
Refined memorization for vertex cover
Information Processing Letters
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
Discrete Applied Mathematics
Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
On parameterized exponential time complexity
Theoretical Computer Science
Additive pattern database heuristics
Journal of Artificial Intelligence Research
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
Discrete Applied Mathematics
Refined memorization for vertex cover
Information Processing Letters
Upper bounds for vertex cover further improved
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Improved upper bounds for vertex cover
Theoretical Computer Science
Algorithms and theory of computation handbook
Hitting and harvesting pumpkins
ESA'11 Proceedings of the 19th European conference on Algorithms
RCG'05 Proceedings of the 2005 international conference on Comparative Genomics
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
Enumerate and expand: new runtime bounds for vertex cover variants
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Improved parameterized upper bounds for vertex cover
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
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
Intuitive algorithms and t-vertex cover
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
The impact of parameterized complexity to interdisciplinary problem solving
The Multivariate Algorithmic Revolution and Beyond
Vertex cover, dominating set and my encounters with parameterized complexity and mike fellows
The Multivariate Algorithmic Revolution and Beyond
Detecting and exploiting subproblem tractability
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
A note on the complexity of minimum dominating set
Journal of Discrete Algorithms
| Hi-index | 0.89 |