Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems.
Graphs Comb., 2015
An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs.
J. Graph Theory, 2013
Vertex partitions of non-complete graphs into connected monochromatic k-regular graphs.
Discret. Math., 2011
Ramsey-type results for Gallai colorings.
J. Graph Theory, 2010
Algorithms in a nutshell - a desktop quick reference.
O'Reilly, ISBN: 978-0-596-51624-6, 2009
Inequalities for the first-fit chromatic number.
J. Graph Theory, 2008
Distributing vertices along a Hamiltonian cycle in Dirac graphs.
Discret. Math., 2008
On an anti-Ramsey problem of Burr, Erdös, Graham, and T. Sós.
J. Graph Theory, 2006
On a Turán-type hypergraph problem of Brown, Erdos and T. Sós.
Discret. Math., 2005
The complexity of the certification of properties of Stable Marriage.
Inf. Process. Lett., 2004
An Extension Of The Ruzsa-Szemerédi Theorem.
An application of the regularity lemma in generalized Ramsey theory.
J. Graph Theory, 2003
On the number of Hamiltonian cycles in Dirac graphs.
Discret. Math., 2003
On bipartite generalized Ramsey theory.
Ars Comb., 2003
On Edge Colorings with at Least q Colors in Every Subset of p Vertices.
Electron. J. Comb., 2001
Vertex Partitions by Connected Monochromatic k-Regular Graphs.
J. Comb. Theory, Ser. B, 2000
On <i>k</i>-ordered Hamiltonian graphs.
J. Graph Theory, 1999
Counting irregular multigraphs.
Discret. Math., 1999
The enumeration of labeled graphs by number of cutpoints.
Discret. Math., 1998
The Average Height of a Node in the BANG Abstract Directory Tree.
Inf. Process. Lett., 1997
A characterization of n-component graphs.
Discret. Math., 1996
A Probabilistic lower bound on the independence number of graphs.
Discret. Math., 1994
The independence number of graphs in terms of degrees.
Discret. Math., 1993
Finding Nearest Neighbors with Voronoi Tessellations.
Inf. Process. Lett., 1990
The Efficiency of Using k-d Trees for Finding Nearest Neighbors in Discrete Space.
Inf. Process. Lett., 1986
The Finite Power Property for Context-Free Languages.
Theor. Comput. Sci., 1981
Random Graph Isomorphism.
SIAM J. Comput., 1980
Some perfect coloring properties of graphs.
J. Comb. Theory, Ser. B, 1979
New Bounds for the Clique Number of a Graph.
Inf. Process. Lett., 1978
The Tree-to-Tree Editing Problem.
Inf. Process. Lett., 1977
Diagnostic Keys as a Representation for Context in Pattern Recognition.
IEEE Trans. Computers, 1974
Cost-minimal trees in directed acyclic graphs.
Z. Oper. Research, 1974
One-Pass Complexity of Digital Picture Properties.
J. ACM, 1972