Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Radoš Radoicić
Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs
Related publications
Finding Paths in Sparse Random Graphs Requires Many Queries
Random Structures and Algorithms
Mathematics
Applied Mathematics
Computer Graphics
Computer-Aided Design
Software
A Crossing Lemma for Jordan Curves
Advances in Mathematics
Mathematics
Splitting Lemma for 2-Connected Graphs
ISRN Discrete Mathematics
Are Crossings Important for Drawing Large Graphs?
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Braess’s Paradox in Large Sparse Graphs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Sparse Universal Graphs for Bounded-Degree Graphs
Random Structures and Algorithms
Mathematics
Applied Mathematics
Computer Graphics
Computer-Aided Design
Software
Parallel Symmetry-Breaking in Sparse Graphs
SIAM Journal on Discrete Mathematics
Mathematics
Stars and Bonds in Crossing-Critical Graphs
Journal of Graph Theory
Geometry
Topology
Finding Large Cycles in Hamiltonian Graphs
Discrete Applied Mathematics
Combinatorics
Applied Mathematics
Discrete Mathematics