default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul Horn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j39]Zion Hefty, Paul Horn, Colby Muir, Andrew Owens:
Word-Representable Graphs: Orientations, Posets, and Bounds. Electron. J. Comb. 31(4) (2024)- [j38]Sergey Bereg
, José Miguel Díaz-Báñez, Paul Horn, Mario Alberto López, Jorge Urrutia:
Connectivity and stochastic robustness of synchronized multi-drone systems. Discret. Appl. Math. 349: 170-181 (2024) - 2023
- [j37]Matthew DeVilbiss, Bradley Fain, Amber Holmes, Paul Horn, Sonwabile Mafunda, K. E. Perry:
An extremal problem on rainbow spanning trees in graphs. Australas. J Comb. 86: 1-23 (2023) - [j36]Kirk Boyer, Paul Horn, Mario Alberto López:
Extremal problems on ray sensor configurations. Discret. Appl. Math. 332: 87-100 (2023) - [j35]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:
Separability, Boxicity, and Partial Orders. Order 40(3): 699-712 (2023) - 2022
- [j34]Hao-Ting Wei, Wing-Kai Hon, Paul Horn, Chung-Shou Liao, Kunihiko Sadakane:
Approximating Dynamic Weighted Vertex Cover with Soft Capacities. Algorithmica 84(1): 124-149 (2022) - [j33]Ilkyoo Choi, Felix Christian Clemen, Michael Ferrara, Paul Horn, Fuhong Ma, Tomás Masarík:
Flexibility of planar graphs - Sharpening the tools to get lists of size four. Discret. Appl. Math. 306: 120-132 (2022) - [j32]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:
Optimal placement of base stations in border surveillance using limited capacity drones. Theor. Comput. Sci. 928: 183-196 (2022) - [i8]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:
Ortho-unit polygons can be guarded with at most ⌊(n-4)/8⌋ guards. CoRR abs/2208.12864 (2022) - [i7]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:
Optimal Placement of Base Stations in Border Surveillance using Limited Capacity Drones. CoRR abs/2209.13311 (2022) - 2021
- [j31]Ararat Harutyunyan, Paul Horn, Jacques Verstraëte:
Independent dominating sets in graphs of girth five. Comb. Probab. Comput. 30(3): 344-359 (2021) - [j30]Paul Horn, Lauren M. Nelsen:
Gradient and Harnack-type estimates for PageRank. Netw. Sci. 9(S1): S4-S22 (2021) - [c7]Sergey Bereg, José Miguel Díaz-Báñez, Paul Horn, Mario Alberto López, Jorge Urrutia:
Failure and Communication in a Synchronized Multi-drone System. CALDAM 2021: 413-425 - 2020
- [j29]Michael T. Schaub, Austin R. Benson, Paul Horn, Gabor Lippner, Ali Jadbabaie:
Random Walks on Simplicial Complexes and the Normalized Hodge 1-Laplacian. SIAM Rev. 62(2): 353-391 (2020) - [i6]Ilkyoo Choi, Felix Christian Clemen, Michael Ferrara, Paul Horn, Fuhong Ma, Tomás Masarík:
Flexibility of Planar Graphs - Sharpening the Tools to Get Lists of Size Four. CoRR abs/2004.10917 (2020)
2010 – 2019
- 2019
- [j28]Ronald J. Gould, Paul Horn, Michael S. Jacobson, Brent J. Thomas:
Gaps in the saturation spectrum of trees. Discuss. Math. Graph Theory 39(1): 157-170 (2019) - [j27]Dean Hoffman, Paul Horn, Peter D. Johnson Jr., Andrew Owens:
On Rainbow-Cycle-Forbidding Edge Colorings of Finite Graphs. Graphs Comb. 35(6): 1585-1596 (2019) - [j26]Paul Horn:
A Spacial Gradient Estimate for Solutions to the Heat Equation on Graphs. SIAM J. Discret. Math. 33(2): 958-975 (2019) - [c6]Paul Horn, Lauren M. Nelsen:
A Gradient Estimate for PageRank. COMPLEX NETWORKS (1) 2019: 15-26 - 2018
- [j25]Zhanar Berikkyzy, Steve Butler, Jay Cummings, Kristin Heysse, Paul Horn, Ruth Luo, Brent Moran:
A forest building process on simple graphs. Discret. Math. 341(2): 497-507 (2018) - [j24]Paul Horn:
Rainbow spanning trees in complete graphs colored by one-factorizations. J. Graph Theory 87(3): 333-346 (2018) - [j23]Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Paul Horn, Michael S. Jacobson:
Degree sum and vertex dominating paths. J. Graph Theory 89(3): 250-265 (2018) - [c5]Hao-Ting Wei, Wing-Kai Hon, Paul Horn, Chung-Shou Liao, Kunihiko Sadakane:
An O(1)-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity. APPROX-RANDOM 2018: 27:1-27:14 - [i5]Hao-Ting Wei, Wing-Kai Hon, Paul Horn, Chung-Shou Liao, Kunihiko Sadakane:
An O(1)-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity. CoRR abs/1802.05623 (2018) - [i4]Michael T. Schaub, Austin R. Benson, Paul Horn, Gabor Lippner, Ali Jadbabaie:
Random Walks on Simplicial Complexes and the normalized Hodge Laplacian. CoRR abs/1807.05044 (2018) - 2017
- [j22]Kirk Boyer, Paul Horn, Mario Alberto López:
On the barrier graph of an arrangement of ray sensors. Discret. Appl. Math. 225: 11-21 (2017) - 2016
- [j21]Csaba Biró, Paul Horn, D. Jacob Wildstrom:
An upper bound on the extremal version of Hajnal's triangle-free game. Discret. Appl. Math. 198: 20-28 (2016) - [j20]James M. Carraher, Stephen G. Hartke, Paul Horn:
Edge-disjoint rainbow spanning trees in complete graphs. Eur. J. Comb. 57: 71-84 (2016) - [j19]Paul Horn, Václav Koubek, Vojtech Rödl:
Isomorphic edge disjoint subgraphs of hypergraphs. Random Struct. Algorithms 48(4): 767-793 (2016) - [j18]Sinan Aksoy, Paul Horn:
Graphs with Many Strong Orientations. SIAM J. Discret. Math. 30(2): 1269-1282 (2016) - 2015
- [j17]Ronald J. Gould, Kazuhide Hirohata, Paul Horn:
On independent doubly chorded cycles. Discret. Math. 338(11): 2051-2071 (2015) - 2014
- [j16]Paul Horn, Kevin G. Milans, Vojtech Rödl:
Degree Ramsey Numbers of Closed Blowups of Trees. Electron. J. Comb. 21(2): 2 (2014) - [j15]Qiuju Bian, Ronald J. Gould, Paul Horn, Susan Janiszewski, Steve La Fleur, Paul Wrayno:
3-Connected {K 1, 3, P 9}-Free Graphs are Hamiltonian-Connected. Graphs Comb. 30(5): 1099-1122 (2014) - [j14]Fan Chung Graham, Paul Horn, Jacob Hughes:
Multicommodity Allocation for Dynamic Demands Using PageRank Vectors. Internet Math. 10(1-2): 49-65 (2014) - [j13]Ronald J. Gould, Paul Horn, Colton Magnant:
Multiply Chorded Cycles. SIAM J. Discret. Math. 28(1): 160-172 (2014) - 2013
- [j12]Paul Horn, Gabor Lippner:
Two Layer 3D Floor Planning. Electron. J. Comb. 20(4): 16 (2013) - [j11]Timothy Brauch, Paul Horn, Adam S. Jobson, D. Jacob Wildstrom:
Stack Domination Density. Graphs Comb. 29(6): 1689-1711 (2013) - [j10]Alan M. Frieze, Paul Horn, Pawel Pralat:
Special Issue on Algorithms and Models for the Web Graph. Internet Math. 9(1): 1-2 (2013) - [j9]Paul Horn, Steve La Fleur, Vojtech Rödl:
Jumps and Nonjumps in Multigraphs. SIAM J. Discret. Math. 27(2): 1040-1054 (2013) - [i3]Anthony Bonato, Noor Hadi, Paul Horn, Pawel Pralat, Changping Wang:
Models of on-line social networks. CoRR abs/1308.3388 (2013) - 2012
- [j8]Fan R. K. Chung, Paul Horn, Linyuan Lu:
Diameter of random spanning trees in a given graph. J. Graph Theory 69(3): 223-240 (2012) - [j7]Paul Horn, Mary Radcliffe:
Giant components in Kronecker graphs. Random Struct. Algorithms 40(3): 385-397 (2012) - [c4]Shahrzad Shirazipourazad, Brian Bogard, Harsh Vachhani, Arunabha Sen, Paul Horn:
Influence propagation in adversarial setting: how to defeat competition with least amount of investment. CIKM 2012: 585-594 - [c3]Fan R. K. Chung, Paul Horn, Jacob Hughes:
Multi-commodity Allocation for Dynamic Demands Using PageRank Vectors. WAW 2012: 138-152 - [i2]Paul Horn, Malik Magdon-Ismail:
Spreading Processes and Large Components in Ordered, Directed Random Graphs. CoRR abs/1209.2088 (2012) - [i1]Paul Horn, Gabor Lippner:
Two Layer 3D Floor Planning. CoRR abs/1210.4595 (2012) - 2011
- [e1]Alan M. Frieze, Paul Horn, Pawel Pralat:
Algorithms and Models for the Web Graph - 8th International Workshop, WAW 2011, Atlanta, GA, USA, May 27-29, 2011. Proceedings. Lecture Notes in Computer Science 6732, Springer 2011, ISBN 978-3-642-21285-7 [contents]
2000 – 2009
- 2009
- [j6]Fan R. K. Chung, Paul Horn, Alexander Tsiatas:
Distributing Antidote Using PageRank Vectors. Internet Math. 6(2): 237-254 (2009) - [j5]Anthony Bonato, Noor Hadi, Paul Horn, Pawel Pralat, Changping Wang:
Models of Online Social Networks. Internet Math. 6(3): 285-313 (2009) - [j4]Fan R. K. Chung, Paul Horn, Linyuan Lu:
Percolation in General Graphs. Internet Math. 6(3): 331-347 (2009) - [c2]Fan Chung Graham, Paul Horn, Linyuan Lu:
The Giant Component in a Random Subgraph of a Given Graph. WAW 2009: 38-49 - [c1]Anthony Bonato, Noor Hadi, Paul Horn, Pawel Pralat, Changping Wang:
A Dynamic Model for On-Line Social Networks. WAW 2009: 127-142 - 2007
- [j3]Fan R. K. Chung, Paul Horn:
The Spectral Gap of a Random Subgraph of a Graph. Internet Math. 4(2): 225-244 (2007) - 2006
- [j2]Paul Horn, Steven Mills:
Introduction. IBM Syst. J. 45(2): 204- (2006)
1990 – 1999
- 1999
- [j1]Paul Horn:
Update to "The role of basic research in communications and electronics". Proc. IEEE 87(11): 1993-1995 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 20:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
