The following pages link to Tigran Tonoyan (Q832848):
Displayed 27 items.
- Generalized disk graphs (Q832849) (← links)
- Conflict graphs and the SINR-capacity of the mean power scheme (Q896135) (← links)
- Preemptively guessing the center (Q1661896) (← links)
- Conflict graphs and the capacity of the mean power scheme (Q1796442) (← links)
- Guessing fractions of online sequences (Q2064290) (← links)
- Linial for lists (Q2104037) (← links)
- Limitations of current wireless link scheduling algorithms (Q2202005) (← links)
- Computing inductive vertex orderings (Q2234785) (← links)
- Network design under general wireless interference (Q2665910) (← links)
- How Well Can Graphs Represent Wireless Interference? (Q2941559) (← links)
- Algorithms for Scheduling with Power Control in Wireless Networks (Q2999351) (← links)
- Spanning Trees With Edge Conflicts and Wireless Connectivity (Q5002848) (← links)
- Sparse Backbone and Optimal Distributed SINR Algorithms (Q5032025) (← links)
- (Q5111461) (← links)
- Plain SINR is Enough! (Q5145190) (← links)
- Leveraging Indirect Signaling for Topology Inference and Fast Broadcast (Q5197670) (← links)
- The Price of Local Power Control in Wireless Scheduling (Q5275394) (← links)
- Brief Announcement (Q5361935) (← links)
- On Some Bounds on the Optimum Schedule Length in the SINR Model (Q5507397) (← links)
- Effective Wireless Scheduling via Hypergraph Sketches (Q5858652) (← links)
- Query minimization under stochastic uncertainty (Q5918504) (← links)
- Query minimization under stochastic uncertainty (Q5925528) (← links)
- Efficient randomized distributed coloring in CONGEST (Q6065242) (← links)
- Near-optimal distributed degree+1 coloring (Q6083497) (← links)
- Unimodal eccentricity in trees (Q6087156) (← links)
- (Q6126264) (← links)
- Overcoming Congestion in Distributed Coloring (Q6201994) (← links)