Search Results

Tight Bound on Treedepth in Terms of Pathwidth and Longest Path.

• Authors : Hatzel, Meike; Joret, Gwenaël; Micek, Piotr

• Source: Combinatorica; Apr2024, Vol. 44 Issue 2, p417-427, 11p

Record details

Sparse universal graphs for planarity.

• Authors : Esperet, Louis; Joret, Gwenaël; Morin, Pat

Subjects: SPARSE graphs; PLANAR graphs; INTEGERS

• Source: Journal of the London Mathematical Society; Oct2023, Vol. 108 Issue 4, p1333-1357, 25p

Record details

Treedepth vs Circumference.

• Authors : Briański, Marcin; Joret, Gwenaël; Majewski, Konrad

• Source: Combinatorica; Aug2023, Vol. 43 Issue 4, p659-664, 6p

Record details

Applied Science & Technology Full Text (H.W. Wilson)

Record details

Approximating Pathwidth for Graphs of Small Treewidth.

• Authors : GROENLAND, CARLA; JORET, GWENAËL; NADARA, WOJCIECH

Subjects: APPROXIMATION algorithms; TREE height; POLYNOMIAL time algorithms

• Source: ACM Transactions on Algorithms; Apr2023, Vol. 19 Issue 2, p1-19, 19p

Record details

Applied Science & Technology Full Text (H.W. Wilson)

Record details

Subgraph densities in a surface.

• Authors : Huynh, Tony; Joret, Gwenaël; Wood, David R.

Subjects: COMPLETE graphs; CHARTS, diagrams, etc.; DENSITY

• Source: Combinatorics, Probability & Computing; Sep2022, Vol. 31 Issue 5, p812-839, 28p

Record details

Excluding a Ladder.

• Authors : Huynh, Tony; Joret, Gwenaël; Micek, Piotr

Subjects: GRAPH algorithms; GRAPH connectivity; PARTIALLY ordered sets

• Source: Combinatorica; Jun2022, Vol. 42 Issue 3, p405-432, 28p

Record details

Improved approximation algorithms for hitting 3-vertex paths.

• Authors : Fiorini, Samuel (AUTHOR); Joret, Gwenaël (AUTHOR); Schaudt, Oliver (AUTHOR)

Subjects: APPROXIMATION algorithms; USER-generated content; TRIANGLES

• Source: Mathematical Programming. Jul2020, Vol. 182 Issue 1/2, p355-367. 13p.

Record details

Applied Science & Technology Full Text (H.W. Wilson)

Record details