1. Counting results for sparse pseudorandom hypergraphs I. (October 2017) Authors: Kohayakawa, Yoshiharu; Mota, Guilherme Oliveira; Schacht, Mathias; Taraz, Anusch Journal: European journal of combinatorics Issue: Volume 65(2017) Page Start: 276 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. Counting results for sparse pseudorandom hypergraphs II. (October 2017) Authors: Kohayakawa, Yoshiharu; Mota, Guilherme Oliveira; Schacht, Mathias; Taraz, Anusch Journal: European journal of combinatorics Issue: Volume 65(2017) Page Start: 288 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. On minimum bisection and related cut problems in trees and tree‐like graphs. Issue 2 (20th April 2018) Authors: Fernandes, Cristina G.; Schmidt, Tina Janne; Taraz, Anusch Journal: Journal of graph theory Issue: Volume 89:Issue 2(2018) Page Start: 214 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. On the size-Ramsey number of grid graphs. (6th September 2021) Authors: Clemens, Dennis; Miralaei, Meysam; Reding, Damian; Schacht, Mathias; Taraz, Anusch Journal: Combinatorics, probability and computing Issue: Volume 30:Number 5(2021) Page Start: 670 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. Spanning embeddings of arrangeable graphs with sublinear bandwidth1. Issue 2 (7th July 2015) Authors: Böttcher, Julia; Taraz, Anusch; Würfl, Andreas Journal: Random structures & algorithms Issue: Volume 48:Issue 2(2016) Page Start: 270 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