The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Konstantin Yu. Gorbunov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Konstantin Yu. Gorbunov
    An Estimate of the Tree-Width of a Planar Graph Which Has Not a Given Planar Grid as a Minor. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:372-383 [Conf]
  2. Reinhard Diestel, Tommy R. Jensen, Konstantin Yu. Gorbunov, Carsten Thomassen
    Highly Connected Sets and the Excluded Grid Theorem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:75, n:1, pp:61-73 [Journal]
  3. Konstantin Yu. Gorbunov
    On a Complexity of the Formula (A vee B) ===> C. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:207, n:2, pp:383-386 [Journal]

Search in 0.001secs, Finished in 0.001secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002