Literature for Just Beyond P


Link to the Homepage: Just Beyond P


no image available Adamaszek, Anna; Har-Peled, Sariel and Wiese, Andreas
Approximation schemes for independent set and sparse subsets of polygons
ACM 2019
no image available Calude, Cristian S. et al.
Deciding parity games in quasi-polynomial time
SIAM 2022
no image available Dorfman, Dani; Kaplan, Haim and Zwick, Uri
A faster deterministic exponential time algorithm for energy games and mean payoff games
Dagstuhl 2019
no image available Grohe, Martin; Neuen, Daniel and Schweitzer, Pascal
A faster isomorphism test for graphs of small degree
SIAM 2023
no image available Jurdziński, Marcin; Morvan, Rémi and Thejaswini, K. S.
Universal algorithms for parity games and nested fixpoints
arXiv 2022
no image available Kisfaludi-Bak, Sándor
A quasi-polynomial algorithm for well-spaced hyperbolic TSP
JoCG 2021
no image available Matougek, J.; Sharir, M. and Welzl E.
A subexponential bound for linear programming
Springer 1996
no image available Nederlof, Jesper; Swennenhuis, Céline M. F. and Węgrzycki, Karol
A subexponential time algorithm for makespan scheduling of unit jobs with precedence constraints
SIAM 2025
no image available Parys, Paweł
Parity games:
Another view on Lehtinen's algorithm
arXiv 2019
no image available Szabó, Tibor and Welzl, Emo
Unique sink orientations of cubes
IEEEXplore 2001