scholarly journals Parameterized Complexity of Configuration Integer Programs

Author(s):  
Dušan Knop ◽  
Martin Koutecký ◽  
Asaf Levin ◽  
Matthias Mnich ◽  
Shmuel Onn
2021 ◽  
Vol 867 ◽  
pp. 1-12
Author(s):  
Lawqueen Kanesh ◽  
Soumen Maity ◽  
Komal Muluk ◽  
Saket Saurabh

1994 ◽  
Vol 25 (3) ◽  
pp. 122-123 ◽  
Author(s):  
Michael T. Hallett ◽  
H. Todd Wareham

2020 ◽  
Vol 847 ◽  
pp. 27-38
Author(s):  
Christian Komusiewicz ◽  
Mateus de Oliveira Oliveira ◽  
Meirav Zehavi

2021 ◽  
Vol 51 (4) ◽  
pp. 4-5
Author(s):  
Frederic Green

The three books reviewed in this column are about central ideas in algorithms, complexity, and geometry. The third one brings together topics from the first two by applying techniques of both property testing (the subject of the first book) and parameterized complexity (including its more focused incarnation studied in the second book, kernelization) to geometric problems.


Sign in / Sign up

Export Citation Format

Share Document