- 
Christos Tsanikidis, Javad Ghaderi, Scheduling Stochastic Traffic With End-to-End Deadlines in Multi-hop Wireless Networks, IEEE INFOCOM 2024, Apr 2024, pp. 651-660 — Best Paper Award. 
- 
Christos Tsanikidis, Javad Ghaderi, Near-optimal Packet Scheduling in Multihop Networks with End-to-End Deadline Constraints, ACM SIGMETRICS Performance Evaluation Review 52 (1), 33-34, 2024. (Extended version of PACMPL MACS 7 (3), 2023.) 
- 
Christos Tsanikidis, Javad Ghaderi, Near-optimal Packet Scheduling in Multihop Networks with End-to-End Deadline Constraints, Proceedings of the ACM on Measurement and Analysis of Computing Systems 7 (3), 2023. 
- 
Christos Tsanikidis, Javad Ghaderi, Online Scheduling and Routing with End-to-End Deadline Constraints in Multihop Wireless Networks, Proc. ACM MobiHoc 2022, Oct 2022. 
- 
Christos Tsanikidis, Javad Ghaderi, Randomized Scheduling of Real-Time Traffic in Wireless Networks Over Fading Channels, IEEE INFOCOM 2021, May 2021. Full version in IEEE/ACM Transactions on Networking 31 (4), Nov 2022. [arXiv:2101.04815] 
- 
Christos Tsanikidis, Javad Ghaderi, On the Power of Randomization for Scheduling Real-Time Traffic in Wireless Networks, IEEE INFOCOM 2020, July 2020 — Best Paper Award. Full version in IEEE/ACM Transactions on Networking 29 (4), Aug 2021. [arXiv:2001.05146] 
- 
Christos Tsanikidis, Margarita Vitoropoulou, Vasileios Karyotis, Symeon Papavassiliou, On the Energy-Efficient Coverage of Network Regions with Convex Opaque Obstacles, IEEE PIMRC 2018, Sept 2018. 
- 
Christos Tsanikidis, Theory and Algorithms for Scheduling Deadline-Constrained Packets in Single-Hop and Multi-Hop Wireless Networks, Ph.D. Dissertation, Columbia University, 2024. 
Research
    
    
      ·2 mins·
  
    
    
    
  
  
  
  
  
  
      Related
          About
        
      
      
    
    
      ·1 min
    
    
    
  
  
  
  
  
  
      
          About
        
      
      
    
    
      ·1 min
    
    
    
  
  
  
  
  
  
      
          Era of minimal writing
        
      
      
    
    
      ·1 min
    
    
    
  
  
  
  
  
  
      