I agree that this site is using cookies. You can find further informations here.
X
Jaffke, Lars
94  results:
OpenAccess-fulltext X
Search for persons X
?
1

Structural Parameterizations of b-Coloring:

Jaffke, Lars ; Thomé de Lima, Paloma ; Sharma, Roohani
https://pure.itu.dk/portal/da/publications/2daa7a8f-4aec-41bc-b9bc-016428e0a08c.  , 2023
Link: https://pure.itu.dk/port..
 
?
2

Treewidth Is NP-Complete on Cubic Graphs:

Bodlaender, Hans L ; Bonnet, Édouard ; Jaffke, Lars...
Is Part Of LIPIcs, Volume 285, 18th International Symposium on Parameterized and Exact Computation (IPEC 2023).  , 2023
Link: https://doi.org/10.4230/..
 
?
3

Dynamic programming on bipartite tree decompositions:

Jaffke, Lars ; Morelle, Laure ; Sau, Ignasi.
lirmm-04253839.  , 2023
Link: https://hal-lirmm.ccsd.c..
 
?
4

Treewidth is NP-Complete for Cubic Graphs (and related resu..:

Bodlaender, Hans, L ; Bonnet, Edouard ; Jaffke, Lars...
hal-04292980.  , 2023
Link: https://hal.science/hal-..
 
?
5

Dynamic programming on bipartite tree decompositions:

Jaffke, Lars ; Morelle, Laure ; Sau, Ignasi.
http://arxiv.org/abs/2309.07754.  , 2023
Link: http://arxiv.org/abs/230..
 
?
6

Treewidth is NP-complete on cubic graphs (and related resul..:

Bodlaender, Hans ; Bonnet, Édouard ; Jaffke, Lars...
https://pure.itu.dk/portal/da/publications/648e83ef-a77c-4d30-aa4e-3f6472b37bd2.  , 2023
Link: https://pure.itu.dk/port..
 
?
7

Typical Sequences Revisited — Computing Width Parameters of..:

Bodlaender, Hans L ; Jaffke, Lars ; Telle, Jan Arne
1432-4350.  , 2023
Link: https://dspace.library.u..
 
?
8

A tight quasi-polynomial bound for Global Label Min-Cut:

Jaffke, Lars ; Thomé de Lima, Paloma ; Masařík, Tomáš..
https://pure.itu.dk/portal/da/publications/83fe7323-3b23-4bef-81c5-82cf23aaae58.  , 2023
Link: https://pure.itu.dk/port..
 
?
9

Dynamic programming on bipartite tree decompositions:

Jaffke, Lars ; Morelle, Laure ; Sau, Ignasi.
lirmm-04253839.  , 2023
Link: https://hal-lirmm.ccsd.c..
 
?
10

b-Coloring Parameterized by Clique-Width:

Jaffke, Lars ; Thomé de Lima, Paloma ; Lokshtanov, Daniel
https://pure.itu.dk/portal/da/publications/c6f9e82c-0b0d-4d6a-8775-367130b1014a.  , 2023
Link: https://pure.itu.dk/port..
 
?
11

On the maximum number of edges in planar graphs of bounded ..:

Jaffke, Lars ; Lima, Paloma T
urn:issn:0012-365X.  , 2023
Link: https://hdl.handle.net/1..
 
?
12

Dynamic programming on bipartite tree decompositions:

Jaffke, Lars ; Morelle, Laure ; Sau, Ignasi.
info:eu-repo/semantics/altIdentifier/arxiv/2309.07754.  , 2023
Link: https://hal-lirmm.ccsd.c..
 
?
13

On the maximum number of edges in planar graphs of bounded ..:

Thomé de Lima, Paloma ; Jaffke, Lars
https://pure.itu.dk/portal/da/publications/af2b400f-c7c6-4bc3-acf5-d929930fd4f4.  , 2023
Link: https://pure.itu.dk/port..
 
?
14

Treewidth is NP-Complete on Cubic Graphs (and related resul..:

Bodlaender, Hans L ; Bonnet, Édouard ; Jaffke, Lars...
http://arxiv.org/abs/2301.10031.  , 2023
Link: http://arxiv.org/abs/230..
 
?
15

Fixed-parameter tractability of DIRECTED MULTICUT with thre..:

Hatzel, Meike ; Jaffke, Lars ; Thomé de Lima, Paloma...
https://pure.itu.dk/portal/da/publications/14c9e44e-dd7c-47d9-8d4e-58e4995cf658.  , 2023
Link: https://pure.itu.dk/port..
 
1-15