Domagoj Matijevic

Orcid: 0000-0003-3390-9467

Affiliations:
  • University of Osijek, Hungary
  • Max Planck Institute for Informatics, Saarbrücken, Germany (former)


According to our database1, Domagoj Matijevic authored at least 27 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Metric multidimensional scaling for large single-cell datasets using neural networks.
Algorithms Mol. Biol., December, 2024

Anti Tai mapping for unordered labeled trees.
Inf. Process. Lett., March, 2024

2023
Efficient Sentence Representation Learning via Knowledge Distillation with Maximum Coding Rate Reduction.
J. Comput. Inf. Technol., 2023

Well-Separated Pair Decompositions for High-Dimensional Datasets.
Algorithms, 2023

Compressing Sentence Representation with Maximum Coding Rate Reduction.
Proceedings of the 46th MIPRO ICT and Electronics Convention, 2023

Fortuna Detects Novel Splicing in Drosophila scRNASeq Data.
Proceedings of the 46th MIPRO ICT and Electronics Convention, 2023

2022
Optimization techniques for image representation in visual place recognition.
Proceedings of the 45th Jubilee International Convention on Information, 2022

Predicting RNA splicing branchpoints.
Proceedings of the 45th Jubilee International Convention on Information, 2022

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.
Int. J. Parallel Program., 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 J. Exp. Algorithmics, 2009

2008
Approximating k-hop minimum spanning trees in Euclidean metrics.
Inf. Process. Lett., 2008

Energy-Aware Stage Illumination.
Int. J. Comput. Geom. Appl., 2008

Improved Approximations for Guarding 1.5-Dimensional Terrains
CoRR, 2008

Constant Time Queries for Energy Efficient Paths in Multi-hop Wireless Networks.
J. Comput. Inf. Technol., 2008

2007
Geometric optimization and querying: exact & approximate.
PhD thesis, 2007

In Transit to Constant Time Shortest-Path Queries in Road Networks.
Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

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

2003
Approximating Energy Efficient Paths in Wireless Multi-hop Networks.
Proceedings of the Algorithms, 2003


  Loading...