The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Adam Idzik: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Adam Idzik, Zsolt Tuza
    Heredity properties of connectedness in edge-coloured complete graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:301-306 [Journal]
  2. Adam Idzik, Gyula O. H. Katona, Rajiv Vohra
    Intersecting Balanced Families of Sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:93, n:2, pp:281-291 [Journal]
  3. Adam Idzik, Jan Komar, Marcin Malawski
    Edge-coloured complete graphs: Connectedness of some subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:1-2, pp:119-125 [Journal]
  4. Stanislaw Bylka, Adam Idzik, Zsolt Tuza
    Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdös inequality. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:39-58 [Journal]

  5. Communication in m-connected graphs. [Citation Graph (, )][DBLP]


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