The SCEAS System
Navigation Menu

Search the dblp DataBase


Jan van den Heuvel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jan van den Heuvel
    On the Complexity of Ordered Colourings. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:156- [Conf]
  2. Jan van den Heuvel, Matthew Johnson 0002
    The External Network Problem with Edge- or Arc-Connectivity Requirements. [Citation Graph (0, 0)][DBLP]
    CAAN, 2004, pp:114-126 [Conf]
  3. Graham Brightwell, Jan van den Heuvel, Leen Stougie
    A Linear Bound On The Diameter Of The Transportation Polytope. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:2, pp:133-139 [Journal]
  4. Jan van den Heuvel
    Algorithmic Aspects Of A Chip-Firing Game. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2001, v:10, n:6, pp:- [Journal]
  5. Luis A. Goddyn, Jan van den Heuvel, Sean McGuinness
    Removable Circuits in Multigraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:71, n:2, pp:130-143 [Journal]
  6. Omid Amini, Louis Esperet, Jan van den Heuvel
    Frugal Colouring of Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  7. A unified approach to distance-two colouring of planar graphs. [Citation Graph (, )][DBLP]

  8. Mixing 3-Colourings in Bipartite Graphs. [Citation Graph (, )][DBLP]

  9. Connectedness of the graph of vertex-colourings. [Citation Graph (, )][DBLP]

  10. Preface. [Citation Graph (, )][DBLP]

  11. Mixing 3-colourings in bipartite graphs. [Citation Graph (, )][DBLP]

Search in 0.027secs, Finished in 0.028secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002