Alireza Zarei

Available identifiers

zbMath Open zarei.alirezaMaRDI QIDQ255266

List of research outcomes

Publication	Date of Publication	Type
A better LP rounding for feedback arc set on tournaments	2024-10-07	Paper
Visibility Graphs of Anchor Polygons	2022-06-28	Paper
Recognizing Visibility Graphs of Triangulated Irregular Networks	2021-11-15	Paper
Connecting guards with minimum Steiner points inside simple polygons	2019-05-29	Paper
Touring convex polygons in polygonal domain fences	2018-03-26	Paper
Efficient computation of query point visibility in polygons with holes	2017-10-20	Paper
Touring a sequence of disjoint polygons: complexity and extension	2016-06-27	Paper
Visibility Graphs of Anchor Polygons	2016-04-01	Paper
When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem	2016-03-09	Paper
Visibility testing and counting	2015-06-02	Paper
A simple, faster method for kinetic proximity problems	2015-05-12	Paper
Touring Polygons: An Approximation Algorithm	2014-08-19	Paper
Touring Disjoint Polygons Problem Is NP-Hard	2013-12-10	Paper
Kinetic Euclidean minimum spanning tree in the plane	2013-01-18	Paper
Kinetic Pie Delaunay Graph and Its Applications	2012-08-14	Paper
Efficient observer-dependent simplification in polygonal domains	2012-04-26	Paper
Kinetic Euclidean Minimum Spanning Tree in the Plane	2012-01-13	Paper
Visibility Testing and Counting	2011-06-03	Paper
Streaming algorithms for line simplification	2010-04-12	Paper
https://portal.mardi4nfdi.de/entity/Q3401225	2010-01-29	Paper
Streaming algorithms for line simplification	2009-02-12	Paper
Query point visibility computation in polygons with holes	2007-12-03	Paper

Research outcomes over time

This page was built for person: Alireza Zarei