Raphael Yuster

J. Comb. Theory B, 2026

Acyclic subgraphs of digraphs with high chromatic number.

[BibT_eX]

[DOI]

Eur. J. Comb., 2026

Simultaneous separation in bounded degree trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2026

Maintaining a Kingdom in a Tournament.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2026: Theory and Practice of Computer Science, 2026

2025

Finding and counting small tournaments in large tournaments.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2025

On Tournament Inversion.

[BibT_eX]

[DOI]

J. Graph Theory, 2025

On the Minimum Density of Monotone Subwords.

[BibT_eX]

[DOI]

Electron. J. Comb., 2025

2024

Flip colouring of graphs.

[BibT_eX]

[DOI]

Graphs Comb., December, 2024

Packing and Covering a Given Directed Graph in a Directed Graph.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., March, 2024

Path-monochromatic bounded depth rooted trees in (random) tournaments.

[BibT_eX]

[DOI]

Discret. Math., 2024

Highly Connected Graphs Have Highly Connected Spanning Bipartite Subgraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2024

2023

Sum-distinguishing number of sparse hypergraphs.

[BibT_eX]

[DOI]

Maria Axenovich

Eur. J. Comb., August, 2023

The number of bounded-degree spanning trees.

[BibT_eX]

[DOI]

Random Struct. Algorithms, May, 2023

2022

On the quartet distance given partial information.

[BibT_eX]

[DOI]

Osnat Weissberg

J. Graph Theory, 2022

Hamiltonian cycles above expectation in r-graphs and quasi-random r-graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

Ramsey number of 1-subdivisions of transitive tournaments.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

The Covering Threshold of a Directed Acyclic Graph by Directed Acyclic Subgraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

Counting Homomorphic Cycles in Degenerate Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

All Feedback Arc Sets of a Random Turán Tournament Have $\lfloor {n}/{k}\rfloor-{k}+1$ Disjoint k-Cliques (and This Is Tight).

[BibT_eX]

[DOI]

Safwat Nassar

SIAM J. Discret. Math., 2021

Paths with many shortcuts in tournaments.

[BibT_eX]

[DOI]

Discret. Math., 2021

On Factors of Independent Transversals in $k$-Partite Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

2020

A 2O(k)n algorithm for k-cycle in minor-closed graph families.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Incremental distance products via faulty shortest paths.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

Induced subgraphs with many repeated degrees.

[BibT_eX]

[DOI]

Discret. Math., 2020

Perfect sequence covering arrays.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2020

A 2O(k)n algorithm for k-cycle in minor-closed graph families.

[BibT_eX]

[DOI]

CoRR, 2020

Covering Small Subgraphs of (Hyper)Tournaments with Spanning Acyclic Subgraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

2019

On the exact maximum induced density of almost all graphs and their inducibility.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

The removal lemma for tournaments.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

Acyclic subgraphs with high chromatic number.

[BibT_eX]

[DOI]

Safwat Nassar

Eur. J. Comb., 2019

Clumsy Packings of Graphs.

[BibT_eX]

[DOI]

Maria Axenovich

Anika Kaufmann

Electron. J. Comb., 2019

Vector clique decompositions.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

The Effect of Local Majority on Global Majorityin Connected Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2018

2017

A Ramsey type result for oriented trees.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

Ramsey numbers for degree monotone paths.

[BibT_eX]

[DOI]

Christina Zarb

Discret. Math., 2017

On the longest path of a randomly weighted tournament.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

On the Maximum Number of Spanning Copies of an Orientation in a Tournament.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2017

2016

Color Coding.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Unavoidable tournaments.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

On Zero-Sum and Almost Zero-Sum Subgraphs Over ℤ.

[BibT_eX]

[DOI]

Graphs Comb., 2016

2015

Packing edge-disjoint triangles in regular and almost regular tournaments.

[BibT_eX]

[DOI]

Islam Akaria

