E-LIB Suche - Ergebnisse für: Martin, Barnaby

1

Proof Complexity and the Binary Encoding of Combinatorial P..:

Dantchev, Stefan ; Galesi, Nicola ; Ghani, Abdul.
SIAM Journal on Computing. 53 (2024) 3 - p. 764-802 , 2024

2

The Complexity of Quantified Constraints: Collapsibility, S..:

Carvalho, Catarina ; Madelaine, Florent ; Martin, Barnaby.
ACM Transactions on Computational Logic. 24 (2023) 1 - p. 1-26 , 2023

Link: https://doi.org/10.1145/..

3

Induced Disjoint Paths and Connected Subgraphs for H-Free G..:

Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani.
Algorithmica. 85 (2023) 9 - p. 2580-2604 , 2023

Link: https://doi.org/10.1007/..

4

Few induced disjoint paths for H-free graphs:

Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani.
Theoretical Computer Science. 939 (2023) - p. 182-193 , 2023

Link: https://doi.org/10.1016/..

5

The Complexity of L(p, q)-Edge-Labelling:

Berthe, Gaétan ; Martin, Barnaby ; Paulusma, Daniël.
Algorithmica. 85 (2023) 11 - p. 3406-3429 , 2023

Link: https://doi.org/10.1007/..

6

When bounds consistency implies domain consistency for regu..:

Martin, Barnaby ; Pearson, Justin
Constraints. 27 (2022) 3 - p. 161-167 , 2022

Link: https://doi.org/10.1007/..

7

QCSP on Reflexive Tournaments:

Larose, Benoît ; Martin, Barnaby ; Marković, Petar...
ACM Transactions on Computational Logic (TOCL). 23 (2022) 3 - p. 1-22 , 2022

Link: https://dl.acm.org/doi/1..

8

Induced Disjoint Paths and Connected Subgraphs for H-Free G..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani. - p. 398-411 , 2022

Link: https://doi.org/10.1007/..

9

Colouring graphs of bounded diameter in the absence of smal..:

Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani
Discrete Applied Mathematics. 314 (2022) - p. 150-161 , 2022

Link: https://doi.org/10.1016/..

10

Few Induced Disjoint Paths for H-Free Graphs:

, In: Lecture Notes in Computer Science; Combinatorial Optimization,

Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani. - p. 89-101 , 2022

Link: https://doi.org/10.1007/..

11

Hard problems that quickly become very easy:

Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani
Information Processing Letters. 174 (2022) - p. 106213 , 2022

Link: https://doi.org/10.1016/..

12

Disjoint paths and connected subgraphs for H-free graphs:

Kern, Walter ; Martin, Barnaby ; Paulusma, Daniël..
Theoretical Computer Science. 898 (2022) - p. 59-68 , 2022

Link: https://doi.org/10.1016/..

13

QCSP Monsters and the Demise of the Chen Conjecture:

Zhuk, Dmitriy ; Martin, Barnaby
Journal of the ACM. 69 (2022) 5 - p. 1-44 , 2022

Link: https://doi.org/10.1145/..

14

QCSP on Reflexive Tournaments:

Larose, Benoît ; Martin, Barnaby ; Marković, Petar...
ACM Transactions on Computational Logic. 23 (2022) 3 - p. 1-22 , 2022

Link: https://doi.org/10.1145/..

15

Colouring generalized claw-free graphs and graphs of large ..:

Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani
Theoretical Computer Science. 931 (2022) - p. 104-116 , 2022

Link: https://doi.org/10.1016/..