A Aralex Aachen research explorer

Search

From

To

Institution

Field

Type

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

Papers matching “compact formulation” 4

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
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
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
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

4 results