The following pages link to Miloš Stojaković (Q377491):
Displaying 50 items.
- Many collinear \(k\)-tuples with no \(k+1\) collinear points (Q377492) (← links)
- Consistent digital line segments (Q420574) (← links)
- Doubly biased maker-breaker connectivity game (Q426836) (← links)
- Linear time algorithm for optimal feed-link placement (Q482338) (← links)
- On saturation games (Q499485) (← links)
- Global maker-breaker games on sparse graphs (Q616371) (← links)
- Fast winning strategies in avoider-enforcer games (Q844236) (← links)
- Avoider-enforcer: the rules of the game (Q966059) (← links)
- On winning fast in Avoider-Enforcer games (Q976704) (← links)
- Limit shape of optimal convex Lattice polygons in the sense of different metrics. (Q1408879) (← links)
- Random planar lattices and integrated superBrownian excursion (Q1424400) (← links)
- Winning fast in biased maker-breaker games (Q1690027) (← links)
- Almost sure convergence of urn models in a random environment (Q1848051) (← links)
- Concentration for locally acting permutations (Q1874360) (← links)
- On strong avoiding games (Q2111931) (← links)
- Structural properties of bichromatic non-crossing matchings (Q2247147) (← links)
- The toucher-isolator game (Q2327219) (← links)
- Faster bottleneck non-crossing matchings of points in convex position (Q2401333) (← links)
- Positional games (Q2438527) (← links)
- On bichromatic triangle game (Q2448874) (← links)
- Online balanced graph avoidance games (Q2461779) (← links)
- Fast winning strategies in maker-breaker games (Q2519013) (← links)
- Discrepancy after adding a single set (Q2568502) (← links)
- Wilf classes of pairs of permutations of length 4 (Q2571265) (← links)
- The insertion encoding of permutations (Q2571290) (← links)
- Searching for two counterfeit coins with two-arms balance (Q2576348) (← links)
- The perimeter of optimal convex lattice polygons in the sense of different metrics (Q2721592) (← links)
- On the threshold for the maker-breaker \(H\)-game (Q2830239) (← links)
- Bichromatic triangle games (Q2840692) (← links)
- Avoider-Enforcer: the rules of the game (Q2851474) (← links)
- Digitalizing line segments (Q2857358) (← links)
- A threshold for the maker-breaker clique game (Q2925528) (← links)
- Hamiltonian Maker–Breaker Games on Small Graphs (Q3383707) (← links)
- On Finding The Limit Shape Of Optimal Convex Lattice Polygons (Q3438994) (← links)
- Fast winning strategies in positional games (Q3503475) (← links)
- (Q3576713) (← links)
- A sharp threshold for the Hamilton cycle Maker–Breaker game (Q3608315) (← links)
- Planarity, Colorability, and Minor Games (Q3614201) (← links)
- On restricted min‐wise independence of permutations (Q4446870) (← links)
- Fast strategies in biased Maker--Breaker games (Q4560259) (← links)
- Zero-Error Capacity of $ P $ -ary Shift Channels and FIFO Queues (Q4566597) (← links)
- Positional games on random graphs (Q4667863) (← links)
- (Q4794057) (← links)
- (Q4922365) (← links)
- Semi‐random graph process (Q5113951) (← links)
- Maker‐breaker games on random geometric graphs (Q5256385) (← links)
- Consistent digital line segments (Q5405857) (← links)
- (Q5419989) (← links)
- Approximate Sorting (Q5900355) (← links)
- Approximate Sorting (Q5901750) (← links)
