Shimon Kogan

Available identifiers

Publication	Date of Publication	Type
Towards bypassing lower bounds for graph shortcuts	2025-01-06	Paper
New additive emulators	2024-11-14	Paper
New diameter-reducing shortcuts and directed hopsets: breaking the \(O(\sqrt{n})\) barrier	2024-07-19	Paper
Beating matrix multiplication for \(n^{1/3}\)-directed shortcuts	2024-06-24	Paper
Faster and unified algorithms for diameter reducing shortcuts and minimum chain covers	2024-05-14	Paper
Low-Congestion Shortcuts in Constant Diameter Graphs	2024-03-26	Paper
Social Media and Financial News Manipulation	2023-09-13	Paper
Target set selection for conservative populations	2021-10-21	Paper
A note on repeated degrees of line graphs	2021-08-09	Paper
A note on a Caro-Wei bound for the bipartite independence number in graphs	2021-03-25	Paper
On the Profile of Multiplicities of Complete Subgraphs	2020-04-07	Paper
New results on large induced forests in graphs	2019-10-03	Paper
New results on \(k\)-independence of graphs	2017-05-18	Paper
Balanced coloring of bipartite graphs	2010-11-24	Paper

This page was built for person: Shimon Kogan