2008 |
25 | EE | Kathie Cameron,
Chính T. Hoàng,
Benjamin Lévêque:
Asteroids in rooted and directed path graphs
CoRR abs/0812.2734: (2008) |
24 | EE | Kathie Cameron,
Jack Edmonds:
The travelling preacher, projection, and a lower bound for the stability number of a graph.
Discrete Optimization 5(2): 290-292 (2008) |
2007 |
23 | EE | Kathie Cameron,
Elaine M. Eschen,
Chính T. Hoàng,
R. Sritharan:
The Complexity of the List Partition Problem for Graphs.
SIAM J. Discrete Math. 21(4): 900-929 (2007) |
2006 |
22 | EE | Anthony Bonato,
Kathie Cameron:
On an adjacency property of almost all tournaments.
Discrete Mathematics 306(19-20): 2327-2335 (2006) |
21 | EE | Kathie Cameron,
Chính T. Hoàng:
On the structure of certain intersection graphs.
Inf. Process. Lett. 99(2): 59-63 (2006) |
20 | EE | Kathie Cameron,
Pavol Hell:
Independent packings in structured graphs.
Math. Program. 105(2-3): 201-213 (2006) |
2005 |
19 | EE | Kathie Cameron,
Jack Edmonds,
Benjamin Lévêque,
Frédéric Maffray:
Coloring vertices of a graph or finding a Meyniel obstruction
CoRR abs/cs/0509023: (2005) |
18 | EE | Kathie Cameron,
Tracy Walker:
The graphs with maximum induced matching and maximum matching the same size.
Discrete Mathematics 299(1-3): 49-55 (2005) |
17 | EE | Kathie Cameron,
Jack Edmonds:
Colouring Some Classes of Perfect Graphs Robustly.
Electronic Notes in Discrete Mathematics 22: 553-556 (2005) |
2004 |
16 | EE | Kathie Cameron,
Elaine M. Eschen,
Chính T. Hoàng,
R. Sritharan:
The list partition problem for graphs.
SODA 2004: 391-399 |
15 | | Rodica Boliac,
Kathie Cameron,
Vadim V. Lozin:
On computing the dissociation number and the induced matching number of bipartite graphs.
Ars Comb. 72: (2004) |
14 | EE | Kathie Cameron:
Induced matchings in intersection graphs.
Discrete Mathematics 278(1-3): 1-9 (2004) |
2003 |
13 | EE | Kathie Cameron,
R. Sritharan,
Yingwen Tang:
Finding a maximum induced matching in weakly chordal graphs.
Discrete Mathematics 266(1-3): 133-142 (2003) |
2001 |
12 | EE | Kathie Cameron:
Connected Matchings.
Combinatorial Optimization 2001: 34-38 |
11 | EE | Anthony Bonato,
Kathie Cameron:
On an adjacency property of almost all graphs.
Discrete Mathematics 231(1-3): 103-119 (2001) |
10 | EE | 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.
Discrete Mathematics 235(1-3): 69-77 (2001) |
2000 |
9 | EE | Kathie Cameron:
A Min-Max Relation for Monotone Path Systems in Simple Regions.
Combinatorica 20(3): 435-440 (2000) |
8 | EE | Anthony Bonato,
Kathie Cameron:
On 2-e.c. graphs, tournaments, and hypergraphs.
Electronic Notes in Discrete Mathematics 5: 31-34 (2000) |
7 | EE | Kathie Cameron:
Induced Matchings in Intersection Graphs.
Electronic Notes in Discrete Mathematics 5: 50-52 (2000) |
1999 |
6 | EE | Kathie Cameron,
Jack Edmonds:
Some Graphic Uses of an Even Number of Odd Nodes.
SODA 1999: 872 |
1997 |
5 | EE | Kathie Cameron:
Coloured matchings in bipartite graphs.
Discrete Mathematics 169(1-3): 205-209 (1997) |
1994 |
4 | | Kathie Cameron,
Horst Sachs:
Monotone Path Systems in Simple Regions.
Combinatorica 14(1): 1-21 (1994) |
1992 |
3 | EE | Kathie Cameron,
Jack Edmonds:
Coflow polyhedra.
Discrete Mathematics 101(1-3): 1-21 (1992) |
1989 |
2 | EE | Kathie Cameron:
Induced matchings.
Discrete Applied Mathematics 24(1-3): 97-102 (1989) |
1 | EE | Kathie Cameron:
A min-max relation for the partial q- colourings of a graph. Part II: Box perfection.
Discrete Mathematics 74(1-2): 15-27 (1989) |