Update to "The role of basic research in communications and electronics". - Paul Horn (Proc. IEEE, 1999)

Introduction. - Paul Horn; Steven Mills (IBM Syst. J., 2006)

The Spectral Gap of a Random Subgraph of a Graph. - Fan R. K. Chung; Paul Horn (Internet Math., 2007)

A Dynamic Model for On-Line Social Networks. - Anthony Bonato; Noor Hadi; Paul Horn; Pawel Pralat; Changping Wang (WAW, 2009)

The Giant Component in a Random Subgraph of a Given Graph. - Fan Chung Graham; Paul Horn; Linyuan Lu (WAW, 2009)

Models of Online Social Networks. - Anthony Bonato; Noor Hadi; Paul Horn; Pawel Pralat; Changping Wang (Internet Math., 2009)

Percolation in General Graphs. - Fan R. K. Chung; Paul Horn; Linyuan Lu (Internet Math., 2009)

Distributing Antidote Using PageRank Vectors. - Fan R. K. Chung; Paul Horn; Alexander Tsiatas (Internet Math., 2009)

Influence propagation in adversarial setting: how to defeat competition with least amount of investment. - Shahrzad Shirazipourazad; Brian Bogard; Harsh Vachhani; Arunabha Sen; Paul Horn (CIKM, 2012)

Multi-commodity Allocation for Dynamic Demands Using PageRank Vectors. - Fan R. K. Chung; Paul Horn; Jacob Hughes (WAW, 2012)

Spreading Processes and Large Components in Ordered, Directed Random Graphs - Paul Horn; Malik Magdon-Ismail (CoRR, 2012)

Diameter of random spanning trees in a given graph. - Fan R. K. Chung; Paul Horn; Linyuan Lu (J. Graph Theory, 2012)

Giant components in Kronecker graphs. - Paul Horn; Mary Radcliffe (Random Struct. Algorithms, 2012)

Two Layer 3D Floor Planning. - Paul Horn; Gabor Lippner (Electron. J. Comb., 2013)

Models of on-line social networks. - Anthony Bonato; Noor Hadi; Paul Horn; Pawel Pralat; Changping Wang (CoRR, 2013)

Stack Domination Density. - Timothy Brauch; Paul Horn; Adam S. Jobson; D. Jacob Wildstrom (Graphs Comb., 2013)

Special Issue on Algorithms and Models for the Web Graph. - Alan M. Frieze; Paul Horn; Pawel Pralat (Internet Math., 2013)

Jumps and Nonjumps in Multigraphs. - Paul Horn; Steve La Fleur; Vojtech Rödl (SIAM J. Discret. Math., 2013)

Degree Ramsey Numbers of Closed Blowups of Trees. - Paul Horn; Kevin G. Milans; Vojtech Rödl (Electron. J. Comb., 2014)

3-Connected {K 1, 3, P 9}-Free Graphs are Hamiltonian-Connected. - Qiuju Bian; Ronald J. Gould; Paul Horn; Susan Janiszewski; Steve La Fleur; Paul Wrayno (Graphs Comb., 2014)

Multicommodity Allocation for Dynamic Demands Using PageRank Vectors. - Fan Chung Graham; Paul Horn; Jacob Hughes (Internet Math., 2014)

Multiply Chorded Cycles. - Ronald J. Gould; Paul Horn; Colton Magnant (SIAM J. Discret. Math., 2014)

On independent doubly chorded cycles. - Ronald J. Gould; Kazuhide Hirohata; Paul Horn (Discret. Math., 2015)

An upper bound on the extremal version of Hajnal's triangle-free game. - Csaba Biró; Paul Horn; D. Jacob Wildstrom (Discret. Appl. Math., 2016)

Edge-disjoint rainbow spanning trees in complete graphs. - James M. Carraher; Stephen G. Hartke; Paul Horn (Eur. J. Comb., 2016)

Isomorphic edge disjoint subgraphs of hypergraphs. - Paul Horn; Václav Koubek; Vojtech Rödl (Random Struct. Algorithms, 2016)

Graphs with Many Strong Orientations. - Sinan Aksoy; Paul Horn (SIAM J. Discret. Math., 2016)

On the barrier graph of an arrangement of ray sensors. - Kirk Boyer; Paul Horn; Mario Alberto López (Discret. Appl. Math., 2017)

An O(1)-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity. - Hao-Ting Wei; Wing-Kai Hon; Paul Horn; Chung-Shou Liao; Kunihiko Sadakane (APPROX-RANDOM, 2018)

Random Walks on Simplicial Complexes and the normalized Hodge Laplacian. - Michael T. Schaub; Austin R. Benson; Paul Horn; Gabor Lippner; Ali Jadbabaie (CoRR, 2018)

A forest building process on simple graphs. - Zhanar Berikkyzy; Steve Butler; Jay Cummings; Kristin Heysse; Paul Horn; Ruth Luo; Brent Moran (Discret. Math., 2018)

