Andrzej Czygrinow

J. Graph Theory, 2016

On the distributed complexity of the semi-matching problem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2016

2015

An Extension of the Hajnal-Szemerédi Theorem to Directed Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2015

2014

Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs.

[BibT_eX]

[DOI]

Theodore Molla

SIAM J. Discret. Math., 2014

Tiling 3-Uniform Hypergraphs With K43-2e.

[BibT_eX]

[DOI]

Louis DeBiasio

J. Graph Theory, 2014

On directed versions of the Corrádi-Hajnal corollary.

[BibT_eX]

[DOI]

Hal A. Kierstead

Theodore Molla

Eur. J. Comb., 2014

Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

2012

Tight Co-Degree Condition for Perfect Matchings in 4-Graphs.

[BibT_eX]

[DOI]

Vikram Kamat

Electron. J. Comb., 2012

Distributed 2-Approximation Algorithm for the Semi-matching Problem.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 26th International Symposium, 2012

2011

A Note on Bipartite Graph Tiling.

[BibT_eX]

[DOI]

Louis DeBiasio

SIAM J. Discret. Math., 2011

On random sampling in uniform hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2011

Brief Announcement: Distributed Approximations for the Semi-matching Problem.

[BibT_eX]

[DOI]

Krzysztof Krzywdzinski

Wojciech Wawrzyniak

Proceedings of the Distributed Computing - 25th International Symposium, 2011

2010

2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees.

[BibT_eX]

[DOI]

Louis DeBiasio

Hal A. Kierstead

SIAM J. Discret. Math., 2010

2009

Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

On the pebbling threshold of paths and the pebbling threshold spectrum.

[BibT_eX]

[DOI]

Glenn H. Hurlbert

Discret. Math., 2008

Fast Distributed Approximations in Planar Graphs.

[BibT_eX]

[DOI]

Wojciech Wawrzyniak

Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Distributed packing in planar graphs.

[BibT_eX]

[DOI]

Wojciech Wawrzyniak

Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

2007

Distributed Approximations for Packing in Unit-Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 21st International Symposium, 2007

Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006

Girth, Pebbling, and Grid Thresholds.

[BibT_eX]

[DOI]

Glenn Hurlbert

SIAM J. Discret. Math., 2006

Distributed algorithms for weighted problems in sparse graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2006

Distributed Approximation Algorithms in Unit-Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 20th International Symposium, 2006

Distributed Almost Exact Approximations for Minor-Closed Families.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2006

Distributed Approximation Algorithms for Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2004

Strong edge colorings of uniform graphs.

[BibT_eX]

[DOI]

Discret. Math., 2004

Bounding the strong chromatic index of dense random graphs.

[BibT_eX]

[DOI]

Discret. Math., 2004

Distributed algorithm for approximating the maximum matching.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

A Fast Distributed Algorithm for Approximating the Maximum Matching.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2004

2003

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

[BibT_eX]

[DOI]

Discret. Math., 2003

Matrix-Free Proof of a Regularity Characterization.

[BibT_eX]

[DOI]

Electron. J. Comb., 2003

Pebbling in dense graphs.

[BibT_eX]

[DOI]

Glenn Hurlbert

Australas. J Comb., 2003

Distributed Algorithm for Better Approximation of the Maximum Matching.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002

A Note on Graph Pebbling.

[BibT_eX]

[DOI]

Graphs Comb., 2002

2-factors in dense bipartite graphs.

[BibT_eX]

[DOI]

Henry A. Kierstead

Discret. Math., 2002

On pebbling threshold functions for graph sequences.

[BibT_eX]

[DOI]

Discret. Math., 2002

Partitioning problems in dense hypergraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

2001

Spanning Trees of Bounded Degree.

[BibT_eX]

[DOI]

Electron. J. Comb., 2001

Distributed O(Delta log(n))-Edge-Coloring Algorithm.

[BibT_eX]

[DOI]

Michal Karonski

Proceedings of the Algorithms, 2001

2000

An Algorithmic Regularity Lemma for Hypergraphs.

[BibT_eX]

[DOI]

Vojtech Rödl

SIAM J. Comput., 2000

Maximum dispersion problem in dense graphs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2000

The Polling Primitive for Computer Networks.

[BibT_eX]

Michal Karonski

Vaidy S. Sunderam

Informatica (Slovenia), 2000

1999

Constructive Quasi-Ramsey Numbers and Tournament Ranking.

[BibT_eX]

[DOI]

Svatopluk Poljak

Vojtech Rödl

SIAM J. Discret. Math., 1999

1995

The polling primitive for hypercube networks.

[BibT_eX]

[DOI]