Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Martin, Barnaby
244  Ergebnisse:
OpenAccess-Volltexte X
Personensuche X
?
1

Complexity Framework for Forbidden Subgraphs {III:}: When P..:

Johnson, Matthew ; Martin, Barnaby ; Pandey, Sukanya...
https://dspace.library.uu.nl/handle/1874/431613.  , 2023
Link: https://dspace.library.u..
 
?
2

Few induced disjoint paths for H-free graphs:

Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani.
0304-3975.  , 2023
Link: https://dspace.library.u..
 
?
3

Complexity Framework for Forbidden Subgraphs III: When Prob..:

Johnson, Matthew ; Martin, Barnaby ; Pandey, Sukanya...
http://arxiv.org/abs/2305.01104.  , 2023
Link: http://arxiv.org/abs/230..
 
?
4

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

Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani.
Martin , B , Paulusma , D , Smith , S & van Leeuwen , E J 2023 , ' Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs ' , Algorithmica , vol. 85 , no. 9 , pp. 2580-2604 . https://doi.org/10.1007/s00453-023-01109-z.  , 2023
Link: https://hdl.handle.net/1..
 
?
5

Few induced disjoint paths for H-free graphs:

Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani.
Martin , B , Paulusma , D , Smith , S & van Leeuwen , E J 2023 , ' Few induced disjoint paths for H-free graphs ' , Theoretical Computer Science , vol. 939 , pp. 182-193 . https://doi.org/10.1016/j.tcs.2022.10.024.  , 2023
Link: https://hdl.handle.net/1..
 
?
6

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

Bodlaender, Hans L ; Johnson, Matthew ; Martin, Barnaby...
http://arxiv.org/abs/2305.01613.  , 2023
Link: http://arxiv.org/abs/230..
 
?
7

Complexity Framework for Forbidden Subgraphs {III:}: When P..:

Johnson, Matthew ; Martin, Barnaby ; Pandey, Sukanya...
1868-8969.  , 2023
Link: https://dspace.library.u..
 
?
8

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

Bodlaender, Hans L ; Johnson, Matthew ; Martin, Barnaby...
https://dspace.library.uu.nl/handle/1874/431612.  , 2023
Link: https://dspace.library.u..
 
?
9

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

Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani.
dro:38332.  , 2023
Link: http://dro.dur.ac.uk/383..
 
?
10

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

Brause, Christoph ; Golovach, Petr ; Martin, Barnaby...
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v29i2p43/pdf.  , 2022
Link: https://www.combinatoric..
 
?
11

Complexity Framework for Forbidden Subgraphs II: When Hardn..:

Martin, Barnaby ; Pandey, Sukanya ; Paulusma, Daniel...
http://arxiv.org/abs/2211.14214.  , 2022
Link: http://arxiv.org/abs/221..
 
?
12

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

Brause, Christoph ; Golovach, Petr ; Martin, Barnaby...
info:eu-repo/semantics/altIdentifier/arxiv/2104.10593.  , 2022
Link: https://hal-lirmm.ccsd.c..
 
?
13

Depth Lower Bounds in Stabbing Planes for Combinatorial Pri..:

Dantchev, Stefan ; Galesi, Nicola ; Ghani, Abdul.
doi:10.4230/LIPIcs.STACS.2022.24.  , 2022
Link: https://doi.org/10.4230/..
 
?
14

Few Induced Disjoint Paths for $H$-Free Graphs:

Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani.
http://arxiv.org/abs/2203.03319.  , 2022
Link: http://arxiv.org/abs/220..
 
?
15

Edge Multiway Cut and Node Multiway Cut are NP-complete on ..:

Johnson, Matthew S ; Martin, Barnaby ; Smith, Siani...
https://dspace.library.uu.nl/handle/1874/426435.  , 2022
Link: https://dspace.library.u..
 
1-15