Julia Böttcher

	2012
15		Julia Böttcher, Jan Hladký, Diana Piguet: The tripartite Ramsey number for trees. Journal of Graph Theory 69(3): 264-300 (2012)
	2011
14		Julia Böttcher, Anusch Taraz, Andreas Würfl: Induced C5-free graphs of fixed density: counting and homogeneous sets. Electronic Notes in Discrete Mathematics 38: 181-186 (2011)
13		Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet: A density Corrádi-Hajnal theorem. Electronic Notes in Discrete Mathematics 38: 31-36 (2011)
	2010
12		Julia Böttcher, Klaas P. Pruessmann, Anusch Taraz, Andreas Würfl: Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs. Eur. J. Comb. 31(5): 1217-1227 (2010)
11		Julia Böttcher, Peter Heinig, Anusch Taraz: Embedding into Bipartite Graphs. SIAM J. Discrete Math. 24(4): 1215-1233 (2010)
	2009
10		Julia Böttcher, Sybille Müller: Forcing spanning subgraphs via Ore type conditions. Electronic Notes in Discrete Mathematics 34: 255-259 (2009)
9		Julia Böttcher, Jan Hladký, Diana Piguet: The tripartite Ramsey number for trees. Electronic Notes in Discrete Mathematics 34: 597-601 (2009)
8		Peter Allen, Julia Böttcher, Jan Hladký, Oliver Cooley: Minimum degree conditions for large subgraphs. Electronic Notes in Discrete Mathematics 34: 75-79 (2009)
7		Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz: Almost spanning subgraphs of random graphs after adversarial edge removal. Electronic Notes in Discrete Mathematics 35: 335-340 (2009)
	2008
6		Julia Böttcher, Klaas P. Pruessmann, Anusch Taraz, Andreas Würfl: Bandwidth, treewidth, separators, expansion, and universality. Electronic Notes in Discrete Mathematics 31: 91-96 (2008)
5		Julia Böttcher, Dan Vilenchik: On the tractability of coloring semirandom graphs. Inf. Process. Lett. 108(3): 143-149 (2008)
4		Julia Böttcher, Mathias Schacht, Anusch Taraz: Spanning 3-colourable subgraphs of small bandwidth in dense graphs. J. Comb. Theory, Ser. B 98(4): 752-777 (2008)
	2007
3		Julia Böttcher, Mathias Schacht, Anusch Taraz: On the bandwidth conjecture for 3-colourable graphs. SODA 2007: 618-626
2		Julia Böttcher, Mathias Schacht, Anusch Taraz: Embedding spanning subgraphs of small bandwidth. Electronic Notes in Discrete Mathematics 29: 485-489 (2007)
	2005
1		Julia Böttcher: Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time. MFCS 2005: 156-167

Coauthor Index

1	Peter Allen	[8] [13]
2	Oliver Cooley	[8]
3	Peter Heinig	[11]
4	Jan Hladký	[8] [9] [13] [15]
5	Yoshiharu Kohayakawa	[7]
6	Sybille Müller	[10]
7	Diana Piguet	[9] [13] [15]
8	Klaas P. Pruessmann	[6] [12]
9	Mathias Schacht	[2] [3] [4]
10	Anusch Taraz	[2] [3] [4] [6] [7] [11] [12] [14]
11	Dan Vilenchik	[5]
12	Andreas Würfl	[6] [12] [14]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page