default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTara Abrishami
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j11]Tara Abrishami, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl:
Induced subgraphs and tree decompositions VI. Graphs with 2-cutsets. Discret. Math. 348(1): 114195 (2025)- 2024
- [j10]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) - [j9]Tara Abrishami, Eli Berger, Maria Chudnovsky, Shira Zerbib:
Graphs with no even holes and no sector wheels are the union of two chordal graphs. Eur. J. Comb. 122: 104035 (2024) - [j8]Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Sepehr Hajebi
, Pawel Rzazewski, Sophie Spirkl, Kristina Vuskovic:
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) - [j7]Tara Abrishami, Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl:
Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs. J. Comb. Theory B 164: 443-472 (2024) - [j6]Tara Abrishami, Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl, Kristina Vuskovic:
Induced subgraphs and tree decompositions V. one neighbor in a hole. J. Graph Theory 105(4): 542-561 (2024) - [j5]Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour:
Induced Subgraphs of Bounded Treewidth and the Container Method. SIAM J. Comput. 53(3): 624-647 (2024) - [c3]Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski:
Max Weight Independent Set in Sparse Graphs with No Long Claws. STACS 2024: 4:1-4:15 - 2023
- [j4]Tara Abrishami, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl:
Induced Subgraphs and Tree Decompositions IV. (Even Hole, Diamond, Pyramid)-Free Graphs. Electron. J. Comb. 30(2) (2023) - [i4]Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski:
Max Weight Independent Set in sparse graphs with no long claws. CoRR abs/2309.16995 (2023) - 2022
- [j3]Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic:
Graphs with polynomially many minimal separators. J. Comb. Theory B 152: 248-280 (2022) - [j2]Tara Abrishami, Maria Chudnovsky, Kristina Vuskovic:
Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree. J. Comb. Theory B 157: 144-175 (2022) - [c2]Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Pawel Rzazewski:
Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws. SODA 2022: 1448-1470 - 2021
- [c1]Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour:
Induced subgraphs of bounded treewidth and the container method. SODA 2021: 1948-1964 - [i3]Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Pawel Rzazewski:
Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws. CoRR abs/2107.05434 (2021) - 2020
- [j1]Tara Abrishami, Nestor Guillen, Parker Rule, Zachary Schutzman, Justin Solomon, Thomas Weighill, Si Wu:
Geometry of Graph Partitions via Optimal Transport. SIAM J. Sci. Comput. 42(5): A3340-A3366 (2020) - [i2]Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour:
Induced subgraphs of bounded treewidth and the container method. CoRR abs/2003.05185 (2020)
2010 – 2019
- 2019
- [i1]Tara Abrishami, Nestor Guillen, Parker Rule, Zachary Schutzman, Justin Solomon, Thomas Weighill, Si Wu:
Geometry of Graph Partitions via Optimal Transport. CoRR abs/1910.09618 (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 21:22 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:
