From

Institution

Field

Type

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

Reset

Papers matching “compact formulation” 9

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy
2024 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Christoph Grüne, Lasse Wulf

0

citations
TinyAD: Automatic Differentiation in Geometry Processing Made Simple
2022 Computer Graphics Forum article Computer Science Computer Graphics and Visualization Techniques Open access

Patrick Schmidt, Janis Born, David Bommes, Marcel Campen, Leif P. Kobbelt

21

citations
Optimal Refinement in Dynamic Discretisation Discovery for Continuous-Time Service Network Design
2026 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Alexander Helber, Oliver Bachtler, Tom Wüllner

0

citations
A controllable domain-warped multifractal implicit-radius algorithm for generation of simulation-ready virtual aggregates
2026 Advances in Engineering Software article Computer Science Computer Graphics and Visualization Techniques Open access

Dong Feng

6

citations
An Analysis of the Decidability and Complexity of Numeric Additive Planning
2024 Proceedings of the International Conference on Automated Planning and Scheduling conference-paper Computer Science AI-based Problem Solving and Planning Open access

Hayyan Helal, Gerhard Lakemeyer

1

citations
Discovering outstanding subgroup lists for numeric targets using MDL
2020 preprint Computer Science Data Mining Algorithms and Applications Open access

Hugo Manuel Proença, Peter Grünwald, Thomas Bäck, Matthijs van Leeuwen

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
Space-time adaptive methods for poroviscoelastic flow models
2025 RWTH Publications (RWTH Aachen) dissertation Computer Science Advanced Mathematical Modeling in Engineering Open access

Simon Boisserée

0

citations
TELLER: Dual-Path Iterative Preference Optimization for Table Entity Linking
2026 arXiv (Cornell University) preprint Computer Science Topic Modeling Open access

Yixin Peng, Kuan Li, Stefan Decker

0

citations

9 results