Andreas Würfl

According to our database1, Andreas Würfl authored at least 7 papers between 2008 and 2016.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2016
Spanning embeddings of arrangeable graphs with sublinear bandwidth.
Random Struct. Algorithms, 2016

2015
An Extension of the Blow-up Lemma to Arrangeable Graphs.
SIAM J. Discret. Math., 2015

2013
Maximum Planar Subgraphs in Dense Graphs.
Electron. J. Comb., 2013

2012
Perfect Graphs of Fixed Density: Counting and Homogeneous Sets.
Comb. Probab. Comput., 2012

2011
Induced C<sub>5</sub>-free graphs of fixed density: counting and homogeneous sets.
Electron. Notes Discret. Math., 2011

2010
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs.
Eur. J. Comb., 2010

2008
Bandwidth, treewidth, separators, expansion, and universality.
Electron. Notes Discret. Math., 2008


  Loading...