# Domagoj Matijevic

According to our database

Collaborative distances:

^{1}, Domagoj Matijevic authored at least 24 papers between 2003 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2019

Dynamic Pseudo-time Warping of Complex Single-Cell Trajectories.

Proceedings of the Research in Computational Molecular Biology, 2019

Properties of the generalized Robinson-Foulds metric.

Proceedings of the 42nd International Convention on Information and Communication Technology, 2019

2015

A Fast Parallel Implementation of a PTAS for Fractional Packing and Covering Linear Programs.

International Journal of Parallel Programming, 2015

Conic nearest neighbor queries and approximate Voronoi diagrams.

Comput. Geom., 2015

2012

The relation of Connected Set Cover and Group Steiner Tree.

Theor. Comput. Sci., 2012

Guarding 1.5D terrains with demands.

Int. J. Comput. Math., 2012

2011

Improved Approximations for Guarding 1.5-Dimensional Terrains.

Algorithmica, 2011

Energy-Efficient Paths in Radio Networks.

Algorithmica, 2011

2010

Finding the Theta-guarded region.

Comput. Geom., 2010

2009

Goal-directed shortest-path queries using precomputed cluster distances.

ACM Journal of Experimental Algorithmics, 2009

Improved Approximations for Guarding 1.5-Dimensional Terrains.

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

2008

Approximating k-hop minimum spanning trees in Euclidean metrics.

Inf. Process. Lett., 2008

Energy-Aware Stage Illumination.

Int. J. Comput. Geometry Appl., 2008

Improved Approximations for Guarding 1.5-Dimensional Terrains

CoRR, 2008

Finding the theta-Guarded Region

CoRR, 2008

Constant Time Queries for Energy Efficient Paths in Multi-hop Wireless Networks.

CIT, 2008

2007

Geometric optimization and querying: exact & approximate.

PhD thesis, 2007

Approximating k-hop Minimum Spanning Trees in Euclidean Metrics.

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

In Transit to Constant Time Shortest-Path Queries in Road Networks.

Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

2006

Goal Directed Shortest Path Queries Using Precomputed Cluster Distances.

Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

Ultrafast Shortest-Path Queries via Transit Nodes.

Proceedings of the Shortest Path Problem, 2006

(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram.

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005

Energy-aware stage illumination.

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2003

Approximating Energy Efficient Paths in Wireless Multi-hop Networks.

Proceedings of the Algorithms, 2003