From

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Reset

Papers matching “Leibniz” 70

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

The Parameterized Complexity of Learning Monadic Second-Order Logic
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Steffen van Bergerem

0

citations
Deciding Termination of Simple Randomized Loops
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Logic, programming, and type systems Open access

0

citations
Solving Partial Dominating Set and Related Problems Using Twin-Width
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Jakub Balabán

0

citations
Symmetric Proofs in the Ideal Proof System
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Complexity and Algorithms in Graphs Open access

Benedikt Pago

0

citations
Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Complexity and Algorithms in Graphs Open access

0

citations
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Complexity and Algorithms in Graphs Open access

0

citations
Query Languages for Neural Networks
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Logic, Reasoning, and Knowledge Open access

Juno Steegmans

0

citations
A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs
2026 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Thekla Hamm, Sukanya Pandey, Krisztina Szilágyi

0

citations
The Complexity of Homomorphism Reconstruction Revisited
2026 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Timo Gervens, Martin Grohe, Louis Härtel, Philipp Silva da Fonseca

0

citations
The Importance of Parameters in Ranking Functions
2026 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Database Systems and Queries Open access

Christoph Standke, Nikolaos Tziavelis, Wolfgang Gatterbauer, Benny Kimelfeld

0

citations
Endgames in Fog of War Chess
2026 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Artificial Intelligence in Games Open access

Matthias Gehnen, Julius Stannat

0

citations
The Complexity of Homomorphism Reconstruction Revisited
2026 Leibniz international proceedings in informatics book-chapter Computer Science Complexity and Algorithms in Graphs Open access

Timo Gervens, Martin Grohe, Louis Härtel, Philipp Silva da Fonseca

0

citations
Query Languages for Machine-Learning Models (Invited Talk)
2026 Leibniz international proceedings in informatics book-chapter Computer Science Advanced Database Systems and Queries Open access

Martin Grohe

0

citations
A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs
2026 Leibniz international proceedings in informatics book-chapter Computer Science Advanced Graph Theory Research Open access

Thekla Hamm, Sukanya Pandey, Krisztina Szilágyi

0

citations
The Importance of Parameters in Ranking Functions
2026 Leibniz international proceedings in informatics article Computer Science Information Retrieval and Search Behavior Open access

Christoph Standke, Nikolaos Tziavelis, Wolfgang Gatterbauer, Benny Kimelfeld

0

citations
BendersNetworkDesign.jl
2026 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Complexity and Algorithms in Graphs Open access

Tim Donkiewicz

0

citations
Deciding Termination of Simple Randomized Loops
2025 Leibniz international proceedings in informatics article Computer Science Logic, programming, and type systems Open access

Éléanore Meyer, Jürgen Giesl

0

citations
GATE Workshop #2 - Capacity Building in Times of AI: Finding Solutions with the GATE
2025 Zenodo (CERN European Organization for Nuclear Research) report Computer Science Research Data Management Practices Open access

Anika Müller-Karabil, Marie Alavi

0

citations
Advancing Research Data Management in Universities of Science and Technology
2020 Zenodo (CERN European Organization for Nuclear Research) other Computer Science Research Data Management Practices Open access

Mattias Björnmalm, Federica Cappelluti, Alastair Dunning, Dana Gheorghe, Malgorzata Zofia Goraczek, Daniela Hausen, +6 more

2

citations
NFDI4Energy – National Research Data Infrastructure for Interdisciplinary Energy System Research: Progress Report
2026 Zenodo (CERN European Organization for Nuclear Research) report Computer Science Research Data Management Practices Open access

Astrid Nieße, Stephan Ferenz, Sören Auer, Felix Engel, Olha Finke, Jan Forberg, +30 more

0

citations