Changxing Dong

	2010
4		Christian Ernst, Changxing Dong, Gerold Jäger, Dirk Richter, Paul Molitor: Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction. AAIM 2010: 119-130
	2009
3		Changxing Dong, Gerold Jäger, Dirk Richter, Paul Molitor: Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges. AAIM 2009: 175-187
2		Changxing Dong, Christian Ernst, Gerold Jäger, Dirk Richter, Paul Molitor: Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo Backbones. CTW 2009: 3-6
	2007
1		Changxing Dong, Paul Molitor: What Graphs can be Efficiently Represented by BDDs? ICCTA 2007: 128-134

Coauthor Index

1	Christian Ernst	[2] [4]
2	Gerold Jäger	[2] [3] [4]
3	Paul Molitor	[1] [2] [3] [4]
4	Dirk Richter	[2] [3] [4]

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page