Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDDaniel P. Sanders
Person information
- affiliation: Columbia University, New York City, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c3]Petar Ristoski, Dmitry Yu. Zubarev, Anna Lisa Gentile, Nathaniel Park, Daniel P. Sanders, Daniel Gruhl, Linda Kato, Steve Welch:
Expert-in-the-loop AI for Polymer Discovery. CIKM 2020: 2701-2708- [c2]Seiji Takeda, Toshiyuki Hama, Hsiang-Han Hsu, Victoria A. Piunova, Dmitry Zubarev, Daniel P. Sanders, Jed W. Pitera, Makoto Kogoh, Takumi Hongo, Yenwei Cheng, Wolf Bocanett, Hideaki Nakashika, Akihiro Fujita, Yuta Tsuchiya, Katsuhiko Hino, Kentaro Yano, Shuichi Hirose, Hiroki Toda, Yasumitsu Orii, Daiju Nakano:
Molecular Inverse-Design Platform for Material Industries. KDD 2020: 2961-2969 - [i4]Seiji Takeda, Toshiyuki Hama, Hsiang-Han Hsu, Toshiyuki Yamane, Koji Masuda, Victoria A. Piunova, Dmitry Zubarev, Jed Pitera, Daniel P. Sanders, Daiju Nakano:
AI-driven Inverse Design System for Organic Molecules. CoRR abs/2001.09038 (2020) - [i3]Seiji Takeda, Toshiyuki Hama, Hsiang-Han Hsu, Victoria A. Piunova, Dmitry Zubarev, Daniel P. Sanders, Jed W. Pitera, Makoto Kogoh, Takumi Hongo, Yenwei Cheng, Wolf Bocanett, Hideaki Nakashika, Akihiro Fujita, Yuta Tsuchiya, Katsuhiko Hino, Kentaro Yano, Shuichi Hirose, Hiroki Toda, Yasumitsu Orii, Daiju Nakano:
Molecular Inverse-Design Platform for Material Industries. CoRR abs/2004.11521 (2020)
2010 – 2019
- 2016
- [j30]Katherine Edwards, Daniel P. Sanders, Paul D. Seymour, Robin Thomas:
Three-edge-colouring doublecross cubic graphs. J. Comb. Theory, Ser. B 119: 66-95 (2016) - 2014
- [i2]Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas:
Reducibility in the Four-Color Theorem. CoRR abs/1401.6481 (2014) - [i1]Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas:
Discharging cartwheels. CoRR abs/1401.6485 (2014)
2000 – 2009
- 2004
- [j29]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. J. Comb. Theory, Ser. B 91(1): 25-41 (2004) - 2003
- [j28]Daniel P. Sanders, Yue Zhao:
Coloring edges of graphs embedded in a surface of characteristic zero. J. Comb. Theory, Ser. B 87(2): 254-263 (2003) - 2002
- [j27]Daniel P. Sanders, Yue Zhao:
Coloring the Faces of Convex Polyhedra so That Like Colors Are Far Apart. J. Comb. Theory, Ser. B 85(2): 348-360 (2002) - [j26]Daniel P. Sanders, Yue Zhao:
On the Size of Edge Chromatic Critical Graphs. J. Comb. Theory, Ser. B 86(2): 408-412 (2002) - 2001
- [j25]Daniel P. Sanders, Yue Zhao:
On Improving the Edge-Face Coloring Theorem. Graphs Comb. 17(2): 329-341 (2001) - [j24]Daniel P. Sanders, Yue Zhao:
A New Bound on the Cyclic Chromatic Number. J. Comb. Theory, Ser. B 83(1): 102-111 (2001) - [j23]Daniel P. Sanders, Yue Zhao:
Planar Graphs of Maximum Degree Seven are Class I. J. Comb. Theory, Ser. B 83(2): 201-212 (2001) - [j22]Daniel P. Sanders, Yue Zhao:
On spanning trees and walks of low maximum degree. J. Graph Theory 36(2): 67-74 (2001) - 2000
- [j21]Daniel P. Sanders, Yue Zhao:
A five-color theorem. Discret. Math. 220(1-3): 279-281 (2000) - [j20]Daniel P. Sanders, John Maharry:
On simultaneous colorings of embedded graphs. Discret. Math. 224(1-3): 207-214 (2000) - [j19]Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk L. Vertigan:
Surfaces, Tree-Width, Clique-Minors, and Partitions. J. Comb. Theory, Ser. B 79(2): 221-246 (2000) - [j18]Daniel P. Sanders, Yue Zhao:
Coloring edges of embedded graphs. J. Graph Theory 35(3): 197-205 (2000)
1990 – 1999
- 1999
- [j17]Oleg V. Borodin, Daniel P. Sanders, Yue Zhao:
On cyclic colorings and their generalizations. Discret. Math. 203(1-3): 23-40 (1999) - [j16]Daniel P. Sanders, Yue Zhao:
On total 9-coloring planar graphs of maximum degree seven. J. Graph Theory 31(1): 67-73 (1999) - 1998
- [j15]Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk Vertigan:
Partitioning Graphs of Bounded Tree-Width. Comb. 18(1): 1-12 (1998) - [j14]Daniel P. Sanders, Yue Zhao:
On \bi d-Diagonal Colorings of Embedded Graphs of Low Maximum Face Size. Graphs Comb. 14(1): 81-94 (1998) - [j13]Daniel P. Sanders, Yue Zhao:
On 2-Connected Spanning Subgraphs with Low Maximum Degree. J. Comb. Theory, Ser. B 74(1): 64-86 (1998) - 1997
- [j12]Daniel P. Sanders, Yue Zhao:
On Simultaneous Edge-Face Colorings of Plane Graphs. Comb. 17(3): 441-445 (1997) - [j11]Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas:
The Four-Colour Theorem. J. Comb. Theory, Ser. B 70(1): 2-44 (1997) - [j10]Daniel P. Sanders:
On paths in planar graphs. J. Graph Theory 24(4): 341-345 (1997) - 1996
- [j9]Daniel P. Sanders:
On circuits through five edges. Discret. Math. 159(1-3): 199-215 (1996) - [j8]Daniel P. Sanders:
On Hamilton cycles in certain planar graphs. J. Graph Theory 21(1): 43-50 (1996) - [j7]Daniel P. Sanders:
On the effect of major vertices on the number of light edges. J. Graph Theory 21(3): 317-322 (1996) - [j6]Daniel P. Sanders:
On light edges and triangles in projective planar graphs. J. Graph Theory 21(3): 335-342 (1996) - [j5]Daniel P. Sanders, Yue Zhao:
On d-diagonal colorings. J. Graph Theory 22(2): 155-166 (1996) - [j4]Daniel P. Sanders:
On the face touching number. J. Graph Theory 23(3): 265-271 (1996) - [j3]Daniel P. Sanders:
On Linear Recognition of Tree-Width at Most Four. SIAM J. Discret. Math. 9(1): 101-117 (1996) - [c1]Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas:
Efficiently Four-Coloring Planar Graphs. STOC 1996: 571-575 - 1995
- [j2]Daniel P. Sanders, Yue Zhao:
A note on the three color problem. Graphs Comb. 11(1): 91-94 (1995) - [j1]Daniel P. Sanders, Yue Zhao:
On Diagonally 10-Coloring Plane Triangulations. J. Graph Theory 20(1): 77-85 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2021-02-17 23:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
