default search action
Kenny Storgel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Petr Gregor, Jaka Kranjc, Borut Luzar, Kenny Storgel:
Packing coloring of hypercubes with extended Hamming codes. Discret. Appl. Math. 359: 269-277 (2024) - [j8]Clément Dallard
, Martin Milanic
Treewidth versus clique number. II. Tree-independence number. J. Comb. Theory B 164: 404-442 (2024) - [j7]Clément Dallard
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure. J. Comb. Theory B 167: 338-391 (2024) - [c3]Paloma T. Lima, Martin Milanic, Peter Mursic, Karolina Okrasa, Pawel Rzazewski, Kenny Storgel:
Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set. ESA 2024: 85:1-85:17 - [c2]Daniel Král, Kristýna Pekárková, Kenny Storgel:
Twin-Width of Graphs on Surfaces. MFCS 2024: 66:1-66:15 - [i10]Clément Dallard
Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star. CoRR abs/2402.11222 (2024) - [i9]Paloma T. Lima, Martin Milanic, Peter Mursic, Karolina Okrasa, Pawel Rzazewski, Kenny Storgel:
Tree decompositions meet induced matchings: beyond Max Weight Independent Set. CoRR abs/2402.15834 (2024) - 2023
- [j6]Borut Luzar
Locally irregular edge-coloring of subcubic graphs. Discret. Appl. Math. 339: 136-148 (2023) - [j5]Mirko Hornák
3-facial edge-coloring of plane graphs. Discret. Math. 346(5): 113312 (2023) - [j4]Hoang La, Kenny Storgel
2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4. Discret. Math. 346(8): 113405 (2023) - [j3]Kenny Storgel:
Improved bounds for some facially constrained colorings. Discuss. Math. Graph Theory 43(1): 151-158 (2023) - [i8]Clément Dallard
Functionality of box intersection graphs. CoRR abs/2301.09493 (2023) - [i7]Daniel Král, Kristýna Pekárková, Kenny Storgel:
Twin-width of graphs on surfaces. CoRR abs/2307.05811 (2023) - [i6]Petr Gregor, Jaka Kranjc, Borut Luzar, Kenny Storgel:
Packing coloring of hypercubes with extended Hamming codes. CoRR abs/2312.14576 (2023) - 2022
- [j2]Hoang La, Borut Luzar
Further extensions of the Grötzsch Theorem. Discret. Math. 345(6): 112849 (2022) - [i5]Clément Dallard
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure. CoRR abs/2206.15092 (2022) - [i4]Borut Luzar, Mária Maceková, Simona Rindosová, Roman Soták, Katarína Sroková, Kenny Storgel:
Locally irregular edge-coloring of subcubic graphs. CoRR abs/2210.04649 (2022) - 2021
- [j1]Clément Dallard
Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure. SIAM J. Discret. Math. 35(4): 2618-2646 (2021) - [i3]Clément Dallard, Martin Milanic, Kenny Storgel:
Tree decompositions with bounded independence number and their algorithmic applications. CoRR abs/2111.04543 (2021) - 2020
- [c1]Clément Dallard
Treewidth Versus Clique Number in Graph Classes with a Forbidden Structure. WG 2020: 92-105 - [i2]Kenny Storgel:
Improved bounds for some facially constrained colorings. CoRR abs/2005.09979 (2020) - [i1]Clément Dallard, Martin Milanic, Kenny Storgel:
Treewidth versus clique number in graph classes with a forbidden structure. CoRR abs/2006.06067 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-26 00:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: