The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Kathie Cameron: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Kathie Cameron
    Connected Matchings. [Citation Graph (0, 0)][DBLP]
    Combinatorial Optimization, 2001, pp:34-38 [Conf]
  2. Kathie Cameron, Jack Edmonds
    Some Graphic Uses of an Even Number of Odd Nodes. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:872- [Conf]
  3. Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan
    The list partition problem for graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:391-399 [Conf]
  4. Rodica Boliac, Kathie Cameron, Vadim V. Lozin
    On computing the dissociation number and the induced matching number of bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:72, n:, pp:- [Journal]
  5. Kathie Cameron
    A Min-Max Relation for Monotone Path Systems in Simple Regions. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:3, pp:435-440 [Journal]
  6. Kathie Cameron, Horst Sachs
    Monotone Path Systems in Simple Regions. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1994, v:14, n:1, pp:1-21 [Journal]
  7. Anthony Bonato, Kathie Cameron
    On an adjacency property of almost all graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:231, n:1-3, pp:103-119 [Journal]
  8. Kathie Cameron
    Thomason's algorithm for finding a second hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:69-77 [Journal]
  9. Kathie Cameron
    Induced matchings in intersection graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:278, n:1-3, pp:1-9 [Journal]
  10. Kathie Cameron, R. Sritharan, Yingwen Tang
    Finding a maximum induced matching in weakly chordal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:266, n:1-3, pp:133-142 [Journal]
  11. Kathie Cameron, Tracy Walker
    The graphs with maximum induced matching and maximum matching the same size. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:299, n:1-3, pp:49-55 [Journal]
  12. Anthony Bonato, Kathie Cameron
    On an adjacency property of almost all tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:19-20, pp:2327-2335 [Journal]
  13. Kathie Cameron, Chính T. Hoàng
    On the structure of certain intersection graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:99, n:2, pp:59-63 [Journal]
  14. Kathie Cameron, Pavol Hell
    Independent packings in structured graphs. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:201-213 [Journal]
  15. Kathie Cameron
    A min-max relation for the partial q- colourings of a graph. Part II: Box perfection. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:74, n:1-2, pp:15-27 [Journal]
  16. Kathie Cameron
    Coloured matchings in bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:169, n:1-3, pp:205-209 [Journal]
  17. Kathie Cameron, Jack Edmonds
    Coflow polyhedra. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:1-21 [Journal]

  18. Intermediate Trees. [Citation Graph (, )][DBLP]


  19. Coloring vertices of a graph or finding a Meyniel obstruction [Citation Graph (, )][DBLP]


  20. Asteroids in rooted and directed path graphs [Citation Graph (, )][DBLP]


  21. Induced matchings. [Citation Graph (, )][DBLP]


  22. Brambles and independent packings in chordal graphs. [Citation Graph (, )][DBLP]


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