Lane H. Clark

From MaRDI portal
Revision as of 09:20, 11 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Person:912122 to Lane H. Clark: Duplicate)

Person:1363710

Available identifiers

zbMath Open clark.lane-hWikidataQ102361465 ScholiaQ102361465MaRDI QIDQ1363710

List of research outcomes





PublicationDate of PublicationType
Generalized Ramsey numbers through adiabatic quantum optimization2016-10-27Paper
https://portal.mardi4nfdi.de/entity/Q34662422016-02-01Paper
The Distribution of Ramsey Numbers2014-11-14Paper
The distribution of Ramsey numbers2014-11-14Paper
Graph isomorphism and adiabatic quantum computing2013-04-21Paper
https://portal.mardi4nfdi.de/entity/Q31100732012-01-26Paper
https://portal.mardi4nfdi.de/entity/Q31100812012-01-26Paper
https://portal.mardi4nfdi.de/entity/Q31101032012-01-26Paper
Experimental determination of Ramsey numbers2012-01-09Paper
The independent domination number of a random graph2011-10-05Paper
https://portal.mardi4nfdi.de/entity/Q30884492011-08-19Paper
https://portal.mardi4nfdi.de/entity/Q30884542011-08-19Paper
https://portal.mardi4nfdi.de/entity/Q30156212011-07-13Paper
Ramsey numbers and adiabatic quantum computing2011-03-07Paper
Ascents and descents in random trees2011-02-28Paper
https://portal.mardi4nfdi.de/entity/Q30702902011-02-02Paper
https://portal.mardi4nfdi.de/entity/Q35819442010-09-02Paper
Multiplicities of Integer Arrays2010-06-21Paper
Limit distribution of ascent, descent or excedance length sums of permutations2010-01-12Paper
https://portal.mardi4nfdi.de/entity/Q36450742009-11-16Paper
https://portal.mardi4nfdi.de/entity/Q36206502009-04-14Paper
https://portal.mardi4nfdi.de/entity/Q36166812009-03-26Paper
https://portal.mardi4nfdi.de/entity/Q36159932009-03-24Paper
https://portal.mardi4nfdi.de/entity/Q35152772008-07-29Paper
The exponent in the general Randić index2008-05-21Paper
https://portal.mardi4nfdi.de/entity/Q54231102007-10-30Paper
https://portal.mardi4nfdi.de/entity/Q54925882006-10-16Paper
Local extrema in random trees2006-04-19Paper
https://portal.mardi4nfdi.de/entity/Q30239972005-07-11Paper
https://portal.mardi4nfdi.de/entity/Q48208292004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q44702402004-06-22Paper
Asymptotic normality of the Ward numbers2003-03-26Paper
Random subgraphs of certain graph powers2003-01-13Paper
On the representation of \(m\) as \(\sum_{k=-n}^n \varepsilon_k k\)2002-04-23Paper
https://portal.mardi4nfdi.de/entity/Q27784672002-04-02Paper
https://portal.mardi4nfdi.de/entity/Q27604562002-01-02Paper
https://portal.mardi4nfdi.de/entity/Q27159532001-05-30Paper
An asymptotic expansion for the number of permutations with a certain number of inversions2000-11-30Paper
Parity dimension for graphs2000-11-02Paper
https://portal.mardi4nfdi.de/entity/Q49400262000-03-01Paper
https://portal.mardi4nfdi.de/entity/Q49400442000-03-01Paper
Efficient domination of the orientations of a graph1999-02-14Paper
https://portal.mardi4nfdi.de/entity/Q43906641998-11-26Paper
https://portal.mardi4nfdi.de/entity/Q38382211998-08-09Paper
https://portal.mardi4nfdi.de/entity/Q43510661998-03-24Paper
https://portal.mardi4nfdi.de/entity/Q43615601998-03-01Paper
Remarks on the size of critical edge-chromatic graphs1997-08-10Paper
https://portal.mardi4nfdi.de/entity/Q48819281996-09-23Paper
https://portal.mardi4nfdi.de/entity/Q48711431996-07-28Paper
Cycle-saturated graphs of minimum size1996-07-02Paper
https://portal.mardi4nfdi.de/entity/Q48737921996-04-21Paper
https://portal.mardi4nfdi.de/entity/Q48634681996-04-08Paper
https://portal.mardi4nfdi.de/entity/Q31369841994-08-25Paper
Subdivision thresholds for two classes of graphs1994-05-05Paper
https://portal.mardi4nfdi.de/entity/Q42880821994-04-21Paper
The minimum number of subgraphs in a graph and its complement1993-01-17Paper
A linear time algorithm for graph partition problems1993-01-16Paper
Smallest maximally nonhamiltonian graphs. II1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q40171671993-01-16Paper
An inequality for degree sequences1992-12-06Paper
Threshold functions for local properties of graphs: Triangles1992-06-28Paper
The number of cutvertices in graphs with given minimum degree1990-01-01Paper
The bisection width of cubic graphs1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38153271988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37755811987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37605761986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37817841986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37225401985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37588621985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37588631985-01-01Paper
On hamiltonian line graphs1984-01-01Paper
Smallest maximally nonhamiltonian graphs1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36720411982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39584961981-01-01Paper
Minimum graphs with complete k-closure1980-01-01Paper
Algorithms for learning and teaching sets of vertices in graphsN/APaper

Research outcomes over time

This page was built for person: Lane H. Clark