Nemanja Draganic

Orcid: 0000-0002-1102-3449

According to our database1, Nemanja Draganic authored at least 15 papers between 2019 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

2019
2020
2021
2022
2023
2024
0
1
2
3
4
5
6
7
3
1
3
5
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Effective Bounds for Induced Size-Ramsey Numbers of Cycles.
Comb., October, 2024

Tight bounds for divisible subdivisions.
J. Comb. Theory B, March, 2024

A generalization of Bondy's pancyclicity theorem.
Comb. Probab. Comput., 2024

Edge-disjoint paths in expanders: online with removals.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Tight bounds for powers of Hamilton cycles in tournaments.
J. Comb. Theory B, 2023

2022
The largest hole in sparse random graphs.
Random Struct. Algorithms, 2022

Ramsey number of 1-subdivisions of transitive tournaments.
J. Comb. Theory B, 2022

Short proofs for long induced paths.
Comb. Probab. Comput., 2022

2021
Large Induced Matchings in Random Graphs.
SIAM J. Discret. Math., 2021

The size-Ramsey number of short subdivisions.
Random Struct. Algorithms, 2021

Unavoidable hypergraphs.
J. Comb. Theory B, 2021

Powers of paths in tournaments.
Comb. Probab. Comput., 2021

Universal and unavoidable graphs.
Comb. Probab. Comput., 2021

Rolling backwards can move you forward: on embedding problems in sparse expanders.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2019
A Ramsey theorem for multiposets.
Eur. J. Comb., 2019


  Loading...