2025
C. S. Bhargav, Shiteng Chen, Radu Curticapean, Prateek Dwivedi:
Monotone Bounded-Depth Complexity of Homomorphism Polynomials.
MFCS 2025.19 (externer Link, ?ffnet neues Fenster) CoRR abs/2505.22894 (externer Link, ?ffnet neues Fenster)
Markus Bl?ser, Radu Curticapean, Julian D?rfler, Christian Ikenmeyer:
Which Graph Motif Parameters Count?
MFCS 2025.23 (externer Link, ?ffnet neues Fenster) CoRR abs/2507.12244 (externer Link, ?ffnet neues Fenster)
Andreas Bj?rklund, Radu Curticapean, Thore Husfeldt, Petteri Kaski, Kevin Pratt:
Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture.
SODA 2025 (externer Link, ?ffnet neues Fenster) CoRR abs/2404.04987 (externer Link, ?ffnet neues Fenster)
Radu Curticapean, Daniel Neuen:
Counting Small Induced Subgraphs: Hardness via Fourier Analysis.
SODA 2025 (externer Link, ?ffnet neues Fenster) CoRR abs/2407.07051 (externer Link, ?ffnet neues Fenster)
Radu Curticapean, Simon D?ring, Daniel Neuen, Jiaheng Wang:
Can You Link Up With Treewidth?
STACS 2025.28 (externer Link, ?ffnet neues Fenster) CoRR abs/2410.02606 (externer Link, ?ffnet neues Fenster)
Radu Curticapean, Simon D?ring, Daniel Neuen:
Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial.
CoRR abs/2505.22300 (externer Link, ?ffnet neues Fenster)
Cornelius Brand, Radu Curticapean, Baitian Li, Kevin Pratt:
Faster Convolutions: Yates and Strassen Revisited.
CoRR abs/2505.22410 (externer Link, ?ffnet neues Fenster)
Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney:
The complexity of optimizing atomic congestion.
Artif. Intell. 338 (externer Link, ?ffnet neues Fenster) AAAI 2024 (externer Link, ?ffnet neues Fenster)
Cornelius Brand, Robert Ganian, Fionn Mc Inerney, Simon Wietheger:
A Structural Complexity Analysis of Hierarchical Task Network Planning.
IJCAI 2025 (externer Link, ?ffnet neues Fenster)
Weiming Feng, Heng Guo, Chunyang Wang, Jiaheng Wang, Yitong Yin:
Toward Derandomizing Markov Chain Monte Carlo.
SIAM J. Comput. 54(3) (externer Link, ?ffnet neues Fenster)
Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Jiaheng Wang:
Approximate Counting for Spin Systems in Sub-Quadratic Time.
TheoretiCS 4 (externer Link, ?ffnet neues Fenster)
Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Mark Jerrum, Jiaheng Wang:
Rapid Mixing of the Flip Chain over Non-Crossing Spanning Trees.
SoCG 2025.8 (externer Link, ?ffnet neues Fenster)
Konrad Anand, Graham Freifeld, Heng Guo, Chunyang Wang, Jiaheng Wang:
Sink-free orientations: a local sampler with applications.
APPROX/RANDOM 2025.60 (externer Link, ?ffnet neues Fenster)CoRR abs/2502.05877 (externer Link, ?ffnet neues Fenster)
Prem Nigam Kar, David E. Roberson, Tim Seppelt, Peter Zeman:
NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability.
ICALP 2025.105 (externer Link, ?ffnet neues Fenster) CoRR abs/2407.10635 (externer Link, ?ffnet neues Fenster)
Anuj Dawar, Benedikt Pago, Tim Seppelt:
Symmetric Algebraic Circuits and Homomorphism Polynomials.
CoRR abs/2502.06740 (externer Link, ?ffnet neues Fenster)
Isolde Adler, Eva Fluck, Tim Seppelt, Gian Luca Spitzer:
Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth.
CoRR abs/2505.01193 (externer Link, ?ffnet neues Fenster)
2024
Radu Curticapean:
Count on CFI graphs for #P-hardness.
SODA 2024 (externer Link, ?ffnet neues Fenster) CoRR abs/2305.04767 (externer Link, ?ffnet neues Fenster)
Cornelius Brand, Robert Ganian, Sebastian R?der, Florian Schager:
Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs.
J. Graph Algorithms Appl. 28(2) (externer Link, ?ffnet neues Fenster)
Cornelius Brand, Viktoriia Korchemna, Kirill Simonov, Michael Skotnica:
Counting vanishing matrix-vector products.
Theor. Comput. Sci. 1021 (externer Link, ?ffnet neues Fenster); WALCOM 2024 (externer Link, ?ffnet neues Fenster)
Cornelius Brand, Martin Kouteck?, Alexandra Lassota, Sebastian Ordyniak:
Separable Convex Mixed-Integer Optimization: Improved Algorithms and Lower Bounds.
ESA 2024.32 (externer Link, ?ffnet neues Fenster)
Cornelius Brand, Robert Ganian, Fionn Mc Inerney, Simon Wietheger:
The Boundaries of Tractability in Hierarchical Task Network Planning.
CoRR abs/2401.14174 (externer Link, ?ffnet neues Fenster)
Martin Grohe, Daniel Neuen:
Isomorphism for Tournaments of Small Twin Width.
ICALP 2024.78 (externer Link, ?ffnet neues Fenster)
Sandra Kiefer, Daniel Neuen:
Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees.
LICS 2024.50 (externer Link, ?ffnet neues Fenster) CoRR abs/2402.03274 (externer Link, ?ffnet neues Fenster)
Zurück zum Forschungsüberblick