On the Structural Parameterizations of 2-Club with Triangle Constraints
Fuente:
arXiv
Saved in:
| Main Authors: | Jacob, Ashwin, Majumdar, Diptapriyo, Sakhuja, Raghav |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees
by: Jacob, Ashwin, et al.
Published: (2026)
by: Jacob, Ashwin, et al.
Published: (2026)
A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
by: Jacob, Ashwin, et al.
Published: (2024)
by: Jacob, Ashwin, et al.
Published: (2024)
On the Polynomial Kernelizations of Finding a Shortest Path with Positive Disjunctive Constraints
by: Bandopadhyay, Susobhan, et al.
Published: (2023)
by: Bandopadhyay, Susobhan, et al.
Published: (2023)
On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints
by: Bandopadhyay, Susobhan, et al.
Published: (2026)
by: Bandopadhyay, Susobhan, et al.
Published: (2026)
Polynomial Kernels for Spanning Tree with Diversity Requirements
by: Golovach, Petr A., et al.
Published: (2026)
by: Golovach, Petr A., et al.
Published: (2026)
Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
by: Eiben, Eduard, et al.
Published: (2023)
by: Eiben, Eduard, et al.
Published: (2023)
Parameterized Complexity of s-Club Cluster Edge Deletion: When Is the Diameter Bound Necessary?
by: Gaikwad, Ajinkya
Published: (2025)
by: Gaikwad, Ajinkya
Published: (2025)
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover
by: Chakraborty, Dipayan, et al.
Published: (2024)
by: Chakraborty, Dipayan, et al.
Published: (2024)
Triangle-free 2-matchings
by: Paluch, Katarzyna
Published: (2023)
by: Paluch, Katarzyna
Published: (2023)
Triangle Detection in H-Free Graphs
by: Abboud, Amir, et al.
Published: (2025)
by: Abboud, Amir, et al.
Published: (2025)
Node-Weighted Triangles: Faster and Simpler
by: Akmal, Shyan, et al.
Published: (2026)
by: Akmal, Shyan, et al.
Published: (2026)
On the Parameterized Intractability of Determinant Maximization
by: Ohsaka, Naoto
Published: (2022)
by: Ohsaka, Naoto
Published: (2022)
Graph Coloring Below Guarantees via Co-Triangle Packing
by: Akmal, Shyan, et al.
Published: (2025)
by: Akmal, Shyan, et al.
Published: (2025)
Treewidth Parameterized by Feedback Vertex Number
by: Molter, Hendrik, et al.
Published: (2025)
by: Molter, Hendrik, et al.
Published: (2025)
Parameterized Complexity of Path Set Packing
by: Aravind, N. R., et al.
Published: (2022)
by: Aravind, N. R., et al.
Published: (2022)
A Parameterized Perspective on Uniquely Restricted Matchings
by: Chaudhary, Juhi, et al.
Published: (2025)
by: Chaudhary, Juhi, et al.
Published: (2025)
Parameterized Complexity of Submodular Minimization under Uncertainty
by: Kakimura, Naonori, et al.
Published: (2024)
by: Kakimura, Naonori, et al.
Published: (2024)
Parameterized Saga of First-Fit and Last-Fit Coloring
by: Agrawal, Akanksha, et al.
Published: (2024)
by: Agrawal, Akanksha, et al.
Published: (2024)
On the Number of Non-equivalent Parameterized Squares in a String
by: Hamai, Rikuya, et al.
Published: (2024)
by: Hamai, Rikuya, et al.
Published: (2024)
Parameterized Algorithms for Balanced Cluster Edge Modification Problems
by: Madathil, Jayakrishnan, et al.
Published: (2024)
by: Madathil, Jayakrishnan, et al.
Published: (2024)
The Parameterized Complexity Landscape of Two-Sets Cut-Uncut
by: Bentert, Matthias, et al.
Published: (2024)
by: Bentert, Matthias, et al.
Published: (2024)
A Finer View of the Parameterized Landscape of Labeled Graph Contractions
by: Mathur, Yashaswini, et al.
Published: (2025)
by: Mathur, Yashaswini, et al.
Published: (2025)
Subexponential and Parameterized Mixing Times of Glauber Dynamics on Independent Sets
by: Marin, Malory
Published: (2025)
by: Marin, Malory
Published: (2025)
Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
by: Komusiewicz, Christian, et al.
Published: (2026)
by: Komusiewicz, Christian, et al.
Published: (2026)
Isomorphism Testing Parameterized by Genus and Beyond
by: Neuen, Daniel
Published: (2021)
by: Neuen, Daniel
Published: (2021)
Stability in Graphs with Matroid Constraints
by: Fomin, Fedor V., et al.
Published: (2024)
by: Fomin, Fedor V., et al.
Published: (2024)
Parameterized complexity of isometric path partition: treewidth and diameter
by: Chakraborty, Dibyayan, et al.
Published: (2025)
by: Chakraborty, Dibyayan, et al.
Published: (2025)
Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
by: Deligkas, Argyrios, et al.
Published: (2025)
by: Deligkas, Argyrios, et al.
Published: (2025)
Maximizing a Submodular Function with Bounded Curvature under an Unknown Knapsack Constraint
by: Klimm, Max, et al.
Published: (2022)
by: Klimm, Max, et al.
Published: (2022)
Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness
by: Antony, Dhanyamol, et al.
Published: (2023)
by: Antony, Dhanyamol, et al.
Published: (2023)
Minimum Sum Set Cover: Structures and Algorithm
by: Zhang, Zhongyi, et al.
Published: (2026)
by: Zhang, Zhongyi, et al.
Published: (2026)
Parameterized Complexity of Streaming Diameter and Connectivity Problems
by: Oostveen, Jelle J., et al.
Published: (2022)
by: Oostveen, Jelle J., et al.
Published: (2022)
The Parameterized Complexity of Vertex-Coloring Edge-Weighting
by: Aute, Shubhada, et al.
Published: (2026)
by: Aute, Shubhada, et al.
Published: (2026)
Cuts in Graphs with Matroid Constraints
by: Banik, Aritra, et al.
Published: (2024)
by: Banik, Aritra, et al.
Published: (2024)
Vital Edges for (s,t)-mincut: Efficient Algorithms, Compact Structures, and Optimal Sensitivity Oracle
by: Baswana, Surender, et al.
Published: (2023)
by: Baswana, Surender, et al.
Published: (2023)
Finding Minimum Distance Preservers: A Parameterized Study
by: Simonov, Kirill, et al.
Published: (2026)
by: Simonov, Kirill, et al.
Published: (2026)
Metric Dimension and Geodetic Set Parameterized by Vertex Cover
by: Foucaud, Florent, et al.
Published: (2024)
by: Foucaud, Florent, et al.
Published: (2024)
Proceedings of the 13th edition of the conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings
by: Brlek, Srečko, et al.
Published: (2024)
by: Brlek, Srečko, et al.
Published: (2024)
Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity
by: Conrado, Giovanna K., et al.
Published: (2023)
by: Conrado, Giovanna K., et al.
Published: (2023)
Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound
by: Lill, Jonas, et al.
Published: (2024)
by: Lill, Jonas, et al.
Published: (2024)
Similar Items
-
A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees
by: Jacob, Ashwin, et al.
Published: (2026) -
A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
by: Jacob, Ashwin, et al.
Published: (2024) -
On the Polynomial Kernelizations of Finding a Shortest Path with Positive Disjunctive Constraints
by: Bandopadhyay, Susobhan, et al.
Published: (2023) -
On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints
by: Bandopadhyay, Susobhan, et al.
Published: (2026) -
Polynomial Kernels for Spanning Tree with Diversity Requirements
by: Golovach, Petr A., et al.
Published: (2026)