Paul Horn

Orcid: 0000-0003-3022-9036

According to our database1, Paul Horn authored at least 49 papers between 1999 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 




Connectivity and stochastic robustness of synchronized multi-drone systems.
Discret. Appl. Math., 2024

Separability, Boxicity, and Partial Orders.
Order, October, 2023

Extremal problems on ray sensor configurations.
Discret. Appl. Math., June, 2023

An extremal problem on rainbow spanning trees in graphs.
Australas. J Comb., June, 2023

Optimal placement of base stations in border surveillance using limited capacity drones.
Theor. Comput. Sci., 2022

Flexibility of planar graphs - Sharpening the tools to get lists of size four.
Discret. Appl. Math., 2022

Ortho-unit polygons can be guarded with at most ⌊(n-4)/8⌋ guards.
CoRR, 2022

Approximating Dynamic Weighted Vertex Cover with Soft Capacities.
Algorithmica, 2022

Gradient and Harnack-type estimates for PageRank.
Netw. Sci., October, 2021

Independent dominating sets in graphs of girth five.
Comb. Probab. Comput., 2021

Failure and Communication in a Synchronized Multi-drone System.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

Random Walks on Simplicial Complexes and the Normalized Hodge 1-Laplacian.
SIAM Rev., 2020

A Spacial Gradient Estimate for Solutions to the Heat Equation on Graphs.
SIAM J. Discret. Math., 2019

On Rainbow-Cycle-Forbidding Edge Colorings of Finite Graphs.
Graphs Comb., 2019

Gaps in the saturation spectrum of trees.
Discuss. Math. Graph Theory, 2019

A Gradient Estimate for PageRank.
Proceedings of the Complex Networks and Their Applications VIII, 2019

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

Degree sum and vertex dominating paths.
J. Graph Theory, 2018

A forest building process on simple graphs.
Discret. Math., 2018

Random Walks on Simplicial Complexes and the normalized Hodge Laplacian.
CoRR, 2018

An O(1)-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity.
Proceedings of the Approximation, 2018

On the barrier graph of an arrangement of ray sensors.
Discret. Appl. Math., 2017

Graphs with Many Strong Orientations.
SIAM J. Discret. Math., 2016

Isomorphic edge disjoint subgraphs of hypergraphs.
Random Struct. Algorithms, 2016

Edge-disjoint rainbow spanning trees in complete graphs.
Eur. J. Comb., 2016

An upper bound on the extremal version of Hajnal's triangle-free game.
Discret. Appl. Math., 2016

On independent doubly chorded cycles.
Discret. Math., 2015

Multiply Chorded Cycles.
SIAM J. Discret. Math., 2014

Multicommodity Allocation for Dynamic Demands Using PageRank Vectors.
Internet Math., 2014

3-Connected {K 1, 3, P 9}-Free Graphs are Hamiltonian-Connected.
Graphs Comb., 2014

Degree Ramsey Numbers of Closed Blowups of Trees.
Electron. J. Comb., 2014

Jumps and Nonjumps in Multigraphs.
SIAM J. Discret. Math., 2013

Special Issue on Algorithms and Models for the Web Graph.
Internet Math., 2013

Stack Domination Density.
Graphs Comb., 2013

Models of on-line social networks.
CoRR, 2013

Two Layer 3D Floor Planning.
Electron. J. Comb., 2013

Giant components in Kronecker graphs.
Random Struct. Algorithms, 2012

Diameter of random spanning trees in a given graph.
J. Graph Theory, 2012

Spreading Processes and Large Components in Ordered, Directed Random Graphs
CoRR, 2012

Multi-commodity Allocation for Dynamic Demands Using PageRank Vectors.
Proceedings of the Algorithms and Models for the Web Graph - 9th International Workshop, 2012

Influence propagation in adversarial setting: how to defeat competition with least amount of investment.
Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012

Distributing Antidote Using PageRank Vectors.
Internet Math., 2009

Percolation in General Graphs.
Internet Math., 2009

Models of Online Social Networks.
Internet Math., 2009

The Giant Component in a Random Subgraph of a Given Graph.
Proceedings of the Algorithms and Models for the Web-Graph, 6th International Workshop, 2009

A Dynamic Model for On-Line Social Networks.
Proceedings of the Algorithms and Models for the Web-Graph, 6th International Workshop, 2009

The Spectral Gap of a Random Subgraph of a Graph.
Internet Math., 2007

IBM Syst. J., 2006

Update to "The role of basic research in communications and electronics".
Proc. IEEE, 1999