| Hardness of approximation of the balanced complete bipartite subgraph problem U Feige, S Kogan Dept. Comput. Sci. Appl. Math., Weizmann Inst. Sci., Rehovot, Israel, Tech …, 2004 | 90 | 2004 |
| New diameter-reducing shortcuts and directed hopsets: Breaking the barrier S Kogan, M Parter Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 23 | 2022 |
| Beating Matrix Multiplication for n^{1/3}-Directed Shortcuts S Kogan, M Parter 49th International Colloquium on Automata, Languages, and Programming (ICALP …, 2022 | 19 | 2022 |
| The hardness of approximating hereditary properties U Feige, S Kogan Available on: http://research. microsoft. com/research/theory/feige …, 2005 | 15 | 2005 |
| Having hope in hops: New spanners, preservers and lower bounds for hopsets S Kogan, M Parter 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 14 | 2022 |
| Balanced coloring of bipartite graphs U Feige, S Kogan Journal of Graph Theory 64 (4), 277-291, 2010 | 11 | 2010 |
| Low-congestion shortcuts in constant diameter graphs S Kogan, M Parter Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing …, 2021 | 10 | 2021 |
| Faster and unified algorithms for diameter reducing shortcuts and minimum chain covers S Kogan, M Parter Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 8 | 2023 |
| New Results on -Independence of Graphs S Kogan the electronic journal of combinatorics, P2. 15-P2. 15, 2017 | 8 | 2017 |
| Target set selection for conservative populations U Feige, S Kogan Discrete Applied Mathematics 305, 119-132, 2021 | 6 | 2021 |
| A note on a Caro–Wei bound for the bipartite independence number in graphs S Kogan Discrete Mathematics 344 (4), 112285, 2021 | 5 | 2021 |
| New additive emulators S Kogan, M Parter 50th International Colloquium on Automata, Languages, and Programming (ICALP …, 2023 | 4 | 2023 |
| On the profile of multiplicities of complete subgraphs U Feige, A Kenyon, S Kogan SIAM Journal on Discrete Mathematics 34 (1), 950-971, 2020 | 2 | 2020 |
| A note on forcing 3-repetitions in degree sequences S Kogan Discussiones Mathematicae Graph Theory, 2023 | 1 | 2023 |
| Towards Bypassing Lower Bounds for Graph Shortcuts S Kogan, M Parter 31st Annual European Symposium on Algorithms (ESA 2023), 2023 | 1 | 2023 |
| A note on repeated degrees of line graphs S Kogan The Electronic Journal of Combinatorics, P3. 35-P3. 35, 2021 | 1 | 2021 |
| New results on large induced forests in graphs S Kogan arXiv preprint arXiv:1910.01356, 2019 | 1 | 2019 |
| Distance labeling in general graphs S Kogan, H Petersen 45. Workshop für Komplexitätstheorie, Datenstrukturen und effiziente …, 2002 | 1 | 2002 |
| The Algorithmic Power of the Greene-Kleitman Theorem S Kogan, M Parter 32nd Annual European Symposium on Algorithms (ESA 2024), 2024 | | 2024 |
| Giving Some Slack: Shortcuts and Transitive Closure Compressions S Kogan, M Parter 32nd Annual European Symposium on Algorithms (ESA 2024), 2024 | | 2024 |
Merav ParterAssociate Professor, Weizmann Institute在 weizmann.ac.il 的电子邮件经过验证
Merav ParterAssociate Professor, Weizmann Institute在 weizmann.ac.il 的电子邮件经过验证
Uriel FeigeProfessor of Computer Science, Weizmann Institute of Science在 weizmann.ac.il 的电子邮件经过验证