Discret. Math., 2015

2014

Approximating the maximum consecutive subsums of a sequence.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Edge-Disjoint Cliques in Graphs with High Minimum Degree.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

Forcing $k$-repetitions in Degree Sequences.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

On Minimum Witnesses for Boolean Matrix Multiplication.

[BibT_eX]

[DOI]

Keren Cohen

Algorithmica, 2014

On the compatibility of quartet trees.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013

Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2013

Packing Triangles in Regular Tournaments.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

The Turán number of sparse spanning graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2013

Matrix sparsification and nested dissection over arbitrary fields.

[BibT_eX]

[DOI]

J. ACM, 2013

Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2013

Edge-Disjoint Induced Subgraphs with Given Minimum Degree.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

Maximum Matching in Regular and Almost Regular Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2013

Approximating the Diameter of Planar Graphs in Near Linear Time.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

The quasi-randomness of hypergraph cut properties.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2012

Approximate shortest paths in weighted graphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2012

Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011

On graphs and algebraic graphs that do not contain cycles of length 4.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

Hardness and algorithms for rainbow connection.

[BibT_eX]

[DOI]

J. Comb. Optim., 2011

A shortest cycle for each vertex of a graph.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Colorful monochromatic connectivity.

[BibT_eX]

[DOI]

Discret. Math., 2011

On the Size of Dissociated Bases.

[BibT_eX]

[DOI]

Vsevolod F. Lev

Electron. J. Comb., 2011

Equitable Hypergraph Orientations.

[BibT_eX]

[DOI]

Douglas B. West

Electron. J. Comb., 2011

Distance Oracles for Vertex-Labeled Graphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs.

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010

Single source shortest paths in H-minor free graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Finding heaviest H-subgraphs in real weighted graphs, with applications.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2010

Computing the Girth of a Planar Graph in O(n logn) Time.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

The rainbow connection of a graph is (at most) reciprocal to its minimum degree.

[BibT_eX]

[DOI]

Michael Krivelevich

J. Graph Theory, 2010

On the density of a graph and its blowup.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2010

Large induced subgraphs with equated maximum degree.

[BibT_eX]

[DOI]

Discret. Math., 2010

Computing the diameter polynomially faster than APSP

[BibT_eX]

[DOI]

CoRR, 2010

Two-phase algorithms for the parametric shortest path problem

[BibT_eX]

[DOI]

Eldar Fischer

Oded Lachish

CoRR, 2010

Two-phase Algorithms for the Parametric Shortest Path Problem.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Generating a d-dimensional Linear Subspace Efficiently.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Reconstructing Approximate Phylogenetic Trees from Quartet Samples.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Replacement Paths via Fast Matrix Multiplication.

[BibT_eX]

[DOI]

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Solving Linear Systems through Nested Dissection.

[BibT_eX]

[DOI]

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2009

All Pairs Bottleneck Paths and Max-Min Matrix Products in Truly Subcubic Time.

[BibT_eX]

[DOI]

Theory Comput., 2009

A Comment on Ryser's Conjecture for Intersecting Hypergraphs.

[BibT_eX]

[DOI]

Toufik Mansour

Chunwei Song

Graphs Comb., 2009

Large disjoint subgraphs with the same order and size.

[BibT_eX]

[DOI]

Eur. J. Comb., 2009

Multigraphs (Only) Satisfy a Weak Triangle Removal Lemma.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

Hardness and Algorithms for Rainbow Connectivity.

[BibT_eX]

[DOI]

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Efficient algorithms on sets of permutations, dominance, and real-weighted APSP.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Computing the Girth of a Planar Graph in O(n logn) Time.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008

Color Coding.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

All-pairs disjoint paths from a common ancestor in O~(ninfinit) time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Disjoint Color-Avoiding Triangles.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Almost Given Length Cycles in Digraphs.

[BibT_eX]

[DOI]

Graphs Comb., 2008

