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

Search the dblp DataBase

Title:
Author:
Maria Chudnovsky: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Maria Chudnovsky, Paul D. Seymour
    The structure of claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Surveys in Combinatorics, 2005, pp:153-171 [Conf]
  2. Maria Chudnovsky, Gérard Cornuéjols, Xinming Liu, Paul D. Seymour, Kristina Vuskovic
    Recognizing Berge Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2005, v:25, n:2, pp:143-186 [Journal]
  3. Maria Chudnovsky, Paul D. Seymour
    The roots of the independence polynomial of a clawfree graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2007, v:97, n:3, pp:350-357 [Journal]
  4. Maria Chudnovsky, Ken-ichi Kawarabayashi, Paul D. Seymour
    Detecting even holes. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:2, pp:85-111 [Journal]
  5. Maria Chudnovsky
    Berge trigraphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:53, n:1, pp:1-55 [Journal]
  6. Maria Chudnovsky, Alexandra Ovetsky
    Coloring quasi-line graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2007, v:54, n:1, pp:41-50 [Journal]
  7. Maria Chudnovsky, Paul D. Seymour
    Testing for a theta. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:595-598 [Conf]
  8. Maria Chudnovsky, Jim Geelen, Bert Gerards, Luis A. Goddyn, Michael Lohman, Paul D. Seymour
    Packing Non-Zero A-Paths In Group-Labelled Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:5, pp:521-532 [Journal]
  9. Maria Chudnovsky, Paul D. Seymour
    Claw-free graphs. I. Orientable prismatic graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2007, v:97, n:6, pp:867-903 [Journal]

  10. Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory. [Citation Graph (, )][DBLP]


  11. An algorithm for packing non-zero A -paths in group-labelled graphs. [Citation Graph (, )][DBLP]


  12. Cycles in dense digraphs. [Citation Graph (, )][DBLP]


  13. Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs. [Citation Graph (, )][DBLP]


  14. Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs. [Citation Graph (, )][DBLP]


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
 
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