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:
Integer programming in parameterized complexity: Five miniatures
Tomáš Gavenčiak, Martin Koutecký, Dušan Knop
Discrete Optimization (2020) Vol. 44, pp. 100596-100596
Open Access | Times Cited: 20
Tomáš Gavenčiak, Martin Koutecký, Dušan Knop
Discrete Optimization (2020) Vol. 44, pp. 100596-100596
Open Access | Times Cited: 20
Showing 20 citing articles:
Multi-Winner Voting with Approval Preferences
Martin Lackner, Piotr Skowron
SpringerBriefs in intelligent systems (2022)
Open Access | Times Cited: 62
Martin Lackner, Piotr Skowron
SpringerBriefs in intelligent systems (2022)
Open Access | Times Cited: 62
Parameterized complexity for iterated type partitions and modular-width
Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno
Discrete Applied Mathematics (2024) Vol. 350, pp. 100-122
Closed Access | Times Cited: 3
Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno
Discrete Applied Mathematics (2024) Vol. 350, pp. 100-122
Closed Access | Times Cited: 3
On $$\Delta $$-modular integer linear problems in the canonical form and equivalent problems
D. V. Gribanov, Ivan Shumilov, D. S. Malyshev, et al.
Journal of Global Optimization (2022) Vol. 88, Iss. 3, pp. 591-651
Closed Access | Times Cited: 14
D. V. Gribanov, Ivan Shumilov, D. S. Malyshev, et al.
Journal of Global Optimization (2022) Vol. 88, Iss. 3, pp. 591-651
Closed Access | Times Cited: 14
Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems
D. V. Gribanov, Ivan Shumilov, D. Malyshev, et al.
Journal of Global Optimization (2024) Vol. 89, Iss. 4, pp. 1033-1067
Open Access | Times Cited: 1
D. V. Gribanov, Ivan Shumilov, D. Malyshev, et al.
Journal of Global Optimization (2024) Vol. 89, Iss. 4, pp. 1033-1067
Open Access | Times Cited: 1
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
Approval-Based Committee Voting
Martin Lackner, Piotr Skowron
SpringerBriefs in intelligent systems (2022), pp. 1-7
Open Access | Times Cited: 5
Martin Lackner, Piotr Skowron
SpringerBriefs in intelligent systems (2022), pp. 1-7
Open Access | Times Cited: 5
The complexity of election problems with group-separable preferences
Piotr Faliszewski, Alexander Karpov, Svetlana Obraztsova
Autonomous Agents and Multi-Agent Systems (2022) Vol. 36, Iss. 1
Closed Access | Times Cited: 5
Piotr Faliszewski, Alexander Karpov, Svetlana Obraztsova
Autonomous Agents and Multi-Agent Systems (2022) Vol. 36, Iss. 1
Closed Access | Times Cited: 5
Composite analysis of web pages in adaptive environment through Modified Salp Swarm algorithm to rank the web pages
E. Manohar, E. Anandha Banu, D. Shalini Punithavathani
Journal of Ambient Intelligence and Humanized Computing (2021) Vol. 13, Iss. 5, pp. 2585-2600
Closed Access | Times Cited: 5
E. Manohar, E. Anandha Banu, D. Shalini Punithavathani
Journal of Ambient Intelligence and Humanized Computing (2021) Vol. 13, Iss. 5, pp. 2585-2600
Closed Access | Times Cited: 5
Strategic Campaign Management in Apportionment Elections
Robert Bredereck, Piotr Faliszewski, Michal Furdyna, et al.
(2020), pp. 103-109
Open Access | Times Cited: 4
Robert Bredereck, Piotr Faliszewski, Michal Furdyna, et al.
(2020), pp. 103-109
Open Access | Times Cited: 4
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
High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming
Robert Bredereck, Andrzej Kaczmarczyk, Dušan Knop, et al.
Frontiers in artificial intelligence and applications (2023)
Open Access | Times Cited: 1
Robert Bredereck, Andrzej Kaczmarczyk, Dušan Knop, et al.
Frontiers in artificial intelligence and applications (2023)
Open Access | Times Cited: 1
Maximizing Social Welfare in Score-Based Social Distance Games
Robert Ganian, Thekla Hamm, Dušan Knop, et al.
Electronic Proceedings in Theoretical Computer Science (2023) Vol. 379, pp. 272-286
Open Access | Times Cited: 1
Robert Ganian, Thekla Hamm, Dušan Knop, et al.
Electronic Proceedings in Theoretical Computer Science (2023) Vol. 379, pp. 272-286
Open Access | Times Cited: 1
Vertex Separation in Networks
Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno
(2021), pp. 1-8
Closed Access | Times Cited: 1
Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno
(2021), pp. 1-8
Closed Access | Times Cited: 1
Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU
René van Bevern, Artem M. Kirilin, Daniel A. Skachkov, et al.
Journal of Computer and System Sciences (2023) Vol. 139, pp. 103479-103479
Open Access
René van Bevern, Artem M. Kirilin, Daniel A. Skachkov, et al.
Journal of Computer and System Sciences (2023) Vol. 139, pp. 103479-103479
Open Access
Spanning Trees with Few Branch Vertices in Graphs of Bounded Neighborhood Diversity
Luisa Gargano, Adele A. Rescigno
Lecture notes in computer science (2023), pp. 502-519
Closed Access
Luisa Gargano, Adele A. Rescigno
Lecture notes in computer science (2023), pp. 502-519
Closed Access
The Complexity of Election Problems with Group-Separable Preferences
Piotr Faliszewski, Alexander Karpov, Svetlana Obraztsova
(2020), pp. 203-209
Open Access
Piotr Faliszewski, Alexander Karpov, Svetlana Obraztsova
(2020), pp. 203-209
Open Access
The double exponential runtime is tight for 2-stage stochastic ILPs
Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota
Mathematical Programming (2022) Vol. 197, Iss. 2, pp. 1145-1172
Open Access
Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota
Mathematical Programming (2022) Vol. 197, Iss. 2, pp. 1145-1172
Open Access
Algorithms and Computational Complexity
Martin Lackner, Piotr Skowron
SpringerBriefs in intelligent systems (2022), pp. 79-93
Open Access
Martin Lackner, Piotr Skowron
SpringerBriefs in intelligent systems (2022), pp. 79-93
Open Access
Faster algorithm for counting of the integer points number in Δ-modular polyhedra.
D. V. Gribanov, D. S. Malyshev
arXiv (Cornell University) (2021)
Closed Access
D. V. Gribanov, D. S. Malyshev
arXiv (Cornell University) (2021)
Closed Access
Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU
René van Bevern, Artem M. Kirilin, Daniel A. Skachkov, et al.
arXiv (Cornell University) (2021)
Open Access
René van Bevern, Artem M. Kirilin, Daniel A. Skachkov, et al.
arXiv (Cornell University) (2021)
Open Access
