Iqra Altaf Gillani

Orcid: 0000-0001-8656-4023

According to our database1, Iqra Altaf Gillani authored at least 21 papers between 2017 and 2025.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Decentralized Ridesharing: Overcoming Scalability Issues with Layer 2 Solution.
Proceedings of the 26th International Conference on Distributed Computing and Networking, 2025

2024
Fair and Efficient Ridesharing: A Dynamic Programming-based Relocation Approach.
ACM Trans. Intell. Syst. Technol., October, 2024

Towards a Greener and Fairer Transportation System: A Survey of Route Recommendation Techniques.
ACM Trans. Intell. Syst. Technol., February, 2024

A greedy approach for increased vehicle utilization in ridesharing platforms.
Expert Syst. Appl., 2024

Influence Maximization in Temporal Networks with Persistent and Reactive Behaviors.
CoRR, 2024

Maintaining Distributed Data Structures in Dynamic Peer-to-Peer Networks.
CoRR, 2024

TransFed: A way to epitomize Focal Modulation using Transformer-based Federated Learning.
Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision, 2024

TBCELF: Temporal Budget-Aware Influence Maximization.
Proceedings of the 7th Joint International Conference on Data Science & Management of Data (11th ACM IKDD CODS and 29th COMAD), 2024

Fair and efficient route recommendation system for ridesharing platforms.
Proceedings of the 7th Joint International Conference on Data Science & Management of Data (11th ACM IKDD CODS and 29th COMAD), 2024

2023
A greedy approach for increased vehicle utilization in ridesharing networks.
CoRR, 2023

GNN-based Passenger Request Prediction.
CoRR, 2023

2021
A queueing network-based distributed Laplacian solver for directed graphs.
Inf. Process. Lett., 2021

Lower bounds for in-network computation of arbitrary functions.
Distributed Comput., 2021

A Queueing Network-Based Distributed Laplacian Solver.
Algorithmica, 2021

Balance Maximization in Signed Networks via Edge Deletions.
Proceedings of the WSDM '21, 2021

A Group-to-Group Version of Random Walk Betweenness Centrality.
Proceedings of the CODS-COMAD 2021: 8th ACM IKDD CODS and 26th COMAD, 2021

Blockchain-Based Incentive Mechanism to Combat Fake News.
Proceedings of the Advances in Cyber Security - Third International Conference, 2021

2019
A Distributed Laplacian Solver and its Applications to Electrical Flow and Random Spanning Tree Computation.
CoRR, 2019

Light-weight, Real-time Internet Traffic Classification.
Proceedings of the 2019 IEEE International Conference on Advanced Networks and Telecommunications Systems, 2019

2017
Random walk based in-network computation of arbitrary functions.
CoRR, 2017

Decentralized Random Walk-Based Data Collection in Networks.
CoRR, 2017


  Loading...