Kenny Storgel

24 papers A 1B 2C 1Journal 20
YearRankTypeTitle / Venue / Authors
2025 J jnl
Awesome graph parameters.
CoRR
Kenny Storgel, Clément Dallard, Vadim V. Lozin, Martin Milanic, Viktor Zamaraev
2025 C conf
On {k}-Roman graphs.
LAGOS
Kenny Storgel, Nina Chiarelli, Lara Fernández, Jochen Pascal Gollin, Claire Hilaire, Valeria Leoni, Martin Milanic
2024 J jnl
Packing coloring of hypercubes with extended Hamming codes.
Discret. Appl. Math.
Petr Gregor, Jaka Kranjc, Borut Luzar, Kenny Storgel
2024 A conf
Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set.
ESA
Paloma T. Lima, Martin Milanic, Peter Mursic, Karolina Okrasa, Pawel Rzazewski, Kenny Storgel
2024 J jnl
Tree decompositions meet induced matchings: beyond Max Weight Independent Set.
CoRR
Paloma T. Lima, Martin Milanic, Peter Mursic, Karolina Okrasa, Pawel Rzazewski, Kenny Storgel
2024 J jnl
Treewidth versus clique number. II. Tree-independence number.
J. Comb. Theory B
Clément Dallard, Martin Milanic, Kenny Storgel
2024 J jnl
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure.
J. Comb. Theory B
Clément Dallard, Martin Milanic, Kenny Storgel
2024 J jnl
Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star.
CoRR
Clément Dallard, Matjaz Krnc, O-joung Kwon, Martin Milanic, Andrea Munaro, Kenny Storgel, Sebastian Wiederrecht
2024 B conf
Twin-Width of Graphs on Surfaces.
MFCS
Daniel Král, Kristýna Pekárková, Kenny Storgel
2023 J jnl
2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4.
Discret. Math.
Hoang La, Kenny Storgel
2023 J jnl
3-facial edge-coloring of plane graphs.
Discret. Math.
Mirko Hornák, Borut Luzar, Kenny Storgel
2023 J jnl
Functionality of box intersection graphs.
CoRR
Clément Dallard, Vadim V. Lozin, Martin Milanic, Kenny Storgel, Viktor Zamaraev
2023 J jnl
Improved bounds for some facially constrained colorings.
Discuss. Math. Graph Theory
Kenny Storgel
2023 J jnl
Locally irregular edge-coloring of subcubic graphs.
Discret. Appl. Math.
Borut Luzar, Mária Maceková, Simona Rindosová, Roman Soták, Katarína Sroková, Kenny Storgel
2023 J jnl
Packing coloring of hypercubes with extended Hamming codes.
CoRR
Petr Gregor, Jaka Kranjc, Borut Luzar, Kenny Storgel
2023 J jnl
Twin-width of graphs on surfaces.
CoRR
Daniel Král, Kristýna Pekárková, Kenny Storgel
2022 J jnl
Further extensions of the Grötzsch Theorem.
Discret. Math.
Hoang La, Borut Luzar, Kenny Storgel
2022 J jnl
Locally irregular edge-coloring of subcubic graphs.
CoRR
Borut Luzar, Mária Maceková, Simona Rindosová, Roman Soták, Katarína Sroková, Kenny Storgel
2022 J jnl
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure.
CoRR
Clément Dallard, Martin Milanic, Kenny Storgel
2021 J jnl
Tree decompositions with bounded independence number and their algorithmic applications.
CoRR
Clément Dallard, Martin Milanic, Kenny Storgel
2021 J jnl
Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure.
SIAM J. Discret. Math.
Clément Dallard, Martin Milanic, Kenny Storgel
2020 J jnl
Improved bounds for some facially constrained colorings.
CoRR
Kenny Storgel
2020 B conf
Treewidth Versus Clique Number in Graph Classes with a Forbidden Structure.
WG
Clément Dallard, Martin Milanic, Kenny Storgel
2020 J jnl
Treewidth versus clique number in graph classes with a forbidden structure.
CoRR
Clément Dallard, Martin Milanic, Kenny Storgel