László A. Székely

Stephen J. Smith

J. Graph Theory, 2023

2022

An Infinite Antichain of Planar Tanglegrams.

[BibT_eX]

[DOI]

Stephen J. Smith

Order, 2022

Proximity in triangulations and quadrangulations.

[BibT_eX]

[DOI]

Electron. J. Graph Theory Appl., 2022

Minimum Wiener index of triangulations and quadrangulations.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

2021

Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza.

[BibT_eX]

[DOI]

Inne Singgih

J. Comb. Theory B, 2021

A Size Condition for Diameter Two Orientable Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2021

Wiener Index and Remoteness in Triangulations and Quadrangulations.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2021

On the Maximum Diameter of $k$-Colorable Graphs.

[BibT_eX]

[DOI]

Inne Singgih

Electron. J. Comb., 2021

2020

Inducibility of d-ary trees.

[BibT_eX]

[DOI]

Audace A. V. Dossou-Olory

Discret. Math., 2020

2019

A tanglegram Kuratowski theorem.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

A degree condition for diameter two orientability of graphs.

[BibT_eX]

[DOI]

Peter Dankelmann

Discret. Math., 2019

2018

On the Number of Nonisomorphic Subtrees of a Tree.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

k-planar crossing number of random graphs and random regular graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Note on k-planar crossing numbers.

[BibT_eX]

[DOI]

Comput. Geom., 2018

On Different "Middle Parts" of a Tree.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

Analogies between the Crossing Number and the Tangle Crossing Number.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

2017

Inducibility in Binary Trees and Crossings in Random Tanglegrams.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Paths vs. Stars in the Local Profile of Trees.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

On the Number of Non-Zero Elements of Joint Degree Vectors.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

2016

Eccentricity sums in trees.

[BibT_eX]

[DOI]

Heather C. Smith

Discret. Appl. Math., 2016

2014

Extremal values of ratios: Distance problems vs. subtree problems in trees II.

[BibT_eX]

[DOI]

Discret. Math., 2014

Dominating Scale-Free Networks Using Generalized Probabilistic Methods.

[BibT_eX]

[DOI]

Boleslaw K. Szymanski

György Korniss

CoRR, 2014

2013

Extremal Values of Ratios: Distance Problems vs. Subtree Problems in Trees.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

Threshold Functions for Distinct Parts: Revisiting Erdős-Lehner.

[BibT_eX]

[DOI]

Matteo Marsili

Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals.

[BibT_eX]

[DOI]

Harout K. Aydinian

Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2012

Minimizing the number of episodes and Gallai's theorem on intervals

[BibT_eX]

[DOI]

Todd J. Vision

CoRR, 2012

2011

A tour of M-part L-Sperner families.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2011

The sum of the distances between the leaves of a tree and the 'semi-regular' property.

[BibT_eX]

[DOI]

Taoyang Wu

Discret. Math., 2011

2010

General Lower Bounds for the Minor Crossing Number of Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2010

A note on full transversals and mixed orthogonal arrays.

[BibT_eX]

[DOI]

Australas. J Comb., 2010

2009

Diameter of 4-colourable graphs.

[BibT_eX]

[DOI]

Peter Dankelmann

Eur. J. Comb., 2009

The inverse problem for certain tree parameters.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

An improved bound on the maximum agreement subtree problem.

[BibT_eX]

[DOI]

Mike A. Steel

Appl. Math. Lett., 2009

2008

Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2008

An optimality criterion for the crossing number.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2008

On the Existence of Armstrong Instances with Bounded Domains.

[BibT_eX]

[DOI]

Attila Sali

Proceedings of the Foundations of Information and Knowledge Systems, 2008

2007

SPT(q, k, n)-Codes.

[BibT_eX]

[DOI]

Attila Sali

Electron. Notes Discret. Math., 2007

Graph minors and the crossing number of graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Binary trees with the largest number of subtrees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

On k-planar crossing numbers.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Teasing Apart Two Trees.

[BibT_eX]

[DOI]

Mike A. Steel

Comb. Probab. Comput., 2007

Using Lovász Local Lemma in the Space of Random Injections.

[BibT_eX]

[DOI]

Linyuan Lu

Electron. J. Comb., 2007

2005

On subtrees of trees.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2005

Progress on Crossing Number Problems.

[BibT_eX]

[DOI]

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

2004

A note on Halton's conjecture.

[BibT_eX]

[DOI]

Ondrej Sýkora

Inf. Sci., 2004

Outerplanar Crossing Numbers, the Circular Arrangement Problem and Isoperimetric Functions.

[BibT_eX]

[DOI]

Electron. J. Comb., 2004

Counting rooted spanning forests in complete multipartite graphs.

[BibT_eX]

Ars Comb., 2004

2003

Bounds and Methods for k-Planar Crossing Numbers.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 11th International Symposium, 2003

Bounds for Convex Crossing Numbers.

[BibT_eX]

[DOI]

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

2002

Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications.

[BibT_eX]

[DOI]

Michael Anthony Steel

SIAM J. Discret. Math., 2002

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2002

Wiener index versus maximum degree in trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

Two Counterexamples in Graph Drawing.

[BibT_eX]

[DOI]

Ondrej Sýkora

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

