Image de couverture de livre

On the Parameterized Complexity of Diverse SAT

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Misra, Neeldhara, Mittal, Harshil, Rai, Ashutosh
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms F.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs
par: Misra, Neeldhara, et autres
Publié: (2022)

Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction
par: Krithika, R., et autres
Publié: (2023)

Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for $Δ$-Coloring
par: Assadi, Sepehr, et autres
Publié: (2022)

Tight Bounds for some W[1]-hard Problems Parameterized by Multi-clique-width
par: Bergougnoux, Benjamin, et autres
Publié: (2026)

Permutation Match Puzzles: How Young Tanvi Learned About Computational Complexity
par: Gajjar, Kshitij, et autres
Publié: (2026)

Set Parameterized Matching via Multi-Layer Hashing
par: Lewenstein, Moshe, et autres
Publié: (2026)

Finding Diverse Solutions Parameterized by Cliquewidth
par: Drabik, Karolina, et autres
Publié: (2024)

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
par: Randolph, Tim, et autres
Publié: (2024)

Structural Parameterization of Steiner Tree Packing
par: Hastrich, Niko, et autres
Publié: (2025)

Fine-Grained Complexity of Multiple Domination and Dominating Patterns in Sparse Graphs
par: Künnemann, Marvin, et autres
Publié: (2024)

SARRIGUREN: a polynomial-time complete algorithm for random $k$-SAT with relatively dense clauses
par: Sarriguren, Alfredo Goñi
Publié: (2024)

Towards a Parameterized Approximation Dichotomy of MinCSP for Linear Equations over Finite Commutative Rings
par: Dabrowski, Konrad K., et autres
Publié: (2024)

Tight Bounds for some Classical Problems Parameterized by Cutwidth
par: Bojikian, Narek, et autres
Publié: (2025)

Tight Bounds for Feedback Vertex Set Parameterized by Clique-width
par: Bojikian, Narek, et autres
Publié: (2025)

On the I/O Complexity of the CYK Algorithm and of a Family of Related DP Algorithms
par: De Stefani, Lorenzo, et autres
Publié: (2024)

Tight Algorithm for Connected Odd Cycle Transversal Parameterized by Clique-width
par: Bojikian, Narek, et autres
Publié: (2024)

Planar Network Diversion
par: Bentert, Matthias, et autres
Publié: (2025)

A Little Aggression Goes a Long Way
par: Krishnan, Jyothi, et autres
Publié: (2024)

Complexity of Finding and Enumerating Interconnection Trees
par: Demange, Noé, et autres
Publié: (2026)

What Can Be Computed Locally Revisited: First-Order Logic on Sparse Graphs in Distributed Computing
par: Blin, Lélia, et autres
Publié: (2024)

On HTLC-Based Protocols for Multi-Party Cross-Chain Swaps
par: Clark, Emily, et autres
Publié: (2024)

A Linear-Time 1.5-Approximation for Broadcasting in k-Cycle Graphs
par: Bringolf, Jeffrey, et autres
Publié: (2025)

Constant time enumeration of perfect bipartite matchings
par: Fink, Jiří
Publié: (2025)

Buffered Partially-Persistent External-Memory Search Trees
par: Brodal, Gerth Stølting, et autres
Publié: (2025)

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
par: Dvořák, Pavel, et autres
Publié: (2017)

Online $b$-Matching with Stochastic Rewards
par: Albers, Susanne, et autres
Publié: (2024)

Scheduling with Obligatory Tests
par: Dogeas, Konstantinos, et autres
Publié: (2024)

Approximate Minimum Sum Colorings and Maximum $k$-Colorable Subgraphs of Chordal Graphs
par: DeHaan, Ian, et autres
Publié: (2024)

Revisiting Path Contraction and Cycle Contraction
par: Krithika, R., et autres
Publié: (2024)

Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams
par: Chakrabarti, Amit, et autres
Publié: (2024)

A faster algorithm for the construction of optimal factoring automata
par: Erlebach, Thomas, et autres
Publié: (2024)

Online Combinatorial Optimization with Graphical Dependencies
par: Gao, Zhimeng, et autres
Publié: (2025)

Offline green bin packing and its constrained variant
par: Gong, Mingyang, et autres
Publié: (2026)

Exploiting Low Scanwidth to Resolve Soft Polytomies
par: Bruchhold, Sebastian, et autres
Publié: (2025)

A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neighbour Oracle Model
par: Awofeso, Christine, et autres
Publié: (2025)

Online computation of normalized substring complexity
par: Kucherov, Gregory, et autres
Publié: (2025)

Approximation algorithms for scheduling with rejection in green manufacturing
par: Gong, Mingyang, et autres
Publié: (2025)

The cost of cyclic permutations and remainder sums in the Euclidean algorithm
par: Blomer, Valentin, et autres
Publié: (2026)

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
par: Mosenzon, Ron
Publié: (2025)

A Faster Directed Single-Source Shortest Path Algorithm
par: Duan, Ran, et autres
Publié: (2026)