Search the dblp DataBase
Stephen G. Hartke: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Stephen Hartke
The Elimination Procedure for the Phylogeny Number. [Citation Graph (0, 0)][DBLP]
Ars Comb., 2005, v:75, n:, pp:- [Journal] - Stephen G. Hartke, Aparna W. Higgins
Minimum Degree Growth of the Iterated Line Graph. [Citation Graph (0, 0)][DBLP]
Ars Comb., 2003, v:69, n:, pp:- [Journal] - Stephen G. Hartke, Aparna W. Higgins
Maximum Degree Growth of the Iterated Line Graph. [Citation Graph (0, 0)][DBLP]
Electr. J. Comb., 1999, v:6, n:, pp:- [Journal] - Stephen G. Hartke
The elimination procedure for the competition number is not optimal. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 2006, v:154, n:11, pp:1633-1639 [Journal] - Mike Develin, Stephen Hartke, David Petrie Moulton
A General Notion of Visibility Graphs. [Citation Graph (0, 0)][DBLP]
Discrete & Computational Geometry, 2003, v:29, n:4, pp:511-524 [Journal] - Stephen G. Hartke
Binary De Bruijn cycles under different equivalence relations. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2000, v:215, n:, pp:93-102 [Journal] - Mike Develin, Stephen G. Hartke
Fire containment in grids of dimension three and higher. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 2007, v:155, n:17, pp:2257-2268 [Journal]
k-ordered hamiltonicity of iterated line 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 |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002