On Rainbow Connection.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

The effect of induced subgraphs on quasi-randomness.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Matrix Sparsification for Rank and Determinant Computations via Nested Dissection.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2008

2007

Approximation algorithms and hardness results for cycle packing problems.

[BibT_eX]

[DOI]

Michael Krivelevich

Mohammad R. Salavatipour

Jacques Verstraëte

ACM Trans. Algorithms, 2007

Remarks on the second neighborhood problem.

[BibT_eX]

[DOI]

Dror Fidler

J. Graph Theory, 2007

Approximation algorithms and hardness results for the clique packing problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Combinatorial and computational aspects of graph packing and graph decomposition.

[BibT_eX]

[DOI]

Comput. Sci. Rev., 2007

Packing Cliques in Graphs with Independence Number 2.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2007

All-pairs bottleneck paths for general graphs in truly sub-cubic time.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Maximum matching in graphs with an excluded minor.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

All-pairs bottleneck paths in vertex weighted graphs.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2007

Almost Exact Matchings.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2007

2006

A (1-1/e)-approximation algorithm for the generalized assignment problem.

[BibT_eX]

[DOI]

Israel Beniaminy

Oper. Res. Lett., 2006

Mean Ramsey-Turán numbers.

[BibT_eX]

[DOI]

J. Graph Theory, 2006

Finding and counting cliques and independent sets in r-uniform hypergraphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Decomposing oriented graphs into transitive tournaments.

[BibT_eX]

[DOI]

Discret. Math., 2006

Finding heaviest H-subgraphs in real weighted graphs, with applications

[BibT_eX]

[DOI]

CoRR, 2006

Rainbow H-factors.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

The Number Of Orientations Having No Fixed Tournament.

[BibT_eX]

[DOI]

Comb., 2006

Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005

Integer and fractional packing of families of graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2005

Asymptotically optimal Kk-packings of dense graphs via fractional Kk-decompositions.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2005

On a Hypergraph Matching Problem.

[BibT_eX]

[DOI]

Graphs Comb., 2005

Connected odd dominating sets in graphs.

[BibT_eX]

[DOI]

William Klostermeyer

Discuss. Math. Graph Theory, 2005

Approximation algorithms for cycle packing problems.

[BibT_eX]

[DOI]

Michael Krivelevich

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Answering distance queries in directed graphs using fast matrix multiplication.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005

Fractional Decompositions of Dense Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2005

2004

Some remarks on domination.

[BibT_eX]

[DOI]

Dan Archdeacon

Joanna A. Ellis-Monaghan

J. Graph Theory, 2004

Dense graphs are antimagic.

[BibT_eX]

[DOI]

J. Graph Theory, 2004

Edge coloring complete uniform hypergraphs with many components.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2004

The number of edge-disjoint transitive triples in a tournament.

[BibT_eX]

[DOI]

Discret. Math., 2004

Families of Trees Decompose the Random Graph in an Arbitrary Way.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2004

Nowhere 0 mod p dominating sets in multigraphs.

[BibT_eX]

Ars Comb., 2004

Detecting short directed cycles using rectangular matrix multiplication and dynamic programming.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Packing Directed Cycles Efficiently.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Fast Sparse Matrix Multiplication.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2004

2003

Equitable Coloring of k-Uniform Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2003

Tiling Transitive Tournaments and Their Blow-ups.

[BibT_eX]

[DOI]

Order, 2003

A Coding Theory Bound and Zero-Sum Square Matrices.

[BibT_eX]

[DOI]

Simon Litsyn

Graphs Comb., 2003

2-connected graphs with small 2-connected dominating sets.

[BibT_eX]

[DOI]

Discret. Math., 2003

The Order of Monochromatic Subgraphs with a Given Minimum Degree.

[BibT_eX]

[DOI]

Electron. J. Comb., 2003

A note on graphs without k-connected subgraphs.

[BibT_eX]

