Valery Gordon

Generating author description...

All published works

Action	Title	Year	Authors
+	Hamiltonian properties of locally connected graphs with bounded vertex degree	2010	Valery Gordon Yury Orlovich Chris N. Potts Vitaly A. Strusevich
+	On the independent set problem in triangle graphs	2010	Jacek Błażewicz Alexandre Dolgui Valery Gordon Yury Orlovich
+	On the Complexity and Inapproximability of Dissociation Set Problems in Graphs	2010	Yury Orlovich Alexandre Dolgui Gerd Finke Valery Gordon Frank Werner
+	Complexity of dissociation set problems in some heriditary classes of graphs	2009	Yury Orlovich Valery Gordon Frank Werner Alexandre Dolgui Gerd Finke
+ PDF Chat	On the complexity of the dissociation set problems in graphs	2009	Yury Orlovich Alexandre Dolgui Gerd Finke Valery Gordon Frank Werner
+	On the inapproximability of independent domination in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mn>2</mml:mn><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>-free perfect graphs	2008	Yury Orlovich Valery Gordon D. de Werra
+	Hamiltonian properties of triangular grid graphs	2008	Valery Gordon Yury Orlovich Frank Werner
+	On maximal dissociation sets in graphs	2007	Y. Orlovich Gerd Finke Valery Gordon Felix Werner
+	Complexity of approximating the maximum and minimum maximal induced matchings	2007	Valery Gordon Y. Orlovich Gerd Finke I. Zverovich
+	On maximal dissociation sets in graphs	2007	y. Orlovich Gerd Finke Valery Gordon Felix Werner
+	Polynomially Solvable Problems	1994	V. S. Tanaev Valery Gordon Yakov M. Shafransky

Common Coauthors

Coauthor	Papers Together
Yury Orlovich	7
Gerd Finke	6
Alexandre Dolgui	4
Frank Werner	4
Felix Werner	2
Felix Werner	2
Y. Orlovich	1
Y. Orlovich	1
V. S. Tanaev	1
Chris N. Potts	1
D. de Werra	1
Jacek Błażewicz	1
y. Orlovich	1
I. Zverovich	1
Yakov M. Shafransky	1
Vitaly A. Strusevich	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Approximating the minimum maximal independence number	1993	Magnús M. Halldórsson	2
+ PDF Chat	Locally connected graphs	1974	Gary Chartrand Raymond E. Pippert	2
+	Weakly triangulated graphs	1985	Ryan Hayward	2
+	Extending cycles in graphs	1990	George R. T. Hendry	2
+	Complexity of the hamiltonian cycle in regular graph problem	1994	C. Picouleau	1
+	Finding a maximum induced matching in weakly chordal graphs	2003	Kathie Cameron R. Sritharan Yingwen Tang	1
+	Cycles of given length in some K1,3-free graphs	1989	Cun‐Quan Zhang	1
+	Almost claw‐free graphs	1994	Zdeněk Ryjáček	1
+	On the inapproximability of independent domination in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mn>2</mml:mn><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>-free perfect graphs	2008	Yury Orlovich Valery Gordon D. de Werra	1
+	None	2005	Edy Tri Baskoro Mirka Miller Jozef Širáň Martin Sutton	1
+	Clustering and domination in perfect graphs	1984	Derek G. Corneil Yehoshua Perl	1
+	The weighted independent domination problem is NP-complete for chordal graphs	2003	Gerard J. Chang	1
+	Polynomial algorithm for finding the largest independent sets in graphs without forks	2003	V. E. Alekseev	1
+	Complement reducible graphs	1981	Derek G. Corneil H. Lerchs L.Stewart Burlingham	1
+	On graphs with polynomially solvable maximum‐weight clique problem	1989	Egon Balas Chang Sung Yu	1
+	Vertex pancyclicity in quasi claw-free graphs	2006	Mingquan Zhan	1
+	Finding Maximum Induced Matchings in Subclasses of Claw-Free and P 5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size	2003	Daniel Kobler Udi Rotics	1
+	Sufficient condition for Hamiltonicity of N2-locally connected claw-free graphs	2000	Halina Bielak	1
+	On maximum induced matchings in bipartite graphs	2002	Vadim Lozin	1
+	Planar Hamiltonian chordal graphs are cycle extendable	2002	Tao Jiang	1
+	Quadrangularly connected claw-free graphs	2006	Mingchu Li Cheng Guo Liming Xiong Li Deng Hong‐Jian Lai	1
+ PDF Chat	Fractal and statistical properties of large compact polymers: a computational study	2003	Rhonald C. Lua Alexander L. Borovinskiy Alexander Y. Grosberg	1
+	Cycle Extendability of Hamiltonian Interval Graphs	2006	Guantao Chen Ralph J. Faudree Ronald J. Gould Michael S. Jacobson	1
+	Hamiltonian properties of triangular grid graphs	2008	Valery Gordon Yury Orlovich Frank Werner	1
+	Maximum independent sets in subclasses of -free graphs	2008	Vadim Lozin Raffaele Mosca	1
+ PDF Chat	Local properties of graphs	1981	Jiří Sedláček	1
+	HamiltonianN2-locally connected claw-free graphs	2004	Hong‐Jian Lai Yehong Shao Mingquan Zhan	1
+	On maximal independent sets of vertices in claw-free graphs	1980	George J. Minty	1
+	On computing the dissociation number and the induced matching number of bipartite graphs.	2004	Rodica Boliac Kathie Cameron Vadim Lozin	1
+	A note on locally connected and hamiltonian-connected graphs	1979	Gary Chartrand Ronald J. Gould Albert D. Polimeni	1
+ PDF Chat	The strong perfect graph theorem	2006	Maria Chudnovsky Neil Robertson Paul Seymour Robin Thomas	1
+	Updating the hamiltonian problem—A survey	1991	Ronald J. Gould	1