
Apply Sorting Algorithms to FAST Problem
FAST problem is finding minimum feedback arc set problem in tournaments....
read it

A Fast and Efficient algorithm for ManyToMany Matching of Points with Demands in One Dimension
Given two point sets S and T, we first study the manytomany matching w...
read it

A Faster Algorithm for the LimitedCapacity ManytoMany Point Matching in One Dimension
Given two point sets S and T on a line, we present a linear time algorit...
read it

A New Optimal Algorithm for Computing the Visibility Area of a simple Polygon from a Viewpoint
Given a simple polygon P of n vertices in the Plane. We study the pr...
read it

An Optimal Algorithm for Computing the Visibility Area of a Polygon from a Point Using ConstantMemory
Given a simple polygon P of n vertices in the Plane. We study the prob...
read it

Adversarial Training for Probabilistic Spiking Neural Networks
Classifiers trained using conventional empirical risk minimization or ma...
read it

Training Probabilistic Spiking Neural Networks with Firsttospike Decoding
Thirdgeneration neural networks, or Spiking Neural Networks (SNNs), aim...
read it

Guarding Path Polygons with Orthogonal Visibility
We are interested in the problem of guarding simple orthogonal polygons ...
read it

Minimum Hidden Guarding of Histogram Polygons
A hidden guard set G is a set of point guards in polygon P that all ...
read it

A Lineartime Algorithm for Orthogonal Watchman Route Problem with Minimum Bends
Given an orthogonal polygon P with n vertices, the goal of the watch...
read it

Geometric Embedding of Path and Cycle Graphs in Pseudoconvex Polygons
Given a graph G with n vertices and a set S of n points in the p...
read it
Alireza Bagheri
is this you? claim profile