I agree that this site is using cookies. You can find further informations
here
.
X
Login
My folder (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
Show Desktop-Version
Toggle navigation
Martin, Barnaby
90
results:
Articles (Online) X
Search for persons
X
Sorted by: Relevance
Sorted by: Year
?
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
Link:
https://doi.org/10.1137/..
?
2
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/..
?
3
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/..
?
4
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/..
?
5
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/..
?
6
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/..
?
7
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/..
?
8
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/..
?
9
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/..
?
10
Partitioning H-free graphs of bounded diameter:
Brause, Christoph
;
Golovach, Petr
;
Martin, Barnaby
..
Theoretical Computer Science. 930 (2022) - p. 37-52 , 2022
Link:
https://doi.org/10.1016/..
?
11
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..
?
12
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/..
?
13
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/..
?
14
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/..
?
15
Disconnected cuts in claw-free graphs:
Martin, Barnaby
;
Paulusma, Daniël
;
van Leeuwen, Erik Jan
Journal of Computer and System Sciences. 113 (2020) - p. 60-75 , 2020
Link:
https://doi.org/10.1016/..
1-15