Alireza Bagheri

Orcid: 0000-0002-3542-7763

According to our database1, Alireza Bagheri authored at least 85 papers between 2004 and 2024.

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

Timeline

2005
2010
2015
2020
0
5
10
15
5
6
3
3
1
7
1
13
8
3
4
3
3
1
2
1
1
2
1
3
2
3
3
1
4
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Separating Bichromatic Point Sets by an Axis-Parallel C-shaped Polygon.
J. Inf. Sci. Eng., July, 2024

The Longest Path Problem in Odd-Sized O-Shaped Grid Graphs.
Int. J. Found. Comput. Sci., April, 2024

Hamiltonian (s, t)-paths in solid supergrid graphs.
Comput. Appl. Math., April, 2024

Disinformation detection using graph neural networks: a survey.
Artif. Intell. Rev., March, 2024

LOSS-GAT: Label Propagation and One-Class Semi-Supervised Graph Attention Network for Fake News Detection.
CoRR, 2024

2023
Deep neural ranking model using distributed smoothing.
Expert Syst. Appl., August, 2023

A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes.
Optim. Methods Softw., May, 2023

Securing Pathways with Orthogonal Robots.
CoRR, 2023

Minimizing Turns in Watchman Robot Navigation: Strategies and Solutions.
CoRR, 2023

Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time.
Appl. Math. Comput., 2023

An Overview of Recent Development of the Gap-Waveguide Technology for mmWave and Sub-THz Applications.
IEEE Access, 2023

2022
A High-Voltage Capacitor Charger Based on a Novel LCCL Resonant Converter.
IEEE Trans. Ind. Electron., 2022

A Survey on Indoor Positioning Systems for IoT-Based Applications.
IEEE Internet Things J., 2022

Computing a many-to-many matching with demands and capacities between two sets using the Hungarian algorithm.
CoRR, 2022

2021
CFIN: A community-based algorithm for finding influential nodes in complex social networks.
J. Supercomput., 2021

NP-completeness of chromatic orthogonal art gallery problem.
J. Supercomput., 2021

Determining the Parameters of DBSCAN Automatically Using the Multi-Objective Genetic Algorithm.
J. Inf. Sci. Eng., 2021

2020
Linear-time algorithms for finding Hamiltonian and longest (s, t)-paths in C-shaped grid graphs.
Discret. Optim., 2020

Virtual Machine Placement for Edge and Cloud Computing.
Proceedings of the Advances in Service-Oriented and Cloud Computing, 2020

2019
Indoor navigation systems based on data mining techniques in internet of things: a survey.
Wirel. Networks, 2019

Weighted label propagation based on Local Edge Betweenness.
J. Supercomput., 2019

Longest (s, t)-paths in L-shaped grid graphs.
Optim. Methods Softw., 2019

Apply Sorting Algorithms to FAST Problem.
CoRR, 2019

A Fast and Efficient algorithm for Many-To-Many Matching of Points with Demands in One Dimension.
CoRR, 2019

A Faster Algorithm for the Limited-Capacity Many-to-Many Point Matching in One Dimension.
CoRR, 2019

Weighted Label Propagation Algorithm based on Local Edge Betweenness.
CoRR, 2019

2018
A New Optimal Algorithm for Computing the Visibility Area of a simple Polygon from a Viewpoint.
CoRR, 2018

Adversarial Training for Probabilistic Spiking Neural Networks.
Proceedings of the 19th IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2018

PASLPA - Overlapping Community Detection in Massive Real Networks Using Apache Spark.
Proceedings of the 9th International Symposium on Telecommunications, 2018

Training Probabilistic Spiking Neural Networks with First- To-Spike Decoding.
Proceedings of the 2018 IEEE International Conference on Acoustics, 2018

2017
A Comprehensive Framework for Spectrum Sensing in Non-Linear and Generalized Fading Conditions.
IEEE Trans. Veh. Technol., 2017

Joint Uplink/Downlink Optimization for Backhaul-Limited Mobile Cloud Computing With User Scheduling.
IEEE Trans. Signal Inf. Process. over Networks, 2017

A linear-time algorithm for finding Hamiltonian (s, t)-paths in odd-sized rectangular grid graphs with a rectangular hole.
J. Supercomput., 2017

Embedding cycles and paths on solid grid graphs.
J. Supercomput., 2017

A linear-time algorithm for finding Hamiltonian (s, t)-paths in even-sized rectangular grid graphs with a rectangular hole.
Theor. Comput. Sci., 2017

Separating Bichromatic Point Sets by Minimal Triangles with a Fixed Angle.
Int. J. Found. Comput. Sci., 2017

Local Edge Betweenness based Label Propagation for Community Detection in Complex Networks.
CoRR, 2017

Guarding Path Polygons with Orthogonal Visibility.
CoRR, 2017

Minimum Hidden Guarding of Histogram Polygons.
CoRR, 2017

A Linear-time Algorithm for Orthogonal Watchman Route Problem with Minimum Bends.
CoRR, 2017

Geometric Embedding of Path and Cycle Graphs in Pseudo-convex Polygons.
CoRR, 2017