Degree sum and vertex dominating paths. - Jill R. Faudree; Ralph J. Faudree; Ronald J. Gould; Paul Horn; Michael S. Jacobson (J. Graph Theory, 2018)

Rainbow spanning trees in complete graphs colored by one-factorizations. - Paul Horn (J. Graph Theory, 2018)

A Gradient Estimate for PageRank. - Paul Horn; Lauren M. Nelsen (COMPLEX NETWORKS (1), 2019)

Gaps in the saturation spectrum of trees. - Ronald J. Gould; Paul Horn; Michael S. Jacobson; Brent J. Thomas (Discuss. Math. Graph Theory, 2019)

On Rainbow-Cycle-Forbidding Edge Colorings of Finite Graphs. - Dean Hoffman; Paul Horn; Peter D. Johnson Jr.; Andrew Owens (Graphs Comb., 2019)

A Spacial Gradient Estimate for Solutions to the Heat Equation on Graphs. - Paul Horn (SIAM J. Discret. Math., 2019)

Random Walks on Simplicial Complexes and the Normalized Hodge 1-Laplacian. - Michael T. Schaub; Austin R. Benson; Paul Horn; Gabor Lippner; Ali Jadbabaie (SIAM Rev., 2020)

Failure and Communication in a Synchronized Multi-drone System. - Sergey Bereg; José Miguel Díaz-Báñez; Paul Horn; Mario Alberto López; Jorge Urrutia (CALDAM, 2021)

Independent dominating sets in graphs of girth five. - Ararat Harutyunyan; Paul Horn; Jacques Verstraëte (Comb. Probab. Comput., 2021)

Gradient and Harnack-type estimates for PageRank. - Paul Horn; Lauren M. Nelsen (Netw. Sci., 2021)

Approximating Dynamic Weighted Vertex Cover with Soft Capacities. - Hao-Ting Wei; Wing-Kai Hon; Paul Horn; Chung-Shou Liao; Kunihiko Sadakane (Algorithmica, 2022)

Ortho-unit polygons can be guarded with at most ⌊(n-4)/8⌋ guards. - José Miguel Díaz-Báñez; Paul Horn; Mario Alberto López; Nestaly Marín; Adriana Ramírez-Vigueras; Oriol Andreu Solé-Pi; Alex Stevens; Jorge Urrutia (CoRR, 2022)

Flexibility of planar graphs - Sharpening the tools to get lists of size four. - Ilkyoo Choi; Felix Christian Clemen; Michael Ferrara; Paul Horn; Fuhong Ma; Tomás Masarík (Discret. Appl. Math., 2022)

Optimal placement of base stations in border surveillance using limited capacity drones. - Sergey Bereg; José Miguel Díaz-Báñez; Mohammadreza Haghpanah; Paul Horn; Mario Alberto López; Nestaly Marín; Adriana Ramírez-Vigueras; Fabio Rodríguez; Oriol Andreu Solé-Pi; Alex Stevens; Jorge Urrutia (Theor. Comput. Sci., 2022)

An extremal problem on rainbow spanning trees in graphs. - Matthew DeVilbiss; Bradley Fain; Amber Holmes; Paul Horn; Sonwabile Mafunda; K. E. Perry (Australas. J Comb., 2023)

Extremal problems on ray sensor configurations. - Kirk Boyer; Paul Horn; Mario Alberto López (Discret. Appl. Math., 2023)

Separability, Boxicity, and Partial Orders. - José Miguel Díaz-Báñez; Paul Horn; Mario Alberto López; Nestaly Marín; Adriana Ramírez-Vigueras; Oriol Andreu Solé-Pi; Alex Stevens; Jorge Urrutia (Order, 2023)

Word-Representable Graphs: Orientations, Posets, and Bounds. - Zion Hefty; Paul Horn; Colby Muir; Andrew Owens (Electron. J. Comb., 2024)

Connectivity and stochastic robustness of synchronized multi-drone systems. - Sergey Bereg; José Miguel Díaz-Báñez; Paul Horn; Mario Alberto López; Jorge Urrutia (Discret. Appl. Math., 2024)

Optimal linear-Vizing relationships for (total) domination in graphs. - Michael A. Henning; Paul Horn (J. Graph Theory, 2024)

Ortho-Unit Polygons can be Guarded with at most $ left lfloor frac{n-4}{8} right floor $ Guards. - José Miguel Díaz-Báñez; Paul Horn; Mario Alberto López; Nestaly Marín; Adriana Ramírez-Vigueras; Oriol Andreu Solé-Pi; Alex Stevens; Jorge Urrutia (Graphs Comb., 2025)

Graph curvature and local discrepancy. - Paul Horn; Adam Purcilly; Alex Stevens (J. Graph Theory, 2025)

Matching random colored points with rectangles (Corrigendum). - Josué Corujo; Paul Horn; Pablo Pérez-Lantero (CoRR, 2025)