Image de couverture de livre

Dominic Welsh: his work and influence

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Farr, Graham, Mayhew, Dillon, Oxley, James
Format:	Preprint
Publié:	2024
Sujets:	History and Overview Computational Complexity Combinatorics 01A70 (Primary) 05-03, 05B35, 05C31, 60K35, 68Q17, 68Q25 (Secondary) F.2.2; G.2.1; G.2.2; K.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Graph polynomials: some questions on the edge
par: Farr, Graham, et autres
Publié: (2024)

DAG Scheduling in the BSP Model
par: Papp, Pál András, et autres
Publié: (2023)

The Gallai Vertex Problem is $Θ_2^p$-Complete
par: Nikabadi, Amir, et autres
Publié: (2026)

Minor Embedding in Broken Chimera and Pegasus Graphs is NP-complete
par: Lobe, Elisabeth, et autres
Publié: (2021)

Continuous Flattening and Reversing of Convex Polyhedral Linkages
par: Demaine, Erik D., et autres
Publié: (2024)

XALP-completeness of Parameterized Problems on Planar Graphs
par: Bodlaender, Hans L., et autres
Publié: (2024)

On (In)approximability of MaxMin Independent Set Reconfiguration
par: Hoang, Hung P., et autres
Publié: (2026)

Artifical intelligence and inherent mathematical difficulty
par: Dean, Walter, et autres
Publié: (2024)

ETH-Tight Complexity of Optimal Morse Matching on Bounded-Treewidth Complexes
par: Philip, Geevarghese, et autres
Publié: (2026)

Folding One Polyhedral Metric Graph into Another
par: Chung, Lily, et autres
Publié: (2024)

Algorithmic Barriers to Detecting and Repairing Structural Overspecification in Adaptive Data-Structure Selection
par: Alpay, Faruk, et autres
Publié: (2026)

Computing shortest closed curves on non-orientable surfaces
par: Bulavka, Denys, et autres
Publié: (2024)

Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
par: Chen, Yijia, et autres
Publié: (2023)

Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
par: Golovach, Petr A., et autres
Publié: (2022)

On the twin-width of near-regular graphs
par: Heinrich, Irene, et autres
Publié: (2025)

Logarithmic Weisfeiler--Leman and Treewidth
par: Levet, Michael, et autres
Publié: (2023)

Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler--Leman
par: Levet, Michael, et autres
Publié: (2023)

Nearly Tight Lower Bounds for Relaxed Locally Decodable Codes via Robust Daisies
par: Goldberg, Guy, et autres
Publié: (2025)

How quickly can you pack short paths? Engineering a search-tree algorithm for disjoint s-t paths of bounded length
par: Huber, Michael Kiran
Publié: (2024)

Mathematical Foundations for Peer-to-Peer Lattice Computation
par: Gorinevski, Danil
Publié: (2026)

A New Temporal Interpretation of Cluster Editing
par: Bocci, Cristiano, et autres
Publié: (2022)

ARRIVAL: Recursive Framework & $\ell_1$-Contraction
par: Haslebacher, Sebastian
Publié: (2025)

IECZ-III: Hardcore Condensation Lift with Size-Aware Invariants
par: Lela, Marko
Publié: (2025)

TreeWidzard: An Engine for Width-Based Dynamic Programming and Automated Theorem Proving
par: Oliveria, Mateus de Oliveira, et autres
Publié: (2026)

Pliability and Approximating Max-CSPs
par: Romero, Miguel, et autres
Publié: (2019)

Graphs whose vertices of degree at least 2 lie in a triangle
par: Forte, Vinicius L. do, et autres
Publié: (2022)

Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity
par: Liao, Chao, et autres
Publié: (2022)

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
par: Bannach, Max, et autres
Publié: (2025)

On the Average-Case Performance of Greedy for Maximum Coverage
par: Balkanski, Eric, et autres
Publié: (2026)

On the MST-ratio: Theoretical Bounds and Complexity of Finding the Maximum
par: Ameli, Afrouz Jabal, et autres
Publié: (2024)

The partial gossip problem revisited
par: Kokhas, Konstantin, et autres
Publié: (2026)

Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree
par: Komusiewicz, Christian, et autres
Publié: (2023)

On Small-depth Frege Proofs for PHP
par: Håstad, Johan
Publié: (2024)

How do humans succeed in tasks like proving Fermat's Theorem or predicting the Higgs boson?
par: Levin, Leonid A.
Publié: (2022)

NP-Completeness Proofs of All or Nothing, Water Walk, and Remembered Length Using the T-Metacell Framework
par: Eua-anant, Pakapim, et autres
Publié: (2025)

Recognizing Penny and Marble Graphs is Hard for Existential Theory of the Reals
par: Lubiw, Anna, et autres
Publié: (2025)

A Constant-factor Approximation for Weighted Bond Cover
par: Kim, Eun Jung, et autres
Publié: (2021)

Fully Dynamic Breadth First Search and Spanning Trees in Directed Graphs
par: Morse, Gregory, et autres
Publié: (2026)

Slavic Techniques for Hat Guessing Algorithms
par: McInnis, I. M. J.
Publié: (2025)

Topological Indices Among Strong Support Vertex
par: Hamoud, Jasem, et autres
Publié: (2025)