Alireza Zarei

From MaRDI portal
Person:255266

Available identifiers

zbMath Open zarei.alirezaMaRDI QIDQ255266

List of research outcomes





PublicationDate of PublicationType
A better LP rounding for feedback arc set on tournaments2024-10-07Paper
Visibility Graphs of Anchor Polygons2022-06-28Paper
Recognizing Visibility Graphs of Triangulated Irregular Networks2021-11-15Paper
Connecting guards with minimum Steiner points inside simple polygons2019-05-29Paper
Touring convex polygons in polygonal domain fences2018-03-26Paper
Efficient computation of query point visibility in polygons with holes2017-10-20Paper
Touring a sequence of disjoint polygons: complexity and extension2016-06-27Paper
Visibility graphs of anchor polygons2016-04-01Paper
When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem2016-03-09Paper
Visibility testing and counting2015-06-02Paper
A simple, faster method for kinetic proximity problems2015-05-12Paper
Touring polygons: an approximation algorithm2014-08-19Paper
Touring disjoint polygons problem is NP-hard2013-12-10Paper
Kinetic Euclidean minimum spanning tree in the plane2013-01-18Paper
Kinetic pie Delaunay graph and its applications2012-08-14Paper
Efficient observer-dependent simplification in polygonal domains2012-04-26Paper
Kinetic Euclidean minimum spanning tree in the plane2012-01-13Paper
Visibility testing and counting2011-06-03Paper
Streaming algorithms for line simplification2010-04-12Paper
A practical approach for planar visibility maintenance2010-01-29Paper
Streaming algorithms for line simplification2009-02-12Paper
Query point visibility computation in polygons with holes2007-12-03Paper

Research outcomes over time

This page was built for person: Alireza Zarei