From

Institution

Field

Type

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

Reset

Papers matching “hard turning” 7

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Symmetry-based quantum algorithms for open-shop scheduling with hard constraints
2025 Academia quantum. article Computer Science Quantum Computing Algorithms and Architecture Open access

Lennart Binkowski, Gereon Koßmann, Christian Tutschku, René Schwonnek

3

citations
Hard Problems on Random Graphs
2020 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Jan Dreier, Henri Lotze, Peter Rossmanith

0

citations
Hierarchical Service Composition via Blockchain-enabled Federated Learning
2024 Data Science and Engineering article Computer Science Service-Oriented Architecture and Web Services Open access

Li Huang, Lu Zhao, Yansong Liu, Yao Zhao

3

citations
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
Stochastic games with lexicographic objectives
2023 Formal Methods in System Design article Computer Science Formal Methods in Verification Open access

Krishnendu Chatterjee, Joost-Pieter Katoen, Stefanie Mohr, Maximilian Weininger, Tobias Winkler

5

citations
Exact Separation of Forbidden-Set Cuts Associated With Redundant Parity Checks of Binary Linear Codes
2020 IEEE Communications Letters article Computer Science Coding theory and cryptography Open access

Christian Puchert, Andreas M. Tillmann

2

citations
Dispersing Obnoxious Facilities on a Graph
2021 Algorithmica article Computer Science Complexity and Algorithms in Graphs Open access

Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger

0

citations

7 results