|
11 |
FPT Algorithms for Finding Near-Cliques in c-Closed Graphs
Behera, Balaram. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
|
|
|
|
12 |
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems
Kanesh, Lawqueen. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
|
|
|
|
13 |
Verified Signal Processing Algorithms in Matlab and C
Cham : Springer International Publishing, 2022, 1st edition 2022
|
|
|
|
14 |
Connected k-Partition of k-Connected Graphs and c-Claw-Free Graphs
Borndörfer, Ralf. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
15 |
Exploiting c-Closure in Kernelization Algorithms for Graph Problems
Koana, Tomohiro. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
|
|
|
|
16 |
Introducing Algorithms in C
Berkeley, CA : Apress, 2020, 1st edition
|
|
|
|
17 |
Modern Data Mining Algorithms in C++ and CUDA C
Berkeley, CA : Apress, 2020, 1st edition
|
|
|
|
18 |
String Algorithms in C
Berkeley, CA : Apress, 2020, 1st edition
|
|
|
|
19 |
Complexity of C_k-Coloring in Hereditary Classes of Graphs
Chudnovsky, Maria. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
|
|
|
|
20 |
Elementary Synchronous Programming
Janfada, Ali S.. - Berlin/München/Boston : De Gruyter, 2019, 1. Auflage
|
|
Administration
