Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Martin, Barnaby
14  Ergebnisse:
Buchkapitel (Online) X
Personensuche X
?
1

Complexity Framework for Forbidden Subgraphs IV: The Steine..:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,
Bodlaender, Hans L. ; Johnson, Matthew ; Martin, Barnaby... - p. 206-217 , 2024
Link: https://doi.org/10.1007/..
 
?
2

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/..
 
?
3

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/..
 
?
4

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

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,
Berthe, Gaétan ; Martin, Barnaby ; Paulusma, Daniël. - p. 175-186 , 2022
Link: https://doi.org/10.1007/..
 
?
5

Injective Colouring for H-Free Graphs:

, In: Computer Science – Theory and Applications; Lecture Notes in Computer Science,
Bok, Jan ; Jedličková, Nikola ; Martin, Barnaby.. - p. 18-30 , 2021
Link: https://doi.org/10.1007/..
 
?
6

Disjoint Paths and Connected Subgraphs for H-Free Graphs:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,
Kern, Walter ; Martin, Barnaby ; Paulusma, Daniël.. - p. 414-427 , 2021
Link: https://doi.org/10.1007/..
 
?
7

Colouring Graphs of Bounded Diameter in the Absence of Smal..:

, In: Lecture Notes in Computer Science; Algorithms and Complexity,
Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani - p. 367-380 , 2021
Link: https://doi.org/10.1007/..
 
?
8

Acyclic, Star, and Injective Colouring: Bounding the Diamet..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Brause, Christoph ; Golovach, Petr ; Martin, Barnaby.. - p. 336-348 , 2021
Link: https://doi.org/10.1007/..
 
?
9

Sherali-Adams and the Binary Encoding of Combinatorial Prin..:

, In: LATIN 2020: Theoretical Informatics; Lecture Notes in Computer Science,
Dantchev, Stefan ; Ghani, Abdul ; Martin, Barnaby - p. 336-347 , 2020
Link: https://doi.org/10.1007/..
 
?
10

QCSP monsters and the demise of the chen conjecture:

, In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing,
Zhuk, Dmitriy ; Martin, Barnaby - p. 91-104 , 2020
Link: https://dl.acm.org/doi/1..
 
?
11

Resolution and the binary encoding of combinatorial princip..:

, In: Proceedings of the 34th Computational Complexity Conference,
Dantchev, Stefan ; Galesi, Nicola ; Martin, Barnaby - p. 1-25 , 2019
Link: https://dl.acm.org/doi/1..
 
?
12

From Complexity to Algebra and Back : Digraph Classes, C..:

, In: Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS),
Carvalho, Catarina ; Madelaine, Florent ; Martin, Barnaby - p. 462-474 , 2015
Link: https://dl.acm.org/doi/1..
 
?
13

From Complexity to Algebra and Back: Digraph Classes, Colla..:

, In: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science,
Carvalho, Catarina ; Madelaine, Florent ; Martin, Barnaby - p. 462-474 , 2015
Link: https://doi.org/10.1109/..
 
?
14

Contributors:

, In: Personalized Psychiatry,
Abbott, Ryan ; Ahmed, Ahmed T. ; Alda, Martin... - p. xvii-xxiii , 2019
Link: https://doi.org/10.1016/..
 
1-14