Imagen de Portada

Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Conrado, Giovanna K., Goharshady, Amir K., Motwani, Harshit J., Novozhilov, Sergei
Formato:	Preprint
Publicado:	2023
Materias:	Data Structures and Algorithms Computational Complexity Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The Parameterized Complexity of Independent Set and More when Excluding a Half-Graph, Co-Matching, or Matching
por: Dreier, Jan, et al.
Publicado: (2026)

Parameterized Complexity of Streaming Diameter and Connectivity Problems
por: Oostveen, Jelle J., et al.
Publicado: (2022)

The Parameterized Complexity of Vertex-Coloring Edge-Weighting
por: Aute, Shubhada, et al.
Publicado: (2026)

(Independent) Roman Domination Parameterized by Distance to Cluster
por: Ashok, Pradeesha, et al.
Publicado: (2024)

Finding Minimum Distance Preservers: A Parameterized Study
por: Simonov, Kirill, et al.
Publicado: (2026)

Metric Dimension and Geodetic Set Parameterized by Vertex Cover
por: Foucaud, Florent, et al.
Publicado: (2024)

Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound
por: Lill, Jonas, et al.
Publicado: (2024)

Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover
por: Foucaud, Florent, et al.
Publicado: (2023)

On the Parameterized Complexity of Grundy Domination and Zero Forcing Problems
por: Scheffler, Robert
Publicado: (2025)

Parameterized Complexity of (d,r)-Domination via Modular Decomposition
por: Cordasco, Gennaro, et al.
Publicado: (2024)

Recognizing Sumsets is NP-Complete
por: Abboud, Amir, et al.
Publicado: (2024)

Refining the Complexity Landscape of Speed Scaling: Hardness and Algorithms
por: Antoniadis, Antonios, et al.
Publicado: (2025)

The Complexity of Transitively Orienting Temporal Graphs
por: Mertzios, George B., et al.
Publicado: (2021)

A Dichotomy for Maximum PCSPs on Graphs
por: Nakajima, Tamio-Vesa, et al.
Publicado: (2024)

Randomized Communication and Implicit Graph Representations
por: Harms, Nathaniel, et al.
Publicado: (2021)

On Stable Cutsets in General and Minimum Degree Constrained Graphs
por: Vroon, Mats, et al.
Publicado: (2025)

A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees
por: Shao, Shuai, et al.
Publicado: (2023)

Finding $d$-Cuts in Probe $H$-Free Graphs
por: Dabrowski, Konrad K., et al.
Publicado: (2025)

A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs
por: Hamm, Thekla, et al.
Publicado: (2026)

Graph Classes Closed under Self-intersection
por: Dabrowski, Konrad K., et al.
Publicado: (2025)

Microscopic Structure of Random 3-SAT: A Discrete Geometric Approach to Phase Transitions and Algorithmic Complexity
por: Zhan, Yongjian
Publicado: (2026)

U-Bubble Model for Mixed Unit Interval Graphs and its Applications: The MaxCut Problem Revisited
por: Kratochvíl, Jan, et al.
Publicado: (2020)

Solving NP-hard Problems on \textsc{GaTEx} Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets
por: Hellmuth, Marc, et al.
Publicado: (2023)

On the tractability and approximability of non-submodular cardinality-based $s$-$t$ cut problems in hypergraphs
por: Bengali, Vedangi, et al.
Publicado: (2024)

A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection
por: Abboud, Amir, et al.
Publicado: (2025)

Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs
por: Lucke, Felicia, et al.
Publicado: (2024)

Exact Algorithms for Edge Deletion to Cactus
por: Akhtar, Sheikh Shakil, et al.
Publicado: (2026)

Space Efficient Algorithms for Parameterised Problems
por: Akhtar, Sheikh Shakil, et al.
Publicado: (2025)

A Fixed-Parameter Algorithm for the Kneser Problem
por: Haviv, Ishay
Publicado: (2022)

Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification
por: Eagling-Vose, Tala, et al.
Publicado: (2025)

Algorithms and complexity for monitoring edge-geodetic sets in graphs
por: Foucaud, Florent, et al.
Publicado: (2024)

Graph Search Trees and the Intermezzo Problem
por: Beisegel, Jesse, et al.
Publicado: (2024)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles I: Treewidth, Pathwidth, and Grid Graphs
por: Beisegel, Jesse, et al.
Publicado: (2025)

Steiner Forest for $H$-Subgraph-Free Graphs
por: Eagling-Vose, Tala, et al.
Publicado: (2026)

Computing Subset Vertex Covers in $H$-Free Graphs
por: Brettell, Nick, et al.
Publicado: (2023)

Solving Problems on Generalized Convex Graphs via Mim-Width
por: Bonomo-Braberman, Flavia, et al.
Publicado: (2020)

Optimal b-Colourings and Fall Colourings in $H$-Free Graphs
por: Ahn, Jungho, et al.
Publicado: (2026)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths
por: Beisegel, Jesse, et al.
Publicado: (2025)

Parameterised distance to local irregularity
por: Fioravantes, Foivos, et al.
Publicado: (2023)

On Approximate Reconfigurability of Label Cover
por: Ohsaka, Naoto
Publicado: (2023)