The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Julia Böttcher: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Julia Böttcher
    Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:156-167 [Conf]
  2. Julia Böttcher, Mathias Schacht, Anusch Taraz
    On the bandwidth conjecture for 3-colourable graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:618-626 [Conf]

  3. Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002