An O(n^2) algorithm for Many-To-Many Matching of Points with Demands in One Dimension.
CoRR, 2017

Presenting novel application-based centrality measures for finding important users based on their activities and social behavior.
Comput. Hum. Behav., 2017

2016
Hamiltonian paths in L-shaped grid graphs.
Theor. Comput. Sci., 2016

An approximation algorithm for the longest path problem in solid grid graphs.
Optim. Methods Softw., 2016

A limited memory quasi-Newton trust-region method for box constrained optimization.
J. Comput. Appl. Math., 2016

Presenting new collaborative link prediction methods for activity recommendation in Facebook.
Neurocomputing, 2016

An approximation algorithm for the longest cycle problem in solid grid graphs.
Discret. Appl. Math., 2016

Hamiltonian Paths in C-shaped Grid Graphs.
CoRR, 2016

Biased sampling from facebook multilayer activity network using learning automata.
Appl. Intell., 2016

An O(n<sup>2</sup>) Algorithm for the Limited-Capacity Many-to-Many Point Matching in One Dimension.
Algorithmica, 2016

Energy detection based spectrum sensing over enriched multipath fading channels.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2016

Joint uplink/downlink and offloading optimization for mobile cloud computing with limited backhaul.
Proceedings of the 2016 Annual Conference on Information Science and Systems, 2016

2015
An efficient distributed max-flow algorithm for Wireless Sensor Networks.
J. Netw. Comput. Appl., 2015

An O(1)-approximation algorithm for the 2-dimensional geometric freeze-tag problem.
Inf. Process. Lett., 2015

Constrained Point Set Embedding of a Balanced Binary Tree.
Int. J. Found. Comput. Sci., 2015

Area under ROC curve of energy detection over generalized fading channels.
Proceedings of the 26th IEEE Annual International Symposium on Personal, 2015

Spectrum sensing in generalized multipath fading conditions using square-law combining.
Proceedings of the 2015 IEEE International Conference on Communications, 2015

AUC study of energy detection based spectrum sensing over η-μ and α-μ fading channels.
Proceedings of the 2015 IEEE International Conference on Communications, 2015

2014
Another Look at Performance Analysis of Energy Detector with Multichannel Reception in Nakagami-m Fading Channels.
Wirel. Pers. Commun., 2014

A PTAS for geometric 2-FTP.
Inf. Process. Lett., 2014

An O(n^3) time algorithm for the maximum weight b-matching problem on bipartite graphs.
CoRR, 2014

Unit-length embedding of cycles and paths on grid graphs.
CoRR, 2014

2013
An efficient parallel algorithm for the longest path problem in meshes.
J. Supercomput., 2013

Many to Many Matching with Demands and Capacities
CoRR, 2013

Embedding a balanced binary tree on a bounded point set
CoRR, 2013

An analytical model for primary user emulation attacks in IEEE 802.22 networks.
Proceedings of the International Conference on Connected Vehicles and Expo, 2013

A unified approach to performance analysis of energy detection with diversity receivers over Nakagami-m fading channels.
Proceedings of the International Conference on Connected Vehicles and Expo, 2013

Analytical and learning-based spectrum sensing over channels with both fading and shadowing.
Proceedings of the International Conference on Connected Vehicles and Expo, 2013

2012
Hamiltonian Paths in Some Classes of Grid Graphs.
J. Appl. Math., 2012

A linear-time algorithm for the longest path problem in rectangular grid graphs.
Discret. Appl. Math., 2012

Limited-Capacity Many-To-Many Point Matching in One Dimension
CoRR, 2012

Cooperative Spectrum Sensing over ?-μ Fading Channel.
Proceedings of the 2012 Seventh International Conference on Broadband, 2012

2011
Hamiltonian Paths in Two Classes of Grid Graphs
CoRR, 2011

A Simulated Annealing Approach for the Freeze-Tag Problem.
Proceedings of the International Conference on Recent Trends in Information Systems, 2011

AAA: Asynchronous Adaptive Algorithm to solve Max-Flow Problem in wireless sensor networks.
Proceedings of the MIPRO, 2011

Near-Optimal Flow in wireless sensor networks.
Proceedings of the MIPRO, 2011

Communications in Computer and Information Science: Performance Improvement and Interference Reduction through Complex Task Partitioning in a Self-organized Robotic Swarm.
Proceedings of the Software Engineering and Computer Systems, 2011

2010
Planar straight-line point-set embedding of trees with partial embeddings.
Inf. Process. Lett., 2010

Drawing complete binary trees inside rectilinear polygons.
Int. J. Comput. Math., 2010

2009
Complexity of Planar Embeddability of Trees inside Simple Polygons
CoRR, 2009

2008
Approximation Algorithms for Edge-Covering Problem.
Proceedings of the Advances in Computer Science and Engineering, 2008

2005
How to Draw Free Trees Inside Bounded Simple Polygons.
J. Univers. Comput. Sci., 2005

2004
How to draw free trees inside bounded rectilinear polygons.
Int. J. Comput. Math., 2004

Drawing Free Trees Inside Simple Polygons Using Polygon Skeleton.
Comput. Artif. Intell., 2004


  Loading...