|
1 |
Anytime and Exact Search for Planning Problems: How to Explore a DP-based State Transition Graph with A*, CP and LS? (Invited Talk)
Solnon, Christine. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
2 |
Classifications at the intersection of group and graph theory
Kaja, Eda. - Darmstadt : Universitäts- und Landesbibliothek, 2025
|
|
|
|
3 |
Maximal Planar Graph Theory and the Four-Color Conjecture
Xu, Jin. - Singapore : Springer Nature Singapore, Imprint: Springer, 2025, 1st ed. 2025
|
|
|
|
4 |
O(1)-Round MPC Algorithms for Multi-Dimensional Grid Graph Connectivity, Euclidean MST and DBSCAN
Gan, Junhao. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
5 |
An Ontology and Geospatial Knowledge Graph for Reasoning About Cascading Failures (Short Paper)
Hahmann, Torsten. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
6 |
Combining integer programs and graph grammars: Theory and implementation in Attestor
Ferber, Alexander. - Aachen : Universitätsbibliothek der RWTH Aachen, 2024
|
|
|
|
7 |
Evaluating Graph Queries Using Semantic Treewidth
Feier, Cristina. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
8 |
Investigating robust associations between functional connectivity based on graph theory and general intelligence
Metzen, Dorothea. - Bochum : Ruhr-Universität Bochum, 2024
|
|
|
|
9 |
Parallel Clause Sharing Strategy Based on Graph Structure of SAT Problem
Iida, Yoichiro. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
10 |
(Quantum) Complexity of Testing Signed Graph Clusterability
Chen, Kuo-Chin. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
Administration
