![]() | Up a level |
Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia
ORCID: 0000-0002-4104-3635, Clemens, Dennis and Taraz, Anusch
(2022)
Perfectly packing graphs with bounded degeneracy and many leaves.
Israel Journal of Mathematics.
ISSN 0021-2172
Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia
ORCID: 0000-0002-4104-3635, Ehrenmüller, Julia, Schnitzer, Jakob and Taraz, Anusch
(2022)
A spanning bandwidth theorem in random graphs.
Combinatorics Probability and Computing, 31 (4).
598 - 628.
ISSN 0963-5483
Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia
ORCID: 0000-0002-4104-3635, Ehrenmüller, Julia and Taraz, Anusch
(2020)
The bandwidth theorem in sparse graphs.
Advances in Combinatorics, 2020 (1).
1 - 60.
ISSN 2517-5599
Böttcher, Julia ORCID: 0000-0002-4104-3635, Hladký, Jan, Piguet, Diana and Taraz, Anusch
(2016)
An approximate version of the tree packing conjecture.
Israel Journal of Mathematics, 211 (1).
pp. 391-446.
ISSN 0021-2172
Böttcher, Julia ORCID: 0000-0002-4104-3635, Kohayakawa, Yoshiharu, Taraz, Anusch and Würfl, Andreas
(2015)
An extension of the blow-up lemma to arrangeable graphs.
SIAM Journal on Discrete Mathematics, 29 (2).
pp. 962-1001.
ISSN 0895-4801
Böttcher, Julia ORCID: 0000-0002-4104-3635, Taraz, Anusch and Würfl, Andreas
(2015)
Spanning embeddings of arrangeable graphs with sublinear bandwidth.
Random Structures and Algorithms, 48 (2).
pp. 270-289.
ISSN 1042-9832
Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia
ORCID: 0000-0002-4104-3635, Ehrenmüller, Julia and Taraz, Anusch
(2015)
Local resilience of spanning subgraphs in sparse random graphs.
In: European Conference on Combinatorics, Graph Theory and Applications, 2015-08-31 - 2015-09-04, Bergen, Norway, NOR.
(Submitted)
Böttcher, Julia ORCID: 0000-0002-4104-3635, Kohayakawa, Yoshiharu and Taraz, Anusch
(2013)
Almost spanning subgraphs of random graphs after adversarial edge removal.
Combinatorics, Probability and Computing, 22 (5).
pp. 639-683.
ISSN 0963-5483
Böttcher, Julia ORCID: 0000-0002-4104-3635, Taraz, Anusch and Würfl, Andreas
(2012)
Perfect graphs of fixed density: counting and homogeneous sets.
Combinatorics, Probability and Computing, 21 (5).
pp. 661-682.
ISSN 0963-5483
Böttcher, Julia ORCID: 0000-0002-4104-3635, Pruessmann, Klaas P., Taraz, Anusch and Würfl, Andreas
(2010)
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs.
European Journal of Combinatorics, 31 (5).
pp. 1217-1227.
ISSN 0195-6698
Böttcher, Julia ORCID: 0000-0002-4104-3635, Heinig, Peter and Taraz, Anusch
(2010)
Embedding into bipartite graphs.
SIAM Journal on Discrete Mathematics, 24 (4).
pp. 1215-1233.
ISSN 0895-4801
Böttcher, Julia ORCID: 0000-0002-4104-3635, Kohayakawa, Yoshiharu and Taraz, Anusch
(2009)
Almost spanning subgraphs of random graphs after adversarial edge removal.
Electronic Notes in Discrete Mathematics, 35.
pp. 335-340.
ISSN 1571-0653
Böttcher, Julia ORCID: 0000-0002-4104-3635, Schacht, Mathais and Taraz, Anusch
(2009)
Proof of the bandwidth conjecture of Bollobás and Komlós.
Mathematische Annalen, 343 (1).
pp. 175-205.
ISSN 1432-1807
Böttcher, Julia ORCID: 0000-0002-4104-3635, Pruessmann, Klaas P., Taraz, Anusch and Würfl, Andreas
(2008)
Bandwidth, treewidth, separators, expansion, and universality.
Electronic Notes in Discrete Mathematics, 31.
pp. 91-96.
ISSN 1571-0653
Böttcher, Julia ORCID: 0000-0002-4104-3635, Schacht, Mathias and Taraz, Anusch
(2008)
Spanning 3-colourable subgraphs of small bandwidth in dense graphs.
Journal of Combinatorial Theory, Series B, 98 (4).
pp. 752-777.
ISSN 0095-8956
Böttcher, Julia ORCID: 0000-0002-4104-3635, Schacht, Mathais and Taraz, Anusch
(2007)
On the bandwidth conjecture for 3-colourable graphs.
In:
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms.
Society for Industrial and Applied Mathematics, pp. 618-626.
ISBN 9780898716245