From

Institution

Field

Type

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

Reset

Papers matching “problem decomposition” 55

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

A decomposition-compatible canonization framework for the graph isomorphism problem
2021 RWTH Publications (RWTH Aachen) dissertation Computer Science Graph Theory and Algorithms Open access

Daniel Wiebking

0

citations
Requirements for Early Quantum Utility and Quantum Utility in the Capacitated Vehicle Routing Problem
2025 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Chinonso Onah, Kristel F. L. Michielsen

0

citations
A Scalable Two-Level Domain Decomposition Eigensolver for Periodic Schrödinger Eigenstates in Anisotropically Expanding Domains
2024 SIAM Journal on Scientific Computing article Computer Science Matrix Theory and Algorithms Open access

Lambert Theisen, Benjamin Stamm

0

citations
Robust optimization and variants of the scheduling problem
2026 RWTH Publications (RWTH Aachen) dissertation Computer Science Complexity and Algorithms in Graphs Open access

Jenny Segschneider

0

citations
Solving weakly supervised regression problem using low-rank manifold regularization
2021 arXiv (Cornell University) preprint Computer Science Machine Learning and Algorithms Open access

Vladimir Berikov, Alexander Litvinenko

2

citations
Quantum circuit decomposition of the tangent-fermion Dirac operator
2026 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

C. W. J. Beenakker

0

citations
Cylindrical algebraic decomposition based methods in satisfiability modulo non-linear real arithmetic
2025 RWTH Publications (RWTH Aachen) dissertation Computer Science Polynomial and algebraic computation Open access

0

citations
Cylindrical algebraic decomposition for nonlinear arithmetic problems
2020 RWTH Publications (RWTH Aachen) dissertation Computer Science Polynomial and algebraic computation Open access

Gereon Kremer

5

citations
Integrating quantum and classical computing for multi-energy system optimization using Benders decomposition
2024 Computers & Chemical Engineering article Computer Science Quantum Computing Algorithms and Architecture Open access

Ludger Leenders, Martin Sollich, Christiane Reinert, André Bardow

9

citations
Micro-macro decomposition of particle swarm optimization methods
2025 Kinetic and Related Models article Computer Science Metaheuristic Optimization Algorithms Research Open access

Michaël Herty, Sara Veneruso

0

citations
General Policies, Subgoal Structure, and Planning Width
2024 Journal of Artificial Intelligence Research article Computer Science AI-based Problem Solving and Planning Open access

Blai Bonet, Héctor Geffner

1

citations
General Policies, Subgoal Structure, and Planning Width
2023 arXiv (Cornell University) preprint Computer Science AI-based Problem Solving and Planning Open access

Blai Bonet, Héctor Geffner

0

citations
Combined Task and Motion Planning Via Sketch Decompositions (Extended Version with Supplementary Material)
2024 arXiv (Cornell University) preprint Computer Science AI-based Problem Solving and Planning Open access

Magí Dalmau, Néstor García, Vicenç Gómez, Héctor Geffner

0

citations
Expressing and Exploiting Subgoal Structure in Classical Planning Using Sketches
2024 Journal of Artificial Intelligence Research article Computer Science AI-based Problem Solving and Planning Open access

Dominik Drexler, Jendrik Seipp, Héctor Geffner

0

citations
On Policy Reuse: An Expressive Language for Representing and Executing General Policies that Call Other Policies
2024 arXiv (Cornell University) preprint Computer Science AI-based Problem Solving and Planning Open access

Blai Bonet, Dominik Drexler, Héctor Geffner

0

citations
On Policy Reuse: An Expressive Language for Representing and Executing General Policies that Call Other Policies
2024 Proceedings of the International Conference on Automated Planning and Scheduling conference-paper Computer Science AI-based Problem Solving and Planning Open access

Blai Bonet, Dominik Drexler, Héctor Geffner

0

citations
Learning Hierarchical Policies by Iteratively Reducing the Width of Sketch Rules
2023 conference-paper Computer Science AI-based Problem Solving and Planning Open access

Dominik Drexler, Jendrik Seipp, Héctor Geffner

6

citations
Exact stochastic constraint optimisation with applications in network analysis
2021 Artificial Intelligence article Computer Science Constraint Satisfaction and Optimization Open access

Anna L. D. Latour, Behrouz Babaki, Daniël Fokkinga, Marie Anastacio, Holger H. Hoos, Siegfried Nijssen

5

citations
Dominance-based variable analysis for large-scale multi-objective problems
2022 Natural Computing article Computer Science Advanced Multi-Objective Optimization Algorithms Open access

Dani Irawan, Boris Naujoks, Thomas Bäck, Michael Emmerich

5

citations
The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs
2022 SIAM Journal on Discrete Mathematics article Computer Science Advanced Graph Theory Research Open access

Sandra Kiefer, Daniel Neuen

11

citations
Normal-Tangential Flow Response to Edge Truncation in Capacitated Networks
2023 RWTH Publications (RWTH Aachen) conference-paper Computer Science Topological and Geometric Data Analysis Open access

Josef Hoppe, Michael T. Schaub

1

citations
A risk-sensitive task offloading strategy for edge computing in industrial Internet of Things
2021 EURASIP Journal on Wireless Communications and Networking article Computer Science IoT and Edge/Fog Computing Open access cited by 2 patents

Xiaoyu Hao, Ruohai Zhao, Tao Yang, Yulin Hu, Bo Hu, Yuhe Qiu

9

citations
Graph Isomorphism in Quasipolynomial Time Parameterized by Treewidth
2020 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Daniel Wiebking

8

citations
Self-supervised Few-shot Learning for Semantic Segmentation: An Annotation-free Approach
2023 arXiv (Cornell University) preprint Computer Science Domain Adaptation and Few-Shot Learning Open access

Sanaz Karimijafarbigloo, Reza Azad, Dorit Merhof

1

citations
On the Implementation of Cylindrical Algebraic Coverings for Satisfiability Modulo Theories Solving
2021 International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) conference-paper Computer Science Formal Methods in Verification Open access

Gereon Kremer, Erika Ábrahám, Matthew England, James H. Davenport

3

citations