default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDomagoj Matijevic
2020 – today
- 2025
[c15]Bartol Borozan, Luka Borozan, Domagoj Severdija, Domagoj Matijevic, Stefan Canzar:
Optimal Marker Genes for c-Separated Cell Types. RECOMB 2025: 424-427- 2024
- [j15]Stefan Canzar
, Van Hoan Do, Slobodan Jelic, Sören Laue, Domagoj Matijevic, Tomislav Prusina:
Metric multidimensional scaling for large single-cell datasets using neural networks. Algorithms Mol. Biol. 19(1): 21 (2024) - [j14]Mislav Blazevic, Stefan Canzar, Khaled Elbassioni, Domagoj Matijevic:
Anti Tai mapping for unordered labeled trees. Inf. Process. Lett. 185: 106454 (2024) - 2023
- [j13]Domagoj Matijevic:
Well-Separated Pair Decompositions for High-Dimensional Datasets. Algorithms 16(5): 254 (2023) - [j12]Domagoj Severdija, Tomislav Prusina, Luka Borozan, Domagoj Matijevic:
Efficient Sentence Representation Learning via Knowledge Distillation with Maximum Coding Rate Reduction. J. Comput. Inf. Technol. 31(4): 251-266 (2023) - [c14]Bartol Borozan, Luka Borozan, Domagoj Severdija, Domagoj Matijevic, Stefan Canzar:
Fortuna Detects Novel Splicing in Drosophila scRNASeq Data. MIPRO 2023: 410-415 - [c13]Domagoj Severdija, Tomislav Prusina, Antonio Jovanovic, Luka Borozan, Jurica Maltar, Domagoj Matijevic:
Compressing Sentence Representation with Maximum Coding Rate Reduction. MIPRO 2023: 1096-1101 - [i4]Domagoj Severdija, Tomislav Prusina, Antonio Jovanovic, Luka Borozan, Jurica Maltar, Domagoj Matijevic:
Compressing Sentence Representation with maximum Coding Rate Reduction. CoRR abs/2304.12674 (2023) - 2022
- [c12]Antonio Jovanovic, Israa Alqassem, Nathan Chappell, Stefan Canzar, Domagoj Matijevic:
Predicting RNA splicing branchpoints. MIPRO 2022: 383-388 - [c11]Jurica Maltar, Domagoj Matijevic:
Optimization techniques for image representation in visual place recognition. MIPRO 2022: 877-882 - 2021
- [i3]Mislav Blazevic, Stefan Canzar, Khaled M. Elbassioni, Domagoj Matijevic:
Anti Tai Mapping for Unordered Labeled Trees. CoRR abs/2107.08292 (2021)
2010 – 2019
- 2019
- [c10]Luka Borozan, Domagoj Matijevic, Stefan Canzar:
Properties of the generalized Robinson-Foulds metric. MIPRO 2019: 330-335 - [c9]Van Hoan Do, Mislav Blazevic, Pablo Monteagudo, Luka Borozan, Khaled M. Elbassioni, Sören Laue, Francisca Rojas Ringeling, Domagoj Matijevic, Stefan Canzar:
Dynamic Pseudo-time Warping of Complex Single-Cell Trajectories. RECOMB 2019: 294-296 - 2015
- [j11]Stefan Funke, Theocharis Malamatos, Domagoj Matijevic, Nicola Wolpert:
Conic nearest neighbor queries and approximate Voronoi diagrams. Comput. Geom. 48(2): 76-86 (2015) - [j10]Slobodan Jelic, Sören Laue, Domagoj Matijevic, Patrick Wijerama:
A Fast Parallel Implementation of a PTAS for Fractional Packing and Covering Linear Programs. Int. J. Parallel Program. 43(5): 840-875 (2015) - 2012
- [j9]Khaled M. Elbassioni, Domagoj Matijevic, Domagoj Severdija:
Guarding 1.5D terrains with demands. Int. J. Comput. Math. 89(16): 2143-2151 (2012) - [j8]Khaled M. Elbassioni, Slobodan Jelic, Domagoj Matijevic:
The relation of Connected Set Cover and Group Steiner Tree. Theor. Comput. Sci. 438: 96-101 (2012) - 2011
- [j7]Khaled M. Elbassioni, Erik Krohn, Domagoj Matijevic, Julián Mestre, Domagoj Severdija:
Improved Approximations for Guarding 1.5-Dimensional Terrains. Algorithmica 60(2): 451-463 (2011) - [j6]René Beier, Stefan Funke, Domagoj Matijevic, Peter Sanders:
Energy-Efficient Paths in Radio Networks. Algorithmica 61(2): 298-319 (2011) - 2010
- [j5]Domagoj Matijevic, Ralf Osbild:
Finding the Theta-guarded region. Comput. Geom. 43(2): 207-218 (2010)
2000 – 2009
- 2009
- [j4]Jens Maue, Peter Sanders, Domagoj Matijevic:
Goal-directed shortest-path queries using precomputed cluster distances. ACM J. Exp. Algorithmics 14 (2009) - [c8]Khaled M. Elbassioni, Erik Krohn, Domagoj Matijevic, Julián Mestre, Domagoj Severdija:
Improved Approximations for Guarding 1.5-Dimensional Terrains. STACS 2009: 361-371 - 2008
- [j3]Stefan Funke, Domagoj Matijevic, Peter Sanders:
Constant Time Queries for Energy Efficient Paths in Multi-hop Wireless Networks. J. Comput. Inf. Technol. 16(2): 119-130 (2008) - [j2]Friedrich Eisenbrand, Stefan Funke, Andreas Karrenbauer, Domagoj Matijevic:
Energy-Aware Stage Illumination. Int. J. Comput. Geom. Appl. 18(1/2): 107-129 (2008) - [j1]Sören Laue, Domagoj Matijevic:
Approximating k-hop minimum spanning trees in Euclidean metrics. Inf. Process. Lett. 107(3-4): 96-101 (2008) - [i2]Domagoj Matijevic, Ralf Osbild:
Finding the theta-Guarded Region. CoRR abs/0806.2090 (2008) - [i1]Khaled M. Elbassioni, Domagoj Matijevic, Julián Mestre, Domagoj Severdija:
Improved Approximations for Guarding 1.5-Dimensional Terrains. CoRR abs/0809.0159 (2008) - 2007
- [b1]Domagoj Matijevic:
Geometric optimization and querying: exact & approximate. Saarland University, 2007 - [c7]Hannah Bast, Stefan Funke, Domagoj Matijevic, Peter Sanders, Dominik Schultes:
In Transit to Constant Time Shortest-Path Queries in Road Networks. ALENEX 2007 - [c6]Sören Laue, Domagoj Matijevic:
Approximating k-hop Minimum Spanning Trees in Euclidean Metrics. CCCG 2007: 117-120 - 2006
- [c5]Stefan Funke, Theocharis Malamatos, Domagoj Matijevic, Nicola Wolpert:
(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram. CCCG 2006 - [c4]Hannah Bast, Stefan Funke, Domagoj Matijevic:
Ultrafast Shortest-Path Queries via Transit Nodes. The Shortest Path Problem 2006: 175-192 - [c3]Jens Maue, Peter Sanders, Domagoj Matijevic:
Goal Directed Shortest Path Queries Using Precomputed Cluster Distances. WEA 2006: 316-327 - 2005
- [c2]Friedrich Eisenbrand, Stefan Funke, Andreas Karrenbauer, Domagoj Matijevic:
Energy-aware stage illumination. SCG 2005: 336-345 - 2003
- [c1]Stefan Funke, Domagoj Matijevic, Peter Sanders:
Approximating Energy Efficient Paths in Wireless Multi-hop Networks. ESA 2003: 230-241
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-14 22:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