Fractional Lengths and Crossing Numbers.

[BibT_eX]

[DOI]

Ondrej Sýkora

Proceedings of the Graph Drawing, 10th International Symposium, 2002

2001

Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

Towards a Katona Type Proof for the 2-intersecting Erdos-Ko-Rado Theorem.

[BibT_eX]

[DOI]

Ralph Howard

Gyula Károlyi

Electron. J. Comb., 2001

2000

A new lower bound for the bipartite crossing number with applications.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

On Bipartite Drawings and the Linear Arrangement Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

A successful concept for measuring non-planarity of graphs: the crossing number.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2000

Erdös-Ko-Rado and Hilton-Milner Type Theorems for Intersecting Chains in Posets.

[BibT_eX]

[DOI]

Ákos Seress

Comb., 2000

1999

A Few Logs Suffice to Build (almost) All Trees: Part II.

[BibT_eX]

[DOI]

Michael Anthony Steel

Tandy J. Warnow

Theor. Comput. Sci., 1999

A few logs suffice to build (almost) all trees (I).

[BibT_eX]

[DOI]

Michael Anthony Steel

Tandy J. Warnow

Random Struct. Algorithms, 1999

1998

Intersection of Curves and Crossing Number of Cm x Cn on Surfaces.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1998

Minimum Multiway Cuts in Trees.

[BibT_eX]

[DOI]

András Frank

Discret. Appl. Math., 1998

Integral Uniform Flows in Symmetric Networks.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

1997

On Dense Bipartite Graphs of Girth Eight and Upper Bounds for Certain Configurations in Planar Point-Line Systems.

[BibT_eX]

[DOI]

D. de Caen

J. Comb. Theory A, 1997

Extremal Values for Ratios of Distances in Trees.

[BibT_eX]

[DOI]

Curtis A. Barefoot

Roger C. Entringer

Discret. Appl. Math., 1997

Crossing Numbers and Hard Erdös Problems in Discrete Geometry.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1997

Intersecting Systems.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1997

Local Quartet Splits of a Binary Tree Infer All Quartet Splits Via One Dyadic Inference Rule.

[BibT_eX]

[DOI]

Comput. Artif. Intell., 1997

On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear Arrangement Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Constructing Big Trees from Short Sequences.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Bipartite Crossing Numbers of Meshes and Hypercubes.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 5th International Symposium, 1997

1996

The book crossing number of a graph.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

Cycle-saturated graphs of minimum size.

[BibT_eX]

[DOI]

Discret. Math., 1996

Drawings of Graphs on Surfaces with Few Crossings.

[BibT_eX]

[DOI]

Algorithmica, 1996

1995

Crossing Numbers of Meshes.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1995

1994

On weighted multiway cuts in trees.

[BibT_eX]

[DOI]

Math. Program., 1994

Reconstructing Trees When Sequence Sites Evolve at Variable Rates.

[BibT_eX]

[DOI]

Mike A. Steel

Michael D. Hendy

J. Comput. Biol., 1994

Subdivision thresholds for two classes of graphs.

[BibT_eX]

[DOI]

Discret. Math., 1994

On Canonical Concurrent Flows, Crossing Number and Graph Expansion.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1994

On Intersecting Chains in Boolean Algebras.

[BibT_eX]

[DOI]

Ákos Seress

Comb. Probab. Comput., 1994

On the Wiener index of trees from certain families.

[BibT_eX]

[DOI]

Australas. J Comb., 1994

Book Embeddings and Crossing Numbers.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

Crossing Numbers of Graphs, Lower Bound Techniques.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

1993

Counting Bichromatic Evolutionary Trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1993

Improving Bounds for the Crossing Numbers on Surfaces of Genus g.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

Concurrent Flows and Packet Routing in Cayley Graphs (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

1992

A Linear Time Algorithm for Graph Partition Problems.

[BibT_eX]

[DOI]

Lane H. Clark

Inf. Process. Lett., 1992

An inequality for degree sequences.

[BibT_eX]

[DOI]

Lane H. Clark

Roger C. Entringer

Discret. Math., 1992

Sharpening the LYM inequality.

[BibT_eX]

[DOI]

Comb., 1992

Effective Lower Bounds for Crossing Number, Bisection Width and Balanced Vertex Separator in Terms of Symmetry.

[BibT_eX]

Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

Algorithms and Min-max Theorems for Certain Multiway Cuts.

[BibT_eX]

Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1991

Threshold functions for local properties of graphs: triangles.

[BibT_eX]

[DOI]

Lane H. Clark

Roger C. Entringer

Discret. Appl. Math., 1991

Extremal problems for local properties of graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 1991

1990

On the Distribution of Lengths of Evolutionary Trees.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1990

1989

Bounds on the measurable chromatic number of Rn.

[BibT_eX]

[DOI]

Nicholas C. Wormald

Discret. Math., 1989

1985

Common Origin of Cubic Binomial Identities; A Generalization of Surányi's Proof on Le Jen Shoo's Formula.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1985

1984

On the number of homogeneous subgraphs of a graph.

[BibT_eX]

[DOI]

Comb., 1984

Measurable chromatic number of geometric graphs and sets without some distnaces in euclidean space.

[BibT_eX]

[DOI]