Hossein Jowhari

Orcid: 0000-0001-9032-9958

According to our database1, Hossein Jowhari authored at least 18 papers between 2005 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Airports and railways with unsplittable demand.
Inf. Process. Lett., 2025

2024
A Hall-type theorem with algorithmic consequences in planar graphs.
Discret. Math., April, 2024

Hierarchical Clustering via Local Search.
CoRR, 2024

2023
Monochromatic partitioning of colored points by lines.
Inf. Process. Lett., August, 2023

An estimator for matching size in low arboricity graphs with two applications.
J. Comb. Optim., 2023

A Hall-type theorem with algorithmic consequences in planar graphs.
CoRR, 2023

2019
<i>L</i><sub><i>p</i></sub> Samplers and Their Applications: A Survey.
ACM Comput. Surv., 2019

2017
Corrigendum to "A second look at counting triangles in graph streams" [Theoret. Comput. Sci. 552 (2014) 44-51].
Theor. Comput. Sci., 2017

A second look at counting triangles in graph streams (corrected).
Theor. Comput. Sci., 2017

The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2015
On the monotonicity of a data stream.
Comb., 2015

2014
A second look at counting triangles in graph streams.
Theor. Comput. Sci., 2014

2012
Efficient Communication Protocols for Deciding Edit Distance.
Proceedings of the Algorithms - ESA 2012, 2012

2011
Tight bounds for Lp samplers, finding duplicates in streams, and related problems.
Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011

2010
Periodicity in Streams.
Proceedings of the Approximation, 2010

2008
On distance to monotonicity and longest increasing subsequence of a data stream.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007
On Completing Latin Squares.
Proceedings of the STACS 2007, 2007

2005
New Streaming Algorithms for Counting Triangles in Graphs.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005


  Loading...