Graham R. Brightwell

Svante Janson

Malwina J. Luczak

Random Struct. Algorithms, 2017

2015

The Reversal Ratio of a Poset.

[BibT_eX]

[DOI]

Mitchel T. Keller

Order, 2015

2013

Diametral Pairs of Linear Extensions.

[BibT_eX]

[DOI]

Mareike Massow

SIAM J. Discret. Math., 2013

Ramsey-goodness - and otherwise.

[BibT_eX]

[DOI]

Peter Allen

Jozef Skokan

Comb., 2013

The Dimension of Random Graph Orders.

[BibT_eX]

[DOI]

Proceedings of the Mathematics of Paul Erdős II, 2013

2012

Extremal subgraphs of random graphs.

[BibT_eX]

[DOI]

Konstantinos Panagiotou

Angelika Steger

Random Struct. Algorithms, 2012

Order-Invariant Measures on Fixed Causal Sets.

[BibT_eX]

[DOI]

Malwina J. Luczak

Comb. Probab. Comput., 2012

2011

Shadows of ordered graphs.

[BibT_eX]

[DOI]

Robert Morris

J. Comb. Theory A, 2011

Permutation Capacities and Oriented Infinite Paths.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

2010

Permutation Capacities of Families of Oriented Infinite Paths.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Continuum limits for classical sequential growth models.

[BibT_eX]

[DOI]

Nicholas Georgiou

Random Struct. Algorithms, 2010

Average relational distance in linear extensions of posets.

[BibT_eX]

[DOI]

Viresh Patel

Discret. Math., 2010

2009

Submodular Percolation.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2009

Introduction.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2009

2006

How many graphs are unions of <i>k</i>-cliques?

[BibT_eX]

[DOI]

J. Graph Theory, 2006

Dominating sets in k-majority tournaments.

[BibT_eX]

[DOI]

Noga Alon

Hal A. Kierstead

Alexandr V. Kostochka

J. Comb. Theory B, 2006

A Linear Bound On The Diameter Of The Transportation Polytope.

[BibT_eX]

[DOI]

Jan van den Heuvel

Leen Stougie

Comb., 2006

2005

Counting Eulerian Circuits is #P-Complete.

[BibT_eX]

[DOI]

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2004

A second threshold for the hard-core model on a Bethe lattice.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2004

Note on Counting Eulerian Circuits

[BibT_eX]

[DOI]

CoRR, 2004

2003

The number of k-SAT functions.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2003

The Number of Linear Extensions of the Boolean Lattice.

[BibT_eX]

[DOI]

Prasad Tetali

Order, 2003

Reserving resilient capacity for a single commodity with upper-bound constraints.

[BibT_eX]

[DOI]

Gianpaolo Oriolo

F. Bruce Shepherd

Networks, 2003

Thresholds for families of multisets, with an application to graph pebbling.

[BibT_eX]

[DOI]

Discret. Math., 2003

Special Issue on Ramsey Theory.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

2002

A combinatorial approach to correlation inequalities.

[BibT_eX]

[DOI]

William T. Trotter

Discret. Math., 2002

2001

Reserving Resilient Capacity in a Network.

[BibT_eX]

[DOI]

Gianpaolo Oriolo

F. Bruce Shepherd

SIAM J. Discret. Math., 2001

Graph Homomorphisms and Long Range Action.

[BibT_eX]

[DOI]

Proceedings of the Graphs, 2001

2000

Gibbs Measures and Dismantlable Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2000

1999

Partially Ordered Sets.

[BibT_eX]

[DOI]

Douglas B. West

Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

Graph Homomorphisms and Phase Transitions.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1999

Geometrical Techniques for Estimating Numbers of Linear Extensions.

[BibT_eX]

[DOI]

Alexander F. Sidorenko

Eur. J. Comb., 1999

Forbidden induced partial orders.

[BibT_eX]

[DOI]

David A. Grable

Hans Jürgen Prömel

Discret. Math., 1999

Balanced pairs in partial orders.

[BibT_eX]

[DOI]

Discret. Math., 1999

1997

The Order Dimension of Planar Maps.

[BibT_eX]

[DOI]

William T. Trotter

SIAM J. Discret. Math., 1997

The Structure of Random Graph Orders.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1997

Random Walks and Electrical Resistances in Products of Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

1996

The Average Number of Linear Extensions of a Partial Order.

[BibT_eX]

[DOI]

Hans Jürgen Prömel

Angelika Steger

J. Comb. Theory A, 1996

Multilayer Neural Networks: One or Two Hidden Layers?

[BibT_eX]

[DOI]

Claire Kenyon

Hélène Paugam-Moisy

Proceedings of the Advances in Neural Information Processing Systems 9, 1996

1995

Random Graph Orders Do Not Satisfy a 0-1 Law.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1995

The vapnik-chervonenkis dimension of a random graph.

[BibT_eX]

[DOI]

Martin Anthony

Colin Cooper

Discret. Math., 1995

On Specifying Boolean Functions by Labelled Examples.

[BibT_eX]

[DOI]

Martin Anthony

John Shawe-Taylor

Discret. Appl. Math., 1995

The dual of a circle order is not necessarilty a circle order.

[BibT_eX]

Edward R. Scheinerman

Ars Comb., 1995

1994

Linear extensions of random orders.

[BibT_eX]

[DOI]

Discret. Math., 1994

1993

The Order Dimension of Convex Polytopes.

[BibT_eX]

[DOI]

William T. Trotter

SIAM J. Discret. Math., 1993

Representations of Planar Graphs.

[BibT_eX]

[DOI]

Edward R. Scheinerman

SIAM J. Discret. Math., 1993

Ramsey Properties of Orientations of Graphs.

[BibT_eX]

[DOI]

Yoshiharu Kohayakawa

Random Struct. Algorithms, 1993

Cycles through specified vertices.

[BibT_eX]

[DOI]

Comb., 1993

1992

The 1/3-2/3 Conjecture for 5-Thin Posets.

[BibT_eX]

[DOI]

Colin Wright

SIAM J. Discret. Math., 1992

Target Shooting with Programmed Random Variables

[BibT_eX]

[DOI]

Teunis J. Ott

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

On Exact Specification by Examples.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

1991

Reorientations of covering graphs.

[BibT_eX]

[DOI]

Jaroslav Nesetril

Discret. Math., 1991

Counting Linear Extensions is #P-Complete

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

1990

Parallel Selection with High Probability.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1990

Maximum itting Time for Random Walks on Graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1990

Extremal cover times for random walks on trees.

[BibT_eX]

[DOI]

J. Graph Theory, 1990

Events correlated with respect to every subposet of a fixed poset.

[BibT_eX]

[DOI]

Graphs Comb., 1990

1989

Long cycles in graphs with no subgraphs of minimal degree 3.

[BibT_eX]

[DOI]

Discret. Math., 1989

1988

Transitive Orientations of Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 1988

Linear extensions of infinite posets.

[BibT_eX]

[DOI]