We stand with Ukraine

We stand with Ukraine

Shimon Kogan

Orcid: 0000-0001-8992-9251

According to our database¹, Shimon Kogan authored at least 19 papers between 2009 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2024

The Algorithmic Power of the Greene-Kleitman Theorem.

[BibT_eX]

[DOI]

,

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Giving Some Slack: Shortcuts and Transitive Closure Compressions.

[BibT_eX]

[DOI]

,

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

A note on forcing 3-repetitions in degree sequences.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2023

Faster and Unified Algorithms for Diameter Reducing Shortcuts and Minimum Chain Covers.

[BibT_eX]

[DOI]

,

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

New Additive Emulators.

[BibT_eX]

[DOI]

,

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Towards Bypassing Lower Bounds for Graph Shortcuts.

[BibT_eX]

[DOI]

,

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

New Diameter-Reducing Shortcuts and Directed Hopsets: Breaking the Barrier.

[BibT_eX]

[DOI]

,

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Beating Matrix Multiplication for n^{1/3}-Directed Shortcuts.

[BibT_eX]

[DOI]

,

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Having Hope in Hops: New Spanners, Preservers and Lower Bounds for Hopsets.

[BibT_eX]

[DOI]

,

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

A note on a Caro-Wei bound for the bipartite independence number in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2021

Target set selection for conservative populations.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2021

New Diameter-Reducing Shortcuts and Directed Hopsets: Breaking the √n Barrier.

[BibT_eX]

[DOI]

,

CoRR, 2021

A Note on Repeated Degrees of Line Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

Low-Congestion Shortcuts in Constant Diameter Graphs.

[BibT_eX]

[DOI]

,

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

2020

On the Profile of Multiplicities of Complete Subgraphs.

[BibT_eX]

[DOI]

,

,

SIAM J. Discret. Math., 2020

2017

New Results on k-Independence of Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

2012

Investor Inattention and the Market Impact of Summary Statistics.

[BibT_eX]

[DOI]

,

,

,

Ataman Ozyildirim

Manag. Sci., 2012

2010

Balanced coloring of bipartite graphs.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2010

2009

Predicting Risk from Financial Reports with Regression.

[BibT_eX]

[DOI]

,

,

Bryan R. Routledge

,

,

Proceedings of the Human Language Technologies: Conference of the North American Chapter of the Association of Computational Linguistics, Proceedings, May 31, 2009

Loading...