OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!
If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.
Requested Article:
The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs
Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota
Lecture notes in computer science (2021), pp. 297-310
Open Access | Times Cited: 8
Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota
Lecture notes in computer science (2021), pp. 297-310
Open Access | Times Cited: 8
Showing 8 citing articles:
FPT algorithms for a special block-structured integer program with applications in scheduling
Hua Chen, Lin Chen, Guochuan Zhang
Mathematical Programming (2024) Vol. 208, Iss. 1-2, pp. 463-496
Closed Access | Times Cited: 1
Hua Chen, Lin Chen, Guochuan Zhang
Mathematical Programming (2024) Vol. 208, Iss. 1-2, pp. 463-496
Closed Access | Times Cited: 1
Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity
Jana Cslovjecsek, Friedrich Eisenbrand, Michał Pilipczuk, et al.
arXiv (Cornell University) (2020)
Open Access | Times Cited: 4
Jana Cslovjecsek, Friedrich Eisenbrand, Michał Pilipczuk, et al.
arXiv (Cornell University) (2020)
Open Access | Times Cited: 4
Collapsing the Tower - On the Complexity of Multistage Stochastic IPs
Kim-Manuel Klein, Janina Reuter
Society for Industrial and Applied Mathematics eBooks (2022), pp. 348-358
Open Access | Times Cited: 3
Kim-Manuel Klein, Janina Reuter
Society for Industrial and Applied Mathematics eBooks (2022), pp. 348-358
Open Access | Times Cited: 3
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
Marcin Briański, Martin Koutecký, Daniel Kráľ, et al.
Mathematical Programming (2024) Vol. 208, Iss. 1-2, pp. 497-531
Open Access
Marcin Briański, Martin Koutecký, Daniel Kráľ, et al.
Mathematical Programming (2024) Vol. 208, Iss. 1-2, pp. 497-531
Open Access
Tight Lower Bounds for Block-Structured Integer Programs
Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, et al.
Lecture notes in computer science (2024), pp. 224-237
Closed Access
Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, et al.
Lecture notes in computer science (2024), pp. 224-237
Closed Access
Collapsing the Tower - On the Complexity of Multistage Stochastic IPs
Kim-Manuel Klein, Janina Reuter
ACM Transactions on Algorithms (2023) Vol. 20, Iss. 3, pp. 1-21
Open Access | Times Cited: 1
Kim-Manuel Klein, Janina Reuter
ACM Transactions on Algorithms (2023) Vol. 20, Iss. 3, pp. 1-21
Open Access | Times Cited: 1
FPT Algorithms for a Special Block-structured Integer Program with Applications in Scheduling
Lin Chen, Hua Chen, Guochuan Zhang
arXiv (Cornell University) (2021)
Open Access
Lin Chen, Hua Chen, Guochuan Zhang
arXiv (Cornell University) (2021)
Open Access
Sometimes, Convex Separable Optimization Is Much Harder than Linear Optimization, and Other Surprises.
Cornelius Brand, Martin Koutecký, Alexandra Lassota, et al.
arXiv (Cornell University) (2021)
Closed Access
Cornelius Brand, Martin Koutecký, Alexandra Lassota, et al.
arXiv (Cornell University) (2021)
Closed Access
