Paul N. Balister

Ali Dogan

Graphs Comb., May, 2024

Subcritical monotone cellular automata.

[BibT_eX]

[DOI]

Random Struct. Algorithms, January, 2024

2023

Counting partitions of G n , 1 / 2 $$ {G}_{n,1/2} $$ with degree congruence conditions.

[BibT_eX]

[DOI]

Random Struct. Algorithms, May, 2023

2022

A Note on Infinite Antichain Density.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

2019

The asymptotic number of prefix normal words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Dense subgraphs in random graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2018

Line percolation.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2018

On the edge spectrum of saturated graphs for paths and stars.

[BibT_eX]

[DOI]

Ali Dogan

J. Graph Theory, 2018

Decompositions of graphs into cycles with chords.

[BibT_eX]

[DOI]

Hao Li

J. Comb. Theory B, 2018

Introduction.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2018

2017

Catching a fast robber on the grid.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2017

Sentry selection in sensor networks: theory and algorithms.

[BibT_eX]

[DOI]

Int. J. Sens. Networks, 2017

2016

Random Hypergraph Irregularity.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Barrier Coverage.

[BibT_eX]

[DOI]

Amites Sarkar

Random Struct. Algorithms, 2016

Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs.

[BibT_eX]

[DOI]

Karen Gunderson

Eur. J. Comb., 2016

Catching a fast robber on the grid.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Introduction.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2015

Controllability and matchings in random bipartite graphs.

[BibT_eX]

[DOI]

Proceedings of the Surveys in Combinatorics 2015, 2015

2014

Interference percolation.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2014

2013

Repeated Degrees in Random Uniform Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

2012

Critical Probabilities of 1-Independent Percolation Models.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2012

Projections, entropy and sumsets.

[BibT_eX]

[DOI]

Comb., 2012

2011

Random Partial Orders Defined by Angular Domains.

[BibT_eX]

[DOI]

Balázs Patkós

Order, 2011

Coloring vertices and edges of a graph by nonempty subsets of a set.

[BibT_eX]

[DOI]

Ervin Györi

Eur. J. Comb., 2011

Multi-path Routing Metrics for Reliable Wireless Mesh Routing Topologies

[BibT_eX]

[DOI]

Phoebus Chen

Karl Henrik Johansson

Shankar Sastry

CoRR, 2011

Energy-latency tradeoff for in-network function computation in random networks.

[BibT_eX]

[DOI]

Animashree Anandkumar

Alan S. Willsky

Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

2010

Random majority percolation.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2010

Bond percolation with attenuation in high dimensional Voronoi tilings.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2010

The Linus Sequence.

[BibT_eX]

[DOI]

Steve Kalikow

Amites Sarkar

Comb. Probab. Comput., 2010

2009

Convex Sets in Acyclic Digraphs.

[BibT_eX]

[DOI]

Gregory Z. Gutin

Order, 2009

Algorithms for generating convex sets in acyclic digraphs.

[BibT_eX]

[DOI]

Arezou Soleimanfallah

Anders Yeo

J. Discrete Algorithms, 2009

Highly connected random geometric graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Trap Coverage: Allowing Coverage Holes of Bounded Diameter in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

Random vs. Deterministic Deployment of Sensors in the Presence of Failures and Placement Errors.

[BibT_eX]

[DOI]

Santosh Kumar

Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2008

Sequences with Changing Dependencies.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Connectivity of addable graph classes.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

Connectivity of a Gaussian network.

[BibT_eX]

[DOI]

Int. J. Ad Hoc Ubiquitous Comput., 2008

Connected graphs without long paths.

[BibT_eX]

[DOI]

Discret. Math., 2008

2007

Adjacent Vertex Distinguishing Edge-Colorings.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

The generalized Randic index of trees.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

Reliable density estimates for coverage and connectivity in thin strips of finite length.

[BibT_eX]

[DOI]

Proceedings of the 13th Annual International Conference on Mobile Computing and Networking, 2007

2006

Large deviations for mean field models of probabilistic cellular automata.

[BibT_eX]

[DOI]

Robert Kozma

Random Struct. Algorithms, 2006

Ramsey unsaturated and saturated graphs.

[BibT_eX]

[DOI]

Jenö Lehel

J. Graph Theory, 2006

Mono-multi bipartite Ramsey numbers, designs, and matrices.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2006

Pair dominating graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2006

2005

Continuum percolation with steps in the square or the disc.

[BibT_eX]

[DOI]

Mark Walters

Random Struct. Algorithms, 2005

Percolation in Voronoi tilings.

[BibT_eX]

[DOI]

Anthony Quas

Random Struct. Algorithms, 2005

Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions.

[BibT_eX]

[DOI]

Biol. Cybern., 2005

2004

Balanced edge colorings.

[BibT_eX]

[DOI]

Alexandr V. Kostochka

Hao Li

J. Comb. Theory B, 2004

Longest Paths in Circular Arc Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2004

Fast transmission in ad hoc networks.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Neuropercolation: A Random Cellular Automata Approach to Spatio-temporal Neurodynamics.

[BibT_eX]

[DOI]

Proceedings of the Cellular Automata, 2004

2003

Vertex-distinguishing edge colorings of graphs.

[BibT_eX]

[DOI]

O. M. Riordan

J. Graph Theory, 2003

Graphs with large maximum degree containing no odd cycles of a given length.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

Packing closed trails into dense graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

Packing Digraphs With Directed Closed Trails.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

2002

Vertex-distinguishing edge colorings of random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2002

A note on Ramsey size-linear graphs.

[BibT_eX]

[DOI]

Miklós Simonovits

J. Graph Theory, 2002

Zero-sum Square Matrices.

[BibT_eX]

[DOI]

Eur. J. Comb., 2002

The Interlace Polynomial of Graphs at - 1.

[BibT_eX]

[DOI]

Eur. J. Comb., 2002

Vertex distinguishing colorings of graphs with Delta(G)=2.

[BibT_eX]

[DOI]

Discret. Math., 2002

2001

Alternating Knot Diagrams, Euler Circuits and the Interlace Polynomial.

[BibT_eX]

[DOI]

Eur. J. Comb., 2001

Packing Circuits Into KN.

[BibT_eX]

Comb. Probab. Comput., 2001

On The Alspach Conjecture.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2001

1999

Counting Boundary Paths for Oriented Percolation Clusters.

[BibT_eX]

[DOI]

Alan Stacey

Random Struct. Algorithms, 1999

1994

Improved Upper Bounds for the Critical Probability of Oriented Percolation in Two Dimensions.

[BibT_eX]

[DOI]