The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Daniel P. Sanders: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas
    Efficiently Four-Coloring Planar Graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:571-575 [Conf]
  2. Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk Vertigan
    Partitioning Graphs of Bounded Tree-Width. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1998, v:18, n:1, pp:1-12 [Journal]
  3. Daniel P. Sanders, Yue Zhao
    On Simultaneous Edge-Face Colorings of Plane Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:3, pp:441-445 [Journal]
  4. Daniel P. Sanders, John Maharry
    On simultaneous colorings of embedded graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:224, n:1-3, pp:207-214 [Journal]
  5. Daniel P. Sanders, Yue Zhao
    A five-color theorem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:220, n:1-3, pp:279-281 [Journal]
  6. Daniel P. Sanders, Yue Zhao
    On Improving the Edge-Face Coloring Theorem. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:2, pp:329-341 [Journal]
  7. Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce A. Reed, Paul D. Seymour, Dirk Vertigan
    Excluding any graph as a minor allows a low tree-width 2-coloring. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:91, n:1, pp:25-41 [Journal]
  8. Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk L. Vertigan
    Surfaces, Tree-Width, Clique-Minors, and Partitions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:79, n:2, pp:221-246 [Journal]
  9. Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas
    The Four-Colour Theorem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:70, n:1, pp:2-44 [Journal]
  10. Daniel P. Sanders, Yue Zhao
    A New Bound on the Cyclic Chromatic Number. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:83, n:1, pp:102-111 [Journal]
  11. Daniel P. Sanders, Yue Zhao
    Planar Graphs of Maximum Degree Seven are Class I. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:201-212 [Journal]
  12. Daniel P. Sanders, Yue Zhao
    On the Size of Edge Chromatic Critical Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:86, n:2, pp:408-412 [Journal]
  13. Daniel P. Sanders, Yue Zhao
    Coloring the Faces of Convex Polyhedra so That Like Colors Are Far Apart. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:85, n:2, pp:348-360 [Journal]
  14. Daniel P. Sanders, Yue Zhao
    Coloring edges of graphs embedded in a surface of characteristic zero. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:254-263 [Journal]
  15. Daniel P. Sanders, Yue Zhao
    On 2-Connected Spanning Subgraphs with Low Maximum Degree. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:74, n:1, pp:64-86 [Journal]
  16. Daniel P. Sanders
    On Linear Recognition of Tree-Width at Most Four. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1996, v:9, n:1, pp:101-117 [Journal]
  17. Oleg V. Borodin, Daniel P. Sanders, Yue Zhao
    On cyclic colorings and their generalizations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:203, n:1-3, pp:23-40 [Journal]
  18. Daniel P. Sanders
    On circuits through five edges. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:159, n:1-3, pp:199-215 [Journal]

Search in 0.003secs, Finished in 0.004secs
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