**Visibility with a moving point of view**.

M. Bern, D.P. Dobkin, D. Eppstein, and R. Grossman.

*1st ACM-SIAM Symp. Discrete Algorithms,*San Francisco, 1990, pp. 107–118.

*Algorithmica*11: 360–378, 1994.An investigation of 3d visibility problems in which the viewing position moves along a straight flight path, with various assumptions on the complexity of the viewed scene.

**Asymptotic speed-ups in constructive solid geometry**.

D. Eppstein.

Tech. Rep. 92-87, ICS, UCI, 1992.

*Algorithmica*13: 462–471, 1995.Finds boundary representations of CSG objects. Uses techniques from dynamic graph algorithms, including a tree partitioning technique of Frederickson and a new data structure for maintaining the value of a Boolean expression with changing variables in time O(log

*n*/ log log*n*) per update.**Diameter and treewidth in minor-closed graph families**.

D. Eppstein.

arXiv:math.CO/9907126.

*Algorithmica*27: 275–291, 2000 (special issue on treewidth, graph minors, and algorithms).This paper introduces the

*diameter-treewidth property*(later known as*bounded local treewidth*): a functional relationship between the diameter of its graph and its treewidth. Previously known results imply that planar graphs have bounded local treewidth; we characterize the other minor-closed families with this property. Specifically, minor-closed family F has bounded local treewidth if and only if there exists an*apex graph*G that is not in F; an apex graph is a graph that can be made planar by removing a single vertex. The minor-free families that exclude an apex graph (and therefore have bounded local treewidth) include the bounded-genus graphs (for which, as with planar graphs, we show a linear bound for the treewidth as a function of the diameter) and K_{3,a}-free graphs. As a consequence, subgraph isomorphism for subgraphs of bounded size and approximations to several NP-hard optimization problems can be computed efficiently on these graphs, extending previous results for planar graphs.Some of these results were announced in the conference version of "subgraph isomorphism for planar graphs and related problems" but not included in the journal version. Since its publication, there have been many more works on local treewidth. The class of problems that could be solved quickly on graphs of bounded local treewidth was extended and classified by Frick and Grohe, "Deciding first-order properties of locally tree-decomposable structures",

*J. ACM*48: 1184–1206, 2001; the proof that bounded local treewidth is equivalent to having an excluded apex minor was simplified, and the dependence of the treewidth on diameter improved, by a subsequent paper of Demaine and Hajiaghayi, "Diameter and treewidth in minor-closed graph families, revisited",*Algorithmica*40: 211–215, 2004. The concept of local treewidth is the basis for the theory of*bidimensionality*, a general framework for fixed-parameter-tractable algorithms and approximation algorithms in minor-closed graph families; for a survey, see Demaine and Hajiaghayi, "The bidimensionality theory and its algorithmic applications",*The Computer J.*51: 292–302, 2008.**Algorithms for coloring quadtrees**.

M. Bern, D. Eppstein, and B. Hutchings.

arXiv:cs.CG/9907030.

*Algorithmica*32 (1): 87–94, 2002.We consider several variations of the problem of coloring the squares of a quadtree so that no two adjacent squares are colored alike. We give simple linear time algorithms for 3-coloring balanced quadtrees with edge adjacency, 4-coloring unbalanced quadtrees with edge adjacency, and 6-coloring balanced or unbalanced quadtrees with corner adjacency. The number of colors used by the first two algorithms is optimal; for the third algorithm, 5 colors may sometimes be needed.

**Guest editor's forward to special issue on dynamic graph algorithms**.

D. Eppstein.

*Algorithmica*22 (3): 233–234, 1998.**Confluent layered drawings**.

D. Eppstein, M. T. Goodrich, and J. Meng.

12th Int. Symp. Graph Drawing, New York, 2004.

Springer,*Lecture Notes in Comp. Sci.*3383, 2004, pp. 184–194.

arXiv:cs.CG/0507051.

*Algorithmica*47 (4): 439–452 (special issue for Graph Drawing), 2007.Describes a graph drawing technique combining ideas of confluent drawing with Sugiyama-style layered drawing. Uses a reduction to graph coloring to find and visualize sets of bicliques in each layer.

**On the planar split thickness of graphs**.

D. Eppstein, P. Kindermann, S. G. Kobourov, G. Liotta, A. Lubiw, A. Maignan, D. Mondal, H. Vosoughpour, S. Whitesides, and S. Wismath.

arXiv:1512.04839.

*Proc. 12th Latin American Theoretical Informatics Symposium (LATIN 2016)*, Ensenada, Mexico.

Springer,*Lecture Notes in Comp. Sci.*9644 (2016), pp. 403–415.

*Algorithmica*80 (3): 977–994 (special issue for LATIN), 2018.We study the problem of splitting the vertices of a given graph into a bounded number of sub-vertices (with each edge attaching to one of the sub-vertices) in order to make the resulting graph planar. It is NP-complete, but can be approximated to within a constant factor, and is fixed-parameter tractable in the treewidth.

(Slides)

**From discrepancy to majority**.

D. Eppstein and D. S. Hirschberg.

arXiv:1512.06488.

*Proc. 12th Latin American Theoretical Informatics Symposium (LATIN 2016)*, Ensenada, Mexico.

Springer,*Lecture Notes in Comp. Sci.*9644 (2016), pp. 390–402.

*Algorithmica*80 (4): 1278–1297, 2018.We provide upper and lower bounds on the query complexity of a problem in which the input is a collection of two-colored items, and the problem is to either find an item of the majority color or to determine that there is no majority, by performing queries that determine the discrepancy of fixed-size subsets of the items.

(Slides)

Journals – Publications – David Eppstein – Theory Group – Inf. & Comp. Sci. – UC Irvine

Semi-automatically filtered from a common source file.