From

Institution

Field

Type

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

Reset

Papers matching “clique problem” 26

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Improving the Performance of Stochastic Local Search for Maximum Vertex Weight Clique Problem Using Programming by Optimization
2020 arXiv (Cornell University) preprint Computer Science Constraint Satisfaction and Optimization Open access

Chu Yi, Chuan Wen Luo, Holger H. Hoos, Qingwei Lin, Haihang You

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
Improving the performance of stochastic local search for maximum vertex weight clique problem using programming by optimization
2022 Expert Systems with Applications article Computer Science Metaheuristic Optimization Algorithms Research Open access

Chuan Wen Luo, Holger H. Hoos, Haihang You

2

citations
Fuzzy Clique Set Determination Method as an Example of Fuzzy Temporal Graph Invariant
2021 Advances in intelligent systems and computing conference-paper Decision Sciences Fuzzy and Soft Set Theory

Alexander Vitalievich Bozhenyuk, Vitalii Bozheniuk, Janusz Kacprzyk, Margarita Knyazeva

0

citations
Fast maximal clique enumeration in weighted temporal networks
2026 Social Network Analysis and Mining article Computer Science Graph Theory and Algorithms Open access

Hanjo D. Boekhout, Frank W. Takes

0

citations
Fast maximal clique enumeration in weighted temporal networks
2024 arXiv (Cornell University) preprint Computer Science Graph Theory and Algorithms Open access

Hanjo D. Boekhout, Frank W. Takes

0

citations
Fitness-based Linkage Learning and Maximum-Clique Conditional Linkage Modelling for Gray-box Optimization with RV-GOMEA
2024 arXiv (Cornell University) preprint Computer Science Metaheuristic Optimization Algorithms Research Open access

Georgios Andreadis, Tanja Alderliesten, Peter A. N. Bosman

1

citations
Fitness-based Linkage Learning and Maximum-Clique Conditional Linkage Modelling for Gray-box Optimization with RV-GOMEA
2024 Genetic and Evolutionary Computation Conference (GECCO) conference-paper Computer Science Metaheuristic Optimization Algorithms Research Open access

Georgios Andreadis, Tanja Alderliesten, Peter A. N. Bosman

0

citations
Hard Problems on Random Graphs
2020 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Jan Dreier, Henri Lotze, Peter Rossmanith

0

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

1

citations
Isomorphism for Tournaments of Small Twin Width
2026 TheoretiCS article Computer Science Advanced Graph Theory Research Open access

Martin Grohe, Daniel Neuen

0

citations
The Parameterized Complexity of Learning Monadic Second-Order Logic
2023 HAL (Le Centre pour la Communication Scientifique Directe) conference-paper Computer Science Advanced Graph Theory Research Open access

Steffen van Bergerem, Martin Grohe, Nina Runde

0

citations
Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond
2023 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Jan Dreier, Daniel Mock, Peter Rossmanith

0

citations
The Parameterized Complexity of Learning Monadic Second-Order Logic
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Steffen van Bergerem

0

citations
The Complexity of Stackelberg Pricing Games
2025 IT University Of Copenhagen (IT University of Copenhagen) preprint Computer Science Complexity and Algorithms in Graphs Open access

Christoph Grüne, Dorothee Henke, Eva Rotenberg, Lasse Wulf

0

citations
Completeness in the Polynomial Hierarchy for many natural Problems in Bilevel and Robust Optimization
2023 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Christoph Grüne, Lasse Wulf

0

citations
Benchmark Instances for Robust Combinatorial Optimization with Budgeted Uncertainty
2022 Zenodo (CERN European Organization for Nuclear Research) dataset Decision Sciences Risk and Portfolio Optimization Open access

Timo Gersing, Christina Büsing, Arie M. C. A. Koster

3

citations
Benchmark Instances for Robust Combinatorial Optimization with Budgeted Uncertainty
2022 Zenodo (CERN European Organization for Nuclear Research) dataset Decision Sciences Risk and Portfolio Optimization Open access

Timo Gersing, Christina Büsing, Arie M. C. A. Koster

0

citations
Benchmark Instances for Robust Combinatorial Optimization with Budgeted Uncertainty
2022 Zenodo (CERN European Organization for Nuclear Research) dataset Decision Sciences Risk and Portfolio Optimization Open access

Timo Gersing, Christina Büsing, Arie M. C. A. Koster

0

citations
Benchmark Instances for Robust Combinatorial Optimization with Budgeted Uncertainty
2022 Zenodo (CERN European Organization for Nuclear Research) dataset Decision Sciences Risk and Portfolio Optimization Open access

Timo Gersing, Christina Büsing, Arie M. C. A. Koster

0

citations
Benchmark Instances for Robust Combinatorial Optimization with Budgeted Uncertainty
2022 Zenodo (CERN European Organization for Nuclear Research) dataset Decision Sciences Risk and Portfolio Optimization Open access

Timo Gersing, Christina Büsing, Arie M. C. A. Koster

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
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
Detecting weighted hidden cliques
2025 arXiv (Cornell University) preprint Physics and Astronomy Complex Network Analysis Techniques Open access

Karissa Huang, Gábor Lugosi, Nandan Malhotra, Maruf Alam Tarafdar

0

citations
Online summarization of dynamic graphs using subjective interestingness for sequential data
2020 Data Mining and Knowledge Discovery article Computer Science Data Mining Algorithms and Applications Open access

Dhish Kumar Saxena, Matthijs van Leeuwen

11

citations