Craig Dillabaugh

	2012
5		Craig Dillabaugh, Meng He, Anil Maheshwari: Succinct and I/O Efficient Data Structures for Traversal in Trees. Algorithmica 63(1-2): 201-223 (2012)
	2011
4		Jean-Lou De Carufel, Craig Dillabaugh, Anil Maheshwari: Point Location in Well-Shaped Meshes Using Jump-and-Walk. CCCG 2011
	2010
3		Craig Dillabaugh: I/O efficient path traversal in well-shaped tetrahedral meshes. CCCG 2010: 121-124
	2009
2		Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh: I/O and Space-Efficient Path Traversal in Planar Graphs. ISAAC 2009: 1175-1184
	2008
1		Craig Dillabaugh, Meng He, Anil Maheshwari: Succinct and I/O Efficient Data Structures for Traversal in Trees. ISAAC 2008: 112-123

Coauthor Index

1	Jean-Lou De Carufel	[4]
2	Meng He	[1] [2] [5]
3	Anil Maheshwari	[1] [2] [4] [5]
4	Norbert Zeh	[2]

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