Paul Horn

According to our database1, Paul Horn authored at least 29 papers between 2006 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Gaps in the saturation spectrum of trees.
Discussiones Mathematicae Graph Theory, 2019

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

A forest building process on simple graphs.
Discrete Mathematics, 2018

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

2017
On the barrier graph of an arrangement of ray sensors.
Discrete Applied Mathematics, 2017

2016
Graphs with Many Strong Orientations.
SIAM J. Discrete 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.
Discrete Applied Mathematics, 2016

2015
On independent doubly chorded cycles.
Discrete Mathematics, 2015

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

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

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

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

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

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

Stack Domination Density.
Graphs and Combinatorics, 2013

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

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

Diameter of random spanning trees in a given graph.
Journal of Graph Theory, 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

2009
Distributing Antidote Using PageRank Vectors.
Internet Mathematics, 2009

Percolation in General Graphs.
Internet Mathematics, 2009

Models of Online Social Networks.
Internet Mathematics, 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

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

2006
Introduction.
IBM Systems Journal, 2006


  Loading...