:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Meybodi, Mohsen Alambardar, Poureidi, Abolfazl
Formato:	Preprint
Publicado:	2024
Materias:	Computational Complexity Data Structures and Algorithms Combinatorics
Acceso en línea:	https://arxiv.org/abs/2403.04694
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Complexity of Paired Domination Problems on Circle and $k$-Polygon Graphs
por: Mu, Ta-Yu, et al.
Publicado: (2024)

The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs
por: Beisegel, Jesse, et al.
Publicado: (2024)

Distance Vector Domination
por: Cordasco, Gennaro, et al.
Publicado: (2024)

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

Equivalent Dichotomies for Triangle Detection in Subgraph, Induced, and Colored H-Free Graphs
por: Abboud, Amir, et al.
Publicado: (2026)

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)

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

Parameterized Shortest Path Reconfiguration
por: Bousquet, Nicolas, et al.
Publicado: (2024)

Forest Covers and Bounded Forest Covers
por: Gaur, Daya Ram, et al.
Publicado: (2024)

Constant congestion linkages in polynomially strong digraphs in polynomial time
por: Lopes, Raul, et al.
Publicado: (2024)

Fourier Analysis of Iterative Algorithms
por: Jones, Chris, et al.
Publicado: (2024)

Kernelization Complexity of Solution Discovery Problems
por: Grobler, Mario, et al.
Publicado: (2024)

Computing the $D$-base and $D$-relation in finite closure systems
por: Adaricheva, Kira, et al.
Publicado: (2024)

Testing Sumsets is Hard
por: Chen, Xi, et al.
Publicado: (2024)

Smoothed analysis for graph isomorphism
por: Anastos, Michael, et al.
Publicado: (2024)

Characterizing and Testing Principal Minor Equivalence of Matrices
por: Chatterjee, Abhranil, et al.
Publicado: (2024)

Asymptotically Optimal Hardness for $k$-Set Packing and $k$-Matroid Intersection
por: Lee, Euiwoong, et al.
Publicado: (2024)

Computational Complexity of Swish
por: Horiyama, Takashi, et al.
Publicado: (2026)

Trickle-down Theorems via C-Lorentzian Polynomials II: Pairwise Spectral Influence and Improved Dobrushin's Condition
por: Leake, Jonathan, et al.
Publicado: (2025)

Faster Algorithms for Sparse ILP and Hypergraph Multi-Packing/Multi-Cover Problems
por: Gribanov, Dmitry, et al.
Publicado: (2022)

A General Framework for Low Soundness Homomorphism Testing
por: Mittal, Tushant, et al.
Publicado: (2025)

Hypergraph Samplers: Typical and Worst Case Behavior
por: Alev, Vedat Levi, et al.
Publicado: (2026)

Optimal Trickle-Down Theorems for Path Complexes via C-Lorentzian Polynomials with Applications to Sampling and Log-Concave Sequences
por: Leake, Jonathan, et al.
Publicado: (2025)

Vector TSP: A Traveling Salesperson Problem with Racetrack-like Acceleration Constraints
por: Casteigts, Arnaud, et al.
Publicado: (2020)

On the complexity of global Roman domination problem in graphs
por: Reddy, Sangam Balchandar, et al.
Publicado: (2026)

On Detecting $H$-Induced Minors for Small $H$
por: Eagling-Vose, Tala, et al.
Publicado: (2026)

A Refined Laser Method and Faster Matrix Multiplication
por: Alman, Josh, et al.
Publicado: (2020)

A Fast Coloring Oracle for Average Case Hypergraphs
por: Marcussen, Cassandra, et al.
Publicado: (2025)

Deciding if a DAG is Interesting is Hard
por: De Carufel, Jean-Lou, et al.
Publicado: (2025)

NP-Completeness of Deterministic Communication Complexity via Relaxed Interlacing
por: Gaspers, Serge, et al.
Publicado: (2025)

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

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)

Graph Classes Closed under Self-intersection
por: Dabrowski, Konrad K., 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)

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

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)