Results 1-18 of 18

Issue DateTitleTypeAuthor(s)
12022Perfectly packing graphs with bounded degeneracy and many leavesArticleAllen, Peter ; Böttcher, Julia ; Clemens, Dennis  ; Taraz, Anusch 
22021On the size-Ramsey number of grid graphsArticleClemens, Dennis  ; Miralaei, Meysam ; Reding, Damian ; Schacht, Mathias ; Taraz, Anusch 
32021A spanning bandwidth theorem in random graphsArticleAllen, Peter ; Böttcher, Julia ; Ehrenmüller, Julia ; Schnitzer, Jakob ; Taraz, Anusch 
423-Sep-2020Fulltext availableOpen AccessArtificial intelligence and operations research in maritime logisticsChapter/Article (Proceedings)Dornemann, Jorin  ; Rückert, Nicolas  ; Fischer, Kathrin  ; Taraz, Anusch 
515-May-2020Fulltext availableOpen AccessThe bandwidth theorem in sparse graphsArticleAllen, Peter ; Böttcher, Julia ; Ehrenmüller, Julia ; Taraz, Anusch 
6Oct-2018On minimum bisection and related cut problems in trees and tree-like graphsArticleFernandes, Cristina G. ; Schmidt, Tina Janne ; Taraz, Anusch 
7May-2018Logical limit laws for minor-closed classes of graphsArticleHeinig, Peter ; Müller, Tobias ; Noy, Marc ; Taraz, Anusch 
8Oct-2017Counting results for sparse pseudorandom hypergraphs IIArticleKohayakawa, Yoshiharu ; Mota, Guilherme Oliveira ; Schacht, Mathias ; Taraz, Anusch 
9Oct-2017Counting results for sparse pseudorandom hypergraphs IArticleKohayakawa, Yoshiharu ; Mota, Guilherme Oliveira ; Schacht, Mathias ; Taraz, Anusch 
101-Mar-2016Spanning embeddings of arrangeable graphs with sublinear bandwidthArticleBöttcher, Julia ; Taraz, Anusch ; Würfl, Andreas 
111-Feb-2016An approximate version of the tree packing conjectureArticleBöttcher, Julia ; Hladký, Jan ; Piguet, Diana ; Taraz, Anusch 
121-Dec-2015Approximating Minimum k-Section in Trees with Linear DiameterArticleFernandes, Cristina G. ; Schmidt, Tina Janne ; Taraz, Anusch 
1312-Nov-2015Local resilience of spanning subgraphs in sparse random graphsArticleAllen, Peter ; Böttcher, Julia ; Ehrenmüller, Julia ; Taraz, Anusch 
1412-Nov-2015On minimum bisection and related partition problems in graphs with bounded tree widthArticleFernandes, Cristina G. ; Schmidt, Tina Janne ; Taraz, Anusch 
151-Aug-2015Ramsey numbers for bipartite graphs with small bandwidthArticleMota, Guilherme Oliveira ; Sárközy, G. N. ; Schacht, Mathias ; Taraz, Anusch 
164-Jun-2015An extension of the blow-up lemma to arrangeable graphsArticleBöttcher, Julia ; Kohayakawa, Yoshiharu ; Taraz, Anusch ; Würfl, Andreas 
172015A counting lemma for sparse pseudorandom hypergraphsArticleKohayakawa, Yoshiharu ; Mota, Guilherme Oliveira ; Schacht, Mathias ; Taraz, Anusch 
1817-Oct-2014Coloring d-embeddable k-uniform hypergraphsArticleHeise, Carl Georg ; Panagiotou, Konstantinos ; Pikhurko, Oleg ; Taraz, Anusch