Topics › Physical Sciences › Computer Science › Computational Theory and Mathematics

Complexity and Algorithms in Graphs Sign in to save

378

Further papers (secondary topic)

241

Citations

Aachen authors

Patent citations

Papers per year

Papers 105

Open in paper search →

Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP
2023 Warwick Research Archive Portal (University of Warwick) article Computer Science Complexity and Algorithms in Graphs Open access

Matthias Englert, Heiko Röglin, Berthold Vöcking

33

citations
The trouble with the second quantifier
2021 4OR article Computer Science Complexity and Algorithms in Graphs Open access

Gerhard J. Woeginger

27

citations
Fine-grained Complexity Analysis of Two Classic TSP Variants
2020 ACM Transactions on Algorithms article Computer Science Complexity and Algorithms in Graphs Open access

Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger

17

citations
A Faster Isomorphism Test for Graphs of Small Degree
2020 SIAM Journal on Computing article Computer Science Complexity and Algorithms in Graphs Open access

Martin Grohe, Daniel Neuen, Pascal Schweitzer

11

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
Robust minimum cost flow problem under consistent flow constraints
2021 Annals of Operations Research article Computer Science Complexity and Algorithms in Graphs Open access

Christina Büsing, Arie M. C. A. Koster, Sabrina Schmitz

10

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
The Descriptive Complexity of Graph Neural Networks
2023 Proceedings - Symposium on Logic in Computer Science conference-paper Computer Science Complexity and Algorithms in Graphs

Martin Grohe

7

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
Negative prices in network pricing games
2022 Operations Research Letters article Computer Science Complexity and Algorithms in Graphs Open access

Andrés Cristi, Marc Schröder

6

citations
Continuous facility location on graphs
2021 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access

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

6

citations
An Investigation of the Recoverable Robust Assignment Problem
2020 RWTH Publications (RWTH Aachen) conference-paper Computer Science Complexity and Algorithms in Graphs Open access

Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger

6

citations
A Finite-Model-Theoretic View on Propositional Proof Complexity
2022 Logical Methods in Computer Science article Computer Science Complexity and Algorithms in Graphs Open access

Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa

5

citations
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
A greedy algorithm for the social golfer and the Oberwolfach problem
2021 European Journal of Operational Research article Computer Science Complexity and Algorithms in Graphs Open access

Daniel Schmand, Marc Schröder, Laura Vargas Koch

4

citations
A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems
2023 Lecture notes in computer science conference-paper Computer Science Complexity and Algorithms in Graphs

Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf

4

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
Completeness in the Polynomial Hierarchy for Many Natural Problems in Bilevel and Robust Optimization
2025 Lecture notes in computer science conference-paper Computer Science Complexity and Algorithms in Graphs

Christoph Grüne, Lasse Wulf

4

citations
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements
2023 Annual Symposium on Foundations of Computer Science conference-paper Computer Science Complexity and Algorithms in Graphs

Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer

4

citations

Most active Aachen authors

Gerhard J. Woeginger 13,265 citations overall
17 papers
Christina Büsing 641 citations overall
10 papers
Christoph Grüne 14 citations overall
9 papers
Martin Grohe 12,906 citations overall
8 papers
Arie M. C. A. Koster 3,667 citations overall
8 papers
Britta Peis 492 citations overall
6 papers
Sabrina Schmitz 17 citations overall
6 papers
Mariia Anapolska 6 citations overall
5 papers
Corinna Mathwieser 2 citations overall
5 papers
Uwe Naumann 20,677 citations overall
4 papers
Oliver Schaudt 671 citations overall
4 papers
Moritz Lichter 111 citations overall
4 papers
Laura Vargas Koch 96 citations overall
4 papers
Tim A. Hartmann 53 citations overall
4 papers
Jenny Segschneider 7 citations overall
4 papers

Complexity and Algorithms in Graphs ▲ Sign in to save

Papers per year

Papers 105

Most active Aachen authors

Complexity and Algorithms in Graphs Sign in to save