Fan Chung Graham

J. Sched., October, 2025

Fan-complete Ramsey numbers.

[BibT_eX]

[DOI]

Qizhong Lin

Adv. Appl. Math., 2025

EMT: An OS Framework for New Memory Translation Architectures.

[BibT_eX]

[DOI]

Proceedings of the 19th USENIX Symposium on Operating Systems Design and Implementation, 2025

The Case for Energy Clarity.

[BibT_eX]

[DOI]

Henry Kuo

George Candea

Proceedings of the 2025 Workshop on Hot Topics in Operating Systems, 2025

2024

Quasi-Random Boolean Functions.

[BibT_eX]

[DOI]

Electron. J. Comb., 2024

Subgraph Counts in Random Clustering Graphs.

[BibT_eX]

[DOI]

Proceedings of the Modelling and Mining Networks - 19th International Workshop, 2024

2023

Forest formulas of discrete Green's functions.

[BibT_eX]

[DOI]

Ji Zeng

J. Graph Theory, 2023

A Random Graph Model for Clustering Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web Graph - 18th International Workshop, 2023

2022

Quasi-Random Influences of Boolean Functions.

[BibT_eX]

[DOI]

CoRR, 2022

2021

Permanental generating functions and sequential importance sampling.

[BibT_eX]

[DOI]

Persi Diaconis

Adv. Appl. Math., 2021

Regularity lemmas for clustering graphs.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2021

2020

Efficient Packings of Unit Squares in a Large Square.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2020

2018

Sum sequences modulo n.

[BibT_eX]

[DOI]

Jon Folkman

J. Comb. Theory A, 2018

The maximum relaxation time of a random walk.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2018

2017

The drop polynomial of a weighted digraph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

The Spectral Gap of Graphs Arising From Substring Reversals.

[BibT_eX]

[DOI]

Josh Tobin

Electron. J. Comb., 2017

2016

Decomposition of Random Graphs into Complete Bipartite Graphs.

[BibT_eX]

[DOI]

Xing Peng

SIAM J. Discret. Math., 2016

Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions.

[BibT_eX]

[DOI]

Oliver Braun

OR Spectr., 2016

A Generalized Alon-Boppana Bound and Weak Ramanujan Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

Extreme values of the stationary distribution of random walks on directed graphs.

[BibT_eX]

[DOI]

Sinan G. Aksoy

Xing Peng

Adv. Appl. Math., 2016

2015

Solving Local Linear Systems with Boundary Conditions Using Heat Kernel Pagerank.

[BibT_eX]

[DOI]

Internet Math., 2015

Finding Consensus in Multi-Agent Networks Using Heat Kernel Pagerank.

[BibT_eX]

[DOI]

CoRR, 2015

Edge flipping in the complete graph.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2015

Distributed Algorithms for Finding Local Clusters Using Heat Kernel Pagerank.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web Graph - 12th International Workshop, 2015

2014

A Brief Survey of PageRank Algorithms.

[BibT_eX]

[DOI]

IEEE Trans. Netw. Sci. Eng., 2014

Single-processor scheduling with time restrictions.

[BibT_eX]

[DOI]

Oliver Braun

J. Sched., 2014

Multicommodity Allocation for Dynamic Demands Using PageRank Vectors.

[BibT_eX]

[DOI]

Jacob Hughes

Internet Math., 2014

Ranking and Sparsifying a Connection Graph.

[BibT_eX]

[DOI]

Mark Kempton

Internet Math., 2014

Discrepancy inequalities for directed graphs.

[BibT_eX]

[DOI]

Franklin Kenter

Discret. Appl. Math., 2014

A note on an alternating upper bound for random walks on semigroups.

[BibT_eX]

[DOI]

Jacob Hughes

Discret. Appl. Math., 2014

From quasirandom graphs to graph limits and graphlets.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2014

Computing Heat Kernel Pagerank and a Local Clustering Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2013

Inversion-descent polynomials for restricted permutations.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2013

Dirichlet PageRank and Ranking Algorithms Based on Trust and Distrust.

[BibT_eX]

[DOI]

Wensong Xu

Internet Math., 2013

Solving Linear Systems with Boundary Conditions Using Heat Kernel Pagerank.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web Graph - 10th International Workshop, 2013

A Local Clustering Algorithm for Connection Graphs.

[BibT_eX]

[DOI]

Mark Kempton

Proceedings of the Algorithms and Models for the Web Graph - 10th International Workshop, 2013

Integer Sets Containing No Solution to x + y = 3z.

[BibT_eX]

[DOI]

John L. Goldwasser

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

2012

Braess's paradox in expanders.

[BibT_eX]

[DOI]

Stephen J. Young

Random Struct. Algorithms, 2012

Quasi-random hypergraphs revisited.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2012

Spectral Clustering of Graphs with General Degrees in the Extended Planted Partition Model.

[BibT_eX]

[DOI]

Kamalika Chaudhuri

Proceedings of the COLT 2012, 2012

Diameter of random spanning trees in a given graph.

[BibT_eX]

[DOI]

J. Graph Theory, 2012

Edge flipping in graphs.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2012

Ranking and Sparsifying a Connection Graph.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web Graph - 9th International Workshop, 2012

Hypergraph Coloring Games and Voter Models.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web Graph - 9th International Workshop, 2012

Multi-commodity Allocation for Dynamic Demands Using PageRank Vectors.

[BibT_eX]

[DOI]

Jacob Hughes

Proceedings of the Algorithms and Models for the Web Graph - 9th International Workshop, 2012

2011

On the Spectra of General Random Graphs.

[BibT_eX]

[DOI]

Mary Radcliffe

Electron. J. Comb., 2011

Dirichlet PageRank and Trust-Based Ranking Algorithms.

[BibT_eX]

[DOI]

Wensong Xu

Proceedings of the Algorithms and Models for the Web Graph - 8th International Workshop, 2011

Computer Networks.

[BibT_eX]

[DOI]

Edward K. Blum

Proceedings of the Computer Science, The Hardware, Software and Heart of It, 2011

2010

Descent polynomials for permutations with bounded drop size.

[BibT_eX]

[DOI]

Eur. J. Comb., 2010

Tiling Polygons with Lattice Triangles.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2010

Introduction to the Special Section on Internet and Network Economics.

[BibT_eX]

[DOI]

Xiaotie Deng

Algorithmica, 2010

Braess's Paradox in Large Sparse Graphs.

[BibT_eX]

[DOI]

Stephen J. Young

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Finding and Visualizing Graph Clusters Using PageRank Optimization.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web-Graph - 7th International Workshop, 2010

A Sharp PageRank Algorithm with Applications to Edge Ranking and Graph Sparsification.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web-Graph - 7th International Workshop, 2010

2009

Random Graphs, A Whirlwind Tour of.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Complexity and Systems Science, 2009

Packing equal squares into a large square.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2009

Distributing Antidote Using PageRank Vectors.

[BibT_eX]

[DOI]

Internet Math., 2009

Percolation in General Graphs.

[BibT_eX]

[DOI]

Internet Math., 2009

Open Letter to the Internet Mathematics Community.

[BibT_eX]

[DOI]

Anthony Bonato

Internet Math., 2009

The Giant Component in a Random Subgraph of a Given Graph.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web-Graph, 6th International Workshop, 2009

A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web-Graph, 6th International Workshop, 2009

2008

Primitive Juggling Sequences.

[BibT_eX]

[DOI]

Am. Math. Mon., 2008

Erratum: Quasi-random graphs with given degree sequences.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2008

Quasi-random graphs with given degree sequences.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2008

Four Graph Partitioning Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

A Network Coloring Game.

[BibT_eX]

[DOI]

Kamalika Chaudhuri

Mohammad Shoaib Jamall

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Invited speaker: Four graph partitioning algorithms.

[BibT_eX]

Proceedings of the 6th Workshop on Mining and Learning with Graphs, 2008

3-D floorplanning using labeled tree and dual sequences.

[BibT_eX]

[DOI]

Renshen Wang

Evangeline F. Y. Young

Proceedings of the 2008 International Symposium on Physical Design, 2008

2007

The Spectral Gap of a Random Subgraph of a Graph.

[BibT_eX]

[DOI]

Internet Math., 2007

Using PageRank to Locally Partition a Graph.

[BibT_eX]

[DOI]

Kevin J. Lang

Internet Math., 2007

The workshop on internet topology (wit) report.

[BibT_eX]

[DOI]

Alessandro Vespignani

Walter Willinger

Comput. Commun. Rev., 2007

Drawing Power Law Graphs Using a Local/Global Decomposition.

[BibT_eX]

[DOI]

Algorithmica, 2007

No-Three-in-Line-in-3D.

[BibT_eX]

[DOI]

Algorithmica, 2007

Local Partitioning for Directed Graphs Using PageRank.

[BibT_eX]

[DOI]

Kevin J. Lang

Proceedings of the Algorithms and Models for the Web-Graph, 5th International Workshop, 2007

Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2007

2006

The Volume of the Giant Component of a Random Graph with Given Expected Degrees.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2006

Parallelism versus Memory Allocation in Pipelined Router Forwarding Engines.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2006

A brief overview of network algorithms.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2006

Foreword.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2006

Maximizing data locality in distributed systems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2006

Survey: Concentration Inequalities and Martingale Inequalities: A Survey.

[BibT_eX]

[DOI]

Lincoln Lu

Internet Math., 2006

The Diameter and Laplacian Eigenvalues of Directed Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

Local Graph Partitioning using PageRank Vectors.

[BibT_eX]

[DOI]

Kevin J. Lang

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, 2006

2005

Modeling the Small-World Phenomenon with Local Network Flow.

[BibT_eX]

[DOI]

Internet Math., 2005

Oblivious and Adaptive Strategies for the Majority and Plurality Problems.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

De Bruijn cycles for covering codes.

[BibT_eX]

[DOI]

Joshua N. Cooper

Random Struct. Algorithms, 2004

Spectral Grouping Using the Nyström Method.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 2004

Analyzing the Small World Phenomenon Using a Hybrid Model with Local Network Flow (Extended Abstract).

[BibT_eX]

[DOI]

Lincoln Lu

Proceedings of the Algorithms and Models for the Web-Graph: Third International Workshop, 2004

Parallelism versus memory allocation in pipelined router forwarding engines.

[BibT_eX]

[DOI]

George Varghese

Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

On Disjoint Path Pairs with Wavelength Continuity Constraint in WDM Networks.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

Drawing Power Law Graphs.

[BibT_eX]

[DOI]

Lincoln Lu

Proceedings of the Graph Drawing, 12th International Symposium, 2004

2003

Duplication Models for Biological Networks.

[BibT_eX]

[DOI]

J. Comput. Biol., 2003

The Spectra of Random Graphs with Given Expected Degrees.

[BibT_eX]

[DOI]

Van H. Vu

Internet Math., 2003

Coupling Online and Offline Analyses for Random Power Law Graphs.

[BibT_eX]

[DOI]

Internet Math., 2003

The Average Distance in a Random Graph with Given Expected Degrees.

[BibT_eX]

[DOI]

Internet Math., 2003

Finding Favorites

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2003

2002

A chip-firing game and Dirichlet eigenvalues.

[BibT_eX]

[DOI]

Robert B. Ellis

Discret. Math., 2002

Sparse Quasi-Random Graphs.

[BibT_eX]

[DOI]

Comb., 2002

Guessing secrets with inner product questions.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Spectral Partitioning with Indefinite Kernels Using the Nyström Extension.

[BibT_eX]

[DOI]

Proceedings of the Computer Vision, 2002

2001

Dynamic location problems with limited look-ahead .

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Editor's Foreword.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2001

Distance Realization Problems with Applications to Internet Tomography.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2001

A Random Graph Model for Power Law Graphs.

[BibT_eX]

[DOI]

William Aiello

Exp. Math., 2001

The Diameter of Sparse Random Graphs.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2001

Combinatorics for the East Model.

[BibT_eX]

[DOI]

Persi Diaconis

Adv. Appl. Math., 2001

Guessing secrets.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Random Evolution in Massive Graphs.

[BibT_eX]

[DOI]

William Aiello

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000

A Harnack inequality for Dirichlet eigenvalues.

[BibT_eX]

[DOI]

J. Graph Theory, 2000

Discrete Green's Functions.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2000

Guest Editor's Foreword.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2000

A random graph model for massive graphs.

[BibT_eX]

[DOI]

William Aiello

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999

An Upper Bound for the Turán Number t3(n,4).

[BibT_eX]

[DOI]

J. Comb. Theory A, 1999

Multidiameters and Multiplicities.

[BibT_eX]

[DOI]

Charles Delorme

Patrick Solé

Eur. J. Comb., 1999

Coverings, Heat Kernels and Spanning Trees.

[BibT_eX]

[DOI]

Electron. J. Comb., 1999

Augmented Ring Networks.

[BibT_eX]

Proceedings of the SIROCCO'99, 1999

1998

Forced Convex n -Gons in the Plane.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1998

Isoperimetric Inequalities for Cartesian Products of Graphs.

[BibT_eX]

[DOI]

Prasad Tetali

Comb. Probab. Comput., 1998

Combinatorial Problems Arising in Massive Data Sets (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997

An Optimal Strategies for Cycle-Stealing in Networks of Workstations.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1997

Stratified random walks on the n-cube.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1997

Open problems of Paul Erdös in graph theory.

[BibT_eX]

[DOI]

J. Graph Theory, 1997

A Tribute to Herbert S.Wilf.

[BibT_eX]

[DOI]

Joan Hutchinson

Electron. J. Comb., 1997

Random walks on generating sets for finite groups.

[BibT_eX]

[DOI]

Electron. J. Comb., 1997

Eigenvalues, Flows and Separators of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996

On sampling with Markov chains.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1996

Scheduling Tree-Dags Using FIFO Queues: A Control-Memory Trade-Off.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1996

A Combinatorial Laplacian with Vertex Weights.

[BibT_eX]

[DOI]

Robert P. Langlands

J. Comb. Theory A, 1996

Optimal Emulations by Butterfly-Like Networks.

[BibT_eX]

[DOI]

Jia-Wei Hong

Bojana Obrenic

Eric J. Schwabe

J. ACM, 1996

Maximum subsets of (0, 1] with no solutions to x+y = kz.

[BibT_eX]

[DOI]

John L. Goldwasser

Electron. J. Comb., 1996

Discrete Isoperimetric Inequalities.

[BibT_eX]

Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

1995

Salvage-Embeddings of Complete Trees.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1995

On the Cover Polynomial of a Digraph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

Eigenvalues of Graphs and Sobolev Inequalities.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1995

1994

Even Cycles in Directed Graphs.

[BibT_eX]

[DOI]

Wayne Goddard

Daniel J. Kleitman

SIAM J. Discret. Math., 1994

An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with its Laplacian.

[BibT_eX]

[DOI]

Vance Faber

Thomas A. Manteuffel

SIAM J. Discret. Math., 1994

Reliable software and communication. I. An overview.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 1994

Chordal Completions of Planar Graphs.

[BibT_eX]

[DOI]

David Mumford

J. Comb. Theory B, 1994

A near optimal algorithm for edge separators (preliminary version).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Scheduling Trees using FIFO Queues: A Control-Memory Tradeoff.

[BibT_eX]

[DOI]

Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

1993

Communication Complexity and Quasi Randomness.

[BibT_eX]

[DOI]

Prasad Tetali

SIAM J. Discret. Math., 1993

A Note on Constructive Lower Bounds for the Ramsey Numbers R(3, t).

[BibT_eX]

[DOI]

Richard Cleve

Paul Dagum

J. Comb. Theory B, 1993

On hypergraphs having evenly distributed subhypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 1993

Routing permutations on graphs via matchings.

[BibT_eX]

[DOI]

Noga Alon

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1992

Correction to 'Optical orthogonal codes: Design, analysis, and applications' (May 89 595-604).

[BibT_eX]

Jawad A. Salehi

Victor K.-W. Wei

IEEE Trans. Inf. Theory, 1992

Efficient Embeddings of Trees in Hypercubes.

[BibT_eX]

[DOI]

SIAM J. Comput., 1992

Laplacian and vibrational spectra for homogeneous graphs.

[BibT_eX]

[DOI]

Shlomo Sternberg

J. Graph Theory, 1992

Subgraphs of a hypercube containing no small even cycles.

[BibT_eX]

[DOI]

J. Graph Theory, 1992

Quasi-Random Subsets of Integern.

[BibT_eX]

J. Comb. Theory A, 1992

Universal cycles for combinatorial structures.

[BibT_eX]

[DOI]

Persi Diaconis

Discret. Math., 1992

The Number of Different Distances Determined by a Set of Points in the Euclidean Plane.

[BibT_eX]

[DOI]

Endre Szemerédi

William T. Trotter

Discret. Comput. Geom., 1992

Graphs with Small Diameter After Edge Deletion.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

The Laplacian of a Hypergraph.

[BibT_eX]

[DOI]

Proceedings of the Expanding Graphs, 1992

Tolerating Faults in Synchronization Networks.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing: CONPAR 92, 1992

1991

Regularity Lemmas for Hypergraphs and Quasi-randomness.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1991

Quasi-random tournaments.

[BibT_eX]

[DOI]

J. Graph Theory, 1991

Partitioning Circuits for Improved Testability.

[BibT_eX]

[DOI]

Algorithmica, 1991

Chordal Completions of Grids and Planar Graphs.

[BibT_eX]

[DOI]

David Mumford

Proceedings of the Planar Graphs, 1991

1990

Quasi-Random Hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1990

Quasi-Random Classes of Hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1990

Universal graphs and induced-universal graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1990

The maximum number of edges in 2K2-free graphs of bounded degree.

[BibT_eX]

[DOI]

Discret. Math., 1990

1989

Optical orthogonal codes: Design, analysis, and applications.

[BibT_eX]

[DOI]

Jawad A. Salehi

Victor K. Wei

IEEE Trans. Inf. Theory, 1989

Pebbling in Hypercubes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1989

Universal Graphs for Bounded-Degree Trees and Planar Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1989

Graphs with small bandwidth and cutwidth.

[BibT_eX]

[DOI]

Paul D. Seymour

Discret. Math., 1989

Sphere-and-Point Incidence Relations in High Dimensions with Applications to Unit Distances and Furthest-Neighbor Pairs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1989

Quasi-random graphs.

[BibT_eX]

[DOI]

Richard M. Wilson

Comb., 1989

A dynamic location problem for graphs.

[BibT_eX]

[DOI]

Michael E. Saks

Comb., 1989

1988

On the Fractional Covering Number of Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1988

The Diameter of a Cycle Plus a Random Matching.

[BibT_eX]

[DOI]

Béla Bollobás

SIAM J. Discret. Math., 1988

Pursuit - Evasion games on graphs.

[BibT_eX]

[DOI]

Joel E. Cohen

J. Graph Theory, 1988

The average distance and the independence number.

[BibT_eX]

[DOI]

J. Graph Theory, 1988

On induced subgraphs of the cube.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1988

Explicit construction of linear sized tolerant networks.

[BibT_eX]

[DOI]

Noga Alon

Discret. Math., 1988

Optimal Simulations by Butterfly Networks (Preliminary Version)

[BibT_eX]

[DOI]

Jia-Wei Hong

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

1987

The forwarding index of communication networks.

[BibT_eX]

[DOI]

Edward G. Coffman Jr.

Martin I. Reiman

Burton Simon

IEEE Trans. Inf. Theory, 1987

On unavoidable hypergraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1987

Highly irregular graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1987

The maximum number of edges in a 3-graph not containing a given star.

[BibT_eX]

[DOI]

Peter Frankl

Graphs Comb., 1987

1986

Minced Trees, with Applications to Fault-Tolerant VLSI Processor Arrays.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1986

Some intersection theorems for ordered sets and graphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1986

Monotone subsequences in (0, 1)-matrices.

[BibT_eX]

[DOI]

Peter C. Fishburn

Victor K. Wei

Graphs Comb., 1986

Optimal Simulations of Tree Machines (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1985

Strongly connected orientations of mixed multigraphs.

[BibT_eX]

[DOI]

Michael R. Garey

Robert Endre Tarjan

Networks, 1985

Extremal subgraphs for two graphs.

[BibT_eX]

[DOI]

Joel H. Spencer

J. Comb. Theory B, 1985

Quantitative Forms of a Theorem of Hilbert.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1985

On the addressing problem for directed graphs.

[BibT_eX]

[DOI]

Peter M. Winkler

Graphs Comb., 1985

Self-Organizing Sequential Search and Hilbert's Inequalities

[BibT_eX]

[DOI]

D. J. Hajela

Paul D. Seymour

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

1984

Diameter bounds for altered graphs.

[BibT_eX]

[DOI]

M. R. Garey

J. Graph Theory, 1984

The Number of Different Distances Determined by n Points in the Plane.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1984

Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs.

[BibT_eX]

[DOI]

A. Robert Calderbank

Dean G. Sturtevant

Discret. Math., 1984

1983

A survey of bounds for classical Ramsey numbers.

[BibT_eX]

[DOI]

Charles M. Grinstead

J. Graph Theory, 1983

On a Ramsey-type problem.

[BibT_eX]

[DOI]

J. Graph Theory, 1983

Unavoidable Stars in 3-Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1983

Edge-colored complete graphs with precisely colored subgraphs.

[BibT_eX]

[DOI]

Comb., 1983

On unavoidable graphs.

[BibT_eX]

[DOI]

Comb., 1983

1982

Minimal Decompositions of Hypergraphs into Mutually Isomorphic Subhypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1982

1981

A note on constructive methods for ramsey numbers.

[BibT_eX]

[DOI]

J. Graph Theory, 1981

Universal caterpillars.

[BibT_eX]

[DOI]

James B. Shearer

J. Comb. Theory B, 1981

Minimal decompositions of graphs into mutually isomorphic subgraphs.

[BibT_eX]

[DOI]

Comb., 1981

1980

The Connection Patterns of Two Complete Binary Trees.

[BibT_eX]

[DOI]

Frank K. Hwang

SIAM J. Algebraic Discret. Methods, 1980

On Unimodality for Linear Extensions of Partial Orders.

[BibT_eX]

[DOI]

Peter C. Fishburn

SIAM J. Algebraic Discret. Methods, 1980

On Unimodal Subsequences.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1980

On the coverings of graphs.

[BibT_eX]

[DOI]

Discret. Math., 1980

1979

The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter.

[BibT_eX]

[DOI]

Frank K. Hwang

Networks, 1979

1978

Optimal Multistage Switching Networks.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1978

The Number of Baxter Permutations.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1978

On graphs which contain all small trees.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1978

On partitions of graphs into trees.

[BibT_eX]

[DOI]

Discret. Math., 1978

1977

A problem on blocking probabilities in connecting networks.

[BibT_eX]

[DOI]

Frank K. Hwang

Networks, 1977

Some results on hook lengths.

[BibT_eX]

[DOI]

Joan E. Herman

Discret. Math., 1977

1975

Optimal rearrangeable graphs.

[BibT_eX]

[DOI]

Bell Syst. Tech. J., 1975

1973

On the ramsey numbers N(3, 3, ...3;2).

[BibT_eX]

[DOI]