Tara Abrishami

According to our database1, Tara Abrishami authored at least 14 papers between 2020 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Even pairs in Berge graphs with no balanced skew-partitions.
Discret. Math., 2025

Induced subgraphs and tree decompositions VI. Graphs with 2-cutsets.
Discret. Math., 2025

2024
Induced Subgraphs and Tree Decompositions VIII: Excluding a Forest in (Theta, Prism)-Free Graphs.
Comb., October, 2024

Induced subgraphs and tree decompositions V. one neighbor in a hole.
J. Graph Theory, April, 2024

Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree.
J. Comb. Theory B, January, 2024

Induced subgraphs and tree decompositions VII. Basic obstructions in <i>H</i>-free graphs.
J. Comb. Theory B, January, 2024

Induced Subgraphs of Bounded Treewidth and the Container Method.
SIAM J. Comput., 2024

Graphs with no even holes and no sector wheels are the union of two chordal graphs.
Eur. J. Comb., 2024

Max Weight Independent Set in Sparse Graphs with No Long Claws.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2023
Induced Subgraphs and Tree Decompositions IV. (Even Hole, Diamond, Pyramid)-Free Graphs.
Electron. J. Comb., 2023

2022
Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree.
J. Comb. Theory B, 2022

Graphs with polynomially many minimal separators.
J. Comb. Theory B, 2022

Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2020
Geometry of Graph Partitions via Optimal Transport.
SIAM J. Sci. Comput., 2020


  Loading...