Vertex Cover Parameterization is a parameterized problem formulation in which the solution seeks a vertex cover of size at most k in a graph, parameterized by the solution size k, thereby enabling fixed-parameter tractable algorithms that exploit this parameter to achieve efficient computation.
34
Publications
1.7K
Citations
71
Authors
42
Institutions
Publications per year
2017–2026
8
Parents
Publications
34
On multiway cut parameterized above lower bounds
Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk et al. · ACM Transactions on Computation Theory · 2013 · 92 citations
1–5 of 34
Authors
71
- RN
3
h-index
- MR
3
h-index
- ZZ
3
h-index
- PZ
2
h-index
- TF
2
h-index
1–5 of 71
Institutions
42
Institute of Mathematical Sciences
Chennai, India
3 h-index
6 publications
453 citations
Xinjiang University
Ürümqi, China
3 h-index
4 publications
120 citations
Chennai Mathematical Institute
Chennai, India
2 h-index
2 publications
33 citations
Texas A&M University
College Station, United States
2 h-index
2 publications
479 citations
DePaul University
Chicago, United States
2 h-index
2 publications
479 citations
University of Bergen
Bergen, Norway
2 h-index
3 publications
109 citations
Technische Universität Berlin
Berlin, Germany
2 h-index
8 publications
104 citations
Zhejiang Normal University
Jinhua, China
2 h-index
6 publications
78 citations
1–8 of 42
Venues
- Information Processing Letters
5 publications · 303 citations
5
h-index
- Theory of Computing Systems
3 publications · 86 citations
3
h-index
- Journal of Algorithms
2 publications · 552 citations
2
h-index
- ACM Transactions on Computation Theory
TOCT · 2 publications · 130 citations
2
h-index
- Theoretical Computer Science
2 publications · 36 citations
2
h-index
1–5