|
1 |
A WSPD, Separator and Small Tree Cover for c-Packed Graphs
Deryckere, Lindsey. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
2 |
Star-Based Separators for Intersection Graphs of c-Colored Pseudo-Segments
de Berg, Mark. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
3 |
Approximating the Fréchet Distance When Only One Curve Is c-Packed
Gudmundsson, Joachim. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
4 |
The Problem Solver's Guide To Coding
Nguyen, Nhut. - Norderstedt : BoD – Books on Demand – Dänemark, 2024, 1. Auflage
|
Ankündigung
|
|
|
5 |
Computing a Subtrajectory Cluster from c-Packed Trajectories
Gudmundsson, Joachim. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
|
|
|
|
6 |
Mastering Data Structures and Algorithms in C and C++
Naha, Sachin. - München : BookRix, 2023
|
|
|
7 |
A comparison of constant false alarm rate object detection algorithms for iceberg identification in L- and C-band SAR imagery of the Labrador Sea
Enthalten in The Cryosphere Bd. 17, 2023, Nr. 12: 5335-5355. 21 S.
|
|
|
|
8 |
Performance of the K-means and fuzzy C-means algorithms in big data analytics
Enthalten in International journal of information technology 31.10.2023: 1-6
|
|
|
|
9 |
A Comparison of CFAR Object Detection Algorithms for Iceberg Identification in L- and C-band SAR Imagery of the Labrador Sea
Enthalten in The Cryosphere discussions 14.02.2023: 1-26. 26 S.
|
|
|
|
10 |
FPT Algorithms for Finding Near-Cliques in c-Closed Graphs
Behera, Balaram. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
|
|
Administration