Ars Comb., 2003

2002

The decomposition threshold for bipartite graphs with minimum degree one.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2002

Zero-sum Square Matrices.

[BibT_eX]

[DOI]

Eur. J. Comb., 2002

List decomposition of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

A Note on the Number of Edges Guaranteeing a C4 in Eulerian Bipartite Digraphs.

[BibT_eX]

[DOI]

Jian Shen

Electron. J. Comb., 2002

2001

Covering Non-uniform Hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2001

Large Monotone Paths in Graphs with Bounded Degree.

[BibT_eX]

[DOI]

Graphs Comb., 2001

Monotone paths in edge-ordered sparse graphs.

[BibT_eX]

[DOI]

Yehuda Roditty

Barack Shoham

Discret. Math., 2001

2000

Connected Domination and Spanning Trees with Many Leaves.

[BibT_eX]

[DOI]

Douglas B. West

SIAM J. Discret. Math., 2000

Packing and Decomposition of Graphs with Trees.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2000

Intersecting Designs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2000

EveryH-decomposition ofKnhas a Nearly Resolvable Alternative.

[BibT_eX]

[DOI]

Eur. J. Comb., 2000

Arithmetic progressions with constant weight.

[BibT_eX]

[DOI]

Discret. Math., 2000

Dominating A Family Of Graphs With Small Connected Subgraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2000

A Tura'n Type Problem Concerning the Powers of the Degrees of a Graph.

[BibT_eX]

[DOI]

Electron. J. Comb., 2000

Decomposing Hypergraphs into Simple Hypertrees.

[BibT_eX]

[DOI]

Comb., 2000

Graphs with Large Variance.

[BibT_eX]

Ars Comb., 2000

1999

Decomposing large graphs with small graphs of high density.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

Orthogonal Decomposition and Packing of Complete Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1999

Graph Decomposition of Slim Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 1999

Optimal factorizations of families of trees.

[BibT_eX]

[DOI]

Discret. Math., 1999

The uniformity space of hypergraphs and its applications.

[BibT_eX]

[DOI]

Discret. Math., 1999

Orthogonal Colorings of Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 1999

Graphs Having the Local Decomposition Property.

[BibT_eX]

Ars Comb., 1999

1998

Tree decomposition of graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1998

The characterization of zero-sum (mod 2) bipartite Ramsey numbers.

[BibT_eX]

[DOI]

J. Graph Theory, 1998

Covering Graphs: The Covering Problem Solved.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1998

Linear coloring of graphs.

[BibT_eX]

[DOI]

Discret. Math., 1998

1997

Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1997

Recognizing Global Occurrence of Local Properties.

[BibT_eX]

[DOI]

J. Complex., 1997

On packing trees into complete bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 1997

Independent transversals in r-partite graphs.

[BibT_eX]

[DOI]

Discret. Math., 1997

Independent Transversals and Independent Coverings in Sparse Partite Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1997

Efficient Covering Designs of the Complete Graph.

[BibT_eX]

[DOI]

Electron. J. Comb., 1997

Packing Graphs: The packing problem solved.

[BibT_eX]

[DOI]

Electron. J. Comb., 1997

Finding and Counting Given Length Cycles.

[BibT_eX]

[DOI]

Algorithmica, 1997

1996

The number of edge colorings with no monochromatic triangle.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

H-Factors in Dense Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1996

1995

The 123 Theorem and Its Extensions.

[BibT_eX]

J. Comb. Theory A, 1995

1994

The Algorithmic Aspects of the Regularity Lemma.

[BibT_eX]

[DOI]

J. Algorithms, 1994

Color-Coding

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1994

Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs.

[BibT_eX]

[DOI]

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

Finding Even Cycles Even Faster.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

Finding and Counting Given Length Cycles (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1994

1993

Threshold Functions for H-factors.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1993

1992

AlmostH-factors in dense graphs.

[BibT_eX]

[DOI]