Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Greenhill, Catherine"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Asymptotic enumeration of sparse multigraphs with given degrees
Catherine Greenhill
,
Brendan D. McKay
SIAM Journal on Discrete Mathematics
27
(4), 2013, pp. 2064-2089
Asymptotic enumeration of dense 0-1 matrices with specified line sums
E. Rodney Canfield
,
Catherine Greenhill
,
Brendan D. McKay
Journal of Combinatorial Theory Series A
115
(1), 2008, pp. 32-66
The generalized acyclic edge chromatic number of random regular graphs
Stefanie Gerke
,
Catherine Greenhill
,
Nicholas Wormald
Journal of Graph Theory
53
(2), 2006, pp. 101-125
Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums
Catherine Greenhill
,
Brendan D. McKay
,
Xiaoji Wang
Journal of Combinatorial Theory Series A
113
(2), 2006, pp. 291-324
Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
Catherine Greenhill
,
Oleg Pikhurko
Graphs and Combinatorics
21
(4), 2005, pp. 407-419
The relative complexity of approximate counting problems
Martin Dyer
,
Leslie Ann Goldberg
,
Catherine Greenhill
,
Mark Jerrum
Algorithmica
38
(3), 2004, pp. 471-500
Hamiltonian decompositions of random bipartite regular graphs
Catherine Greenhill
,
Jeong Han Kim
,
Nicholas C. Wormald
Journal of Combinatorial Theory Series B
90
(2), 2004, pp. 195-222
Random hypergraph processes with degree restrictions
Catherine Greenhill
,
Andrzej RuciĆski
,
Nicholas C. Wormald
Graphs and Combinatorics
20
(3), 2004, pp. 319-332
An extension of path coupling and its application to the Glauber dynamics for graph colorings
Martin Dyer
,
Leslie Ann Goldberg
,
Catherine Greenhill
,
Mark Jerrum
,
Michael Mitzenmacher
SIAM Journal on Computing
30
(6), 2001, pp. 1962-1975
On Markov chains for independent sets
Martin Dyer
,
Catherine Greenhill
Journal of Algorithms
35
(1), 2000, pp. 17-49
Polynomial-time counting and sampling of two-rowed contingency tables
Martin Dyer
,
Catherine Greenhill
Theoretical Computer Science
246
(1-2), 2000, pp. 265-278
On approximately counting colorings of small degree graphs
Russ Bubley
,
Martin Dyer
,
Catherine Greenhill
,
Mark Jerrum
SIAM Journal on Computing
29
(2), 1999, pp. 387-400
Beating the
2\Delta
bound for approximately counting colourings: A computer-assisted proof of rapid mixing
Russ Bubley
,
Martin Dyer
,
Catherine Greenhill
Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'98 (San Francisco, California, January 25-27, 1998)
, 1998, pp. 355-363
A genuinely polynomial-time algorithm for sampling two-rowed contingency tables
Martin Dyer
,
Catherine Greenhill
Lecture Notes in Computer Science
1443
, 1998, pp. 339-350
Theoretical and experimental comparison of efficiency of finite field extensions
Catherine S. Greenhill
Journal Symbolic Computation
20
(4), 1995, pp. 419-429