Path hitting in acyclic graphs
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Approximability of the capacitated b-edge dominating set problem
Theoretical Computer Science
Approximation algorithms for partially covering with edges
Theoretical Computer Science
Improved approximation bounds for edge dominating set in dense graphs
Theoretical Computer Science
A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem
Approximation and Online Algorithms
Minimum maximal matching is NP-hard in regular bipartite graphs
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Distributed algorithms for edge dominating sets
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The prize-collecting edge dominating set problem in trees
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem
Information Processing Letters
New parameterized algorithms for the edge dominating set problem
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Energy efficient joint data aggregation and link scheduling in solar sensor networks
Computer Communications
Approximating edge dominating set in dense graphs
Theoretical Computer Science
Approximation algorithms for the b-edge dominating set problem and its related problems
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
How to trim an MST: a 2-approximation algorithm for minimum cost tree cover
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Linear time algorithms for generalized edge dominating set problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
How to trim a MST: A 2-Approximation algorithm for minimum cost-tree cover
ACM Transactions on Algorithms (TALG)
EDGE DOMINATING SET: efficient enumeration-based exact algorithms
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Improved approximation bounds for edge dominating set in dense graphs
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Kernelization for maximum leaf spanning tree with positive vertex weights
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
A primal-dual method for approximating tree cover with two weights
Discrete Optimization
Generalizing the induced matching by edge capacity constraints
Discrete Optimization
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
ACM Computing Surveys (CSUR)
New parameterized algorithms for the edge dominating set problem
Theoretical Computer Science
Hi-index | 0.05 |