E-LIB Suche - Ergebnisse für: Paulusma, Daniël

1

Dichotomies for Maximum Matching Cut: $H$-Freeness, Bounded..:

Lucke, Felicia ; Paulusma, Daniël ; Ries, Bernard
http://arxiv.org/abs/2304.01099. , 2023

Link: http://arxiv.org/abs/230..

2

Computing Subset Vertex Covers in H-Free Graphs:

Brettell, Nick ; Oostveen, Jelle ; Pandey, Sukanya..
https://dspace.library.uu.nl/handle/1874/431577. , 2023

Link: https://dspace.library.u..

3

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..

4

Few induced disjoint paths for H-free graphs:

Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani.
0304-3975. , 2023

Link: https://dspace.library.u..

5

Comparing Width Parameters on Graph Classes:

Brettell, Nick ; Munaro, Andrea ; Paulusma, Daniël.
http://arxiv.org/abs/2308.05817. , 2023

Link: http://arxiv.org/abs/230..

6

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..

7

Maximizing Matching Cuts:

Le, Van Bang ; Lucke, Felicia ; Paulusma, Daniël.
http://arxiv.org/abs/2312.12960. , 2023

Link: http://arxiv.org/abs/231..

8

Computing Subset Vertex Covers in $H$-Free Graphs:

Brettell, Nick ; Oostveen, Jelle J ; Pandey, Sukanya..
http://arxiv.org/abs/2307.05701. , 2023

Link: http://arxiv.org/abs/230..

9

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..

10

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..

11

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

Johnson, Matthew ; Martin, Barnaby ; Pandey, Sukanya...
1868-8969. , 2023

Link: https://dspace.library.u..

12

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..

13

Partitioned Matching Games for International Kidney Exchang:

Benedek, Márton ; Biró, Péter ; Kern, Walter..
http://arxiv.org/abs/2301.13181. , 2023

Link: http://arxiv.org/abs/230..

14

The Complexity of Matching Games : A Survey:

Benedek, Márton ; Biró, Péter ; Johnson, Matthew..
http://real.mtak.hu/167919/1/14281wPgs.pdf. , 2023

Link: http://real.mtak.hu/1679..

15

Matching Cuts in Graphs of High Girth and H-Free Graphs:

Feghali, Carl ; Lucke, Felicia ; Paulusma, Daniël.
Is Part Of LIPIcs, Volume 283, 34th International Symposium on Algorithms and Computation (ISAAC 2023). , 2023

Link: https://doi.org/10.4230/..