From

Institution

Field

Type

Topic: Complexity and Algorithms in Graphs ×

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

Reset

Papers matching “combinatorial optimization” in Complexity and Algorithms in Graphs 13

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints
2024 Discrete Applied Mathematics article Computer Science Complexity and Algorithms in Graphs

Christina Büsing, Sabrina Schmitz

5

citations
Revenue maximization in Stackelberg Pricing Games: beyond the combinatorial setting
2020 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access

Toni Böhnlein, Stefan Kratsch, Oliver Schaudt

11

citations
Recoverable robust optimization with commitment
2026 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access

Komal Muluk, Britta Peis

3

citations
Hessian chain bracketing
2023 Journal of Combinatorics article Computer Science Complexity and Algorithms in Graphs

Uwe Naumann, Shubhaditya Burela

1

citations
Matroid bases with cardinality constraints on the intersection
2021 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access

Stefan Lendl, Britta Peis, Veerle Timmermans

9

citations
A linear time algorithm for the robust recoverable selection problem
2020 Discrete Applied Mathematics article Computer Science Complexity and Algorithms in Graphs Open access

Thomas Lachmann, Stefan Lendl, Gerhard J. Woeginger

9

citations
Recognising permuted Demidenko matrices
2023 Operations Research Letters article Computer Science Complexity and Algorithms in Graphs Open access

Eranda Çela, Vladimir G. Deı̌neko, Gerhard J. Woeginger

4

citations
The bipartite travelling salesman problem: A pyramidally solvable case
2024 Operations Research Letters article Computer Science Complexity and Algorithms in Graphs Open access

Vladimir G. Deı̌neko, Bettina Klinz, Gerhard J. Woeginger

2

citations
The complexity of blocking all solutions
2026 Theoretical Computer Science article Computer Science Complexity and Algorithms in Graphs Open access

Christoph Grüne, Lasse Wulf

0

citations
Complexity of the Directed Robust b‐Matching Problem and Its Variants on Different Graph Classes
2025 Networks article Computer Science Complexity and Algorithms in Graphs Open access

Jenny Segschneider, Arie M. C. A. Koster

0

citations
An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
2020 Journal of Combinatorial Optimization article Computer Science Complexity and Algorithms in Graphs

Boxiao Liu, Shaowei Cai, Chuan Wen Luo, Haihang You

7

citations
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements
2025 Journal of the ACM article Computer Science Complexity and Algorithms in Graphs Open access

Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer

0

citations
Travelling salesman paths on Demidenko matrices
2021 Discrete Applied Mathematics article Computer Science Complexity and Algorithms in Graphs Open access

Eranda Çela, Vladimir G. Deı̌neko, Gerhard J. Woeginger

1

citations

13 results