default search action
Sepehr Hajebi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j14]Tara Abrishami, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl:
Induced subgraphs and tree decompositions VI. Graphs with 2-cutsets. Discret. Math. 348(1): 114195 (2025) - [j13]Sepehr Hajebi:
Induced subdivisions with pinned branch vertices. Eur. J. Comb. 124: 104072 (2025) - [j12]Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl:
Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole. Eur. J. Comb. 124: 104074 (2025) - 2024
- [j11]Tara Abrishami, Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl:
Induced Subgraphs and Tree Decompositions VIII: Excluding a Forest in (Theta, Prism)-Free Graphs. Comb. 44(5): 921-948 (2024) - [j10]Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl:
List-k-Coloring H-Free Graphs for All k>4. Comb. 44(5): 1063-1068 (2024) - [j9]Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Sepehr Hajebi
, Pawel Rzazewski, Sophie Spirkl
Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree. J. Comb. Theory B 164: 371-403 (2024) - [j8]Tara Abrishami, Bogdan Alecu
Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs. J. Comb. Theory B 164: 443-472 (2024) - [j7]Sepehr Hajebi
Hitting all maximum stable sets in P5-free graphs. J. Comb. Theory B 165: 142-163 (2024) - [j6]Tara Abrishami, Bogdan Alecu
Induced subgraphs and tree decompositions V. one neighbor in a hole. J. Graph Theory 105(4): 542-561 (2024) - [j5]Sepehr Hajebi, Yanjia Li, Sophie Spirkl:
List-3-Coloring Ordered Graphs with a Forbidden Induced Subgraph. SIAM J. Discret. Math. 38(1): 1158-1190 (2024) - [i1]Maria Chudnovsky, Peter Gartland, Sepehr Hajebi, Daniel Lokshtanov, Sophie Spirkl:
Tree Independence Number IV. Even-hole-free Graphs. CoRR abs/2407.08927 (2024) - 2023
- [j4]Tara Abrishami, Maria Chudnovsky
Induced Subgraphs and Tree Decompositions IV. (Even Hole, Diamond, Pyramid)-Free Graphs. Electron. J. Comb. 30(2) (2023) - 2022
- [j3]Joseph Cheriyan
Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs. Discret. Math. 345(7): 112869 (2022) - [j2]Sepehr Hajebi, Yanjia Li, Sophie Spirkl
Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph. SIAM J. Discret. Math. 36(3): 2004-2027 (2022)
2010 – 2019
- 2019
- [j1]Ramin Javadi
Edge clique cover of claw-free graphs. J. Graph Theory 90(3): 311-405 (2019)
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-10-16 20:33 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: