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 “lower bounds” in Complexity and Algorithms in Graphs 18

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

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
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
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
Lower Bounds for Weisfeiler-Leman
2026 Zenodo (CERN European Organization for Nuclear Research) preprint Computer Science Complexity and Algorithms in Graphs Open access

Radu Curticapean, Mingjun Liu, Daniel Neuen, Tim Seppelt

0

citations
Sharp bounds for non-adaptive randomized approximation of high-dimensional noisy vectors
2026 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Robert J. Kunsch, Marcin Wnuk

0

citations
Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus
2022 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Benedikt Pago

0

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
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
Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism
2024 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Christoph Berkholz, Moritz Lichter, Harry Vinall-Smeeth

3

citations
Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Complexity and Algorithms in Graphs Open access

0

citations
Efficiently Approximating Attention Is Hard
2026 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Lukas Haverbeck, Carmen Amo Alonso, Andrés Felipe Posada-Moreno, Sebastian Trimpe, Marco Pavone

0

citations
Approximating $$\delta $$-Covering
2025 Lecture notes in computer science conference-paper Computer Science Complexity and Algorithms in Graphs Open access

Tim A. Hartmann, Tom Janßen

0

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
The Solidarity Cover Problem
2023 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Eran Rosenbluth

0

citations
Symmetric Proofs in the Ideal Proof System
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Complexity and Algorithms in Graphs Open access

Benedikt Pago

0

citations
Symmetric Proofs in the Ideal Proof System
2025 RWTH Publications (RWTH Aachen) preprint Computer Science Complexity and Algorithms in Graphs Open access

Anuj Dawar, Erich Grädel, Leon Kullmann, Benedikt Pago

0

citations
Approximability of Electrical Distribution Network Reconfiguration for General Graphs
2026 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Christian Wallisch, Andrea Benigni, Carsten Hartmann, Leon Kellerhals

0

citations
Single-source unsplittable flows in planar and bounded-genus graphs
2026 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access

Vera Traub, Laura Vargas Koch, Rico Zenklusen

0

citations

18 results