Search the dblp DataBase
N. Sauer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- S. Martinez, Stéphane Dauzère-Pérès, C. Guéret, Y. Mati, N. Sauer
Complexity of flowshop scheduling problems with a new blocking constraint. [Citation Graph (0, 0)][DBLP]
European Journal of Operational Research, 2006, v:169, n:3, pp:855-864 [Journal] - E. C. Milner, N. Sauer
Remarks on the cofinality of a partially ordered set, and a generalization of König's lemma. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1981, v:35, n:1-3, pp:165-171 [Journal] - András Hajnal, N. Sauer
Complete subgraphs of infinite multipartite graphs and antichains in partially ordered sets. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1986, v:59, n:1-2, pp:61-67 [Journal] - Arie Bialostocki, N. Sauer
On Ramsey-Turán type problems in tournaments. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1986, v:59, n:3, pp:221-228 [Journal] - Károly Böröczky, N. Sauer, X. Zhu
Inexhaustible homogeneous structures. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1993, v:115, n:1-3, pp:57-63 [Journal] - András Hajnal, N. Sauer
Cut-sets in infinite graphs and partial orders. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1993, v:117, n:1-3, pp:113-125 [Journal]
Search in 0.002secs, 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