Search research articles
Contact Us
Filters
Showing results (31-40 of 80) with videos related to
Page
of 8
Sort By:
Algorithmica
|
January 14, 2014
Parameterized Complexity of Eulerian Deletion Problems
Marek Cygan, Dániel Marx, Marcin Pilipczuk, et al.
Algorithmica
|
July 26, 2022
Vertex Deletion into Bipartite Permutation Graphs
Łukasz Bożyk, Jan Derbisz, Tomasz Krawczyk, et al.
Algorithmica
|
August 21, 2025
Pareto Sums of Pareto Sets: Lower Bounds and Algorithms
Daniel Funke, Demian Hespe, Peter Sanders, et al.
Algorithmica
|
March 8, 2023
Non-Preemptive Tree Packing
Stefan Lendl, Gerhard Woeginger, Lasse Wulf
Algorithmica
|
April 23, 2024
Connectivity with Uncertainty Regions Given as Line Segments
Sergio Cabello, David Gajser
Algorithmica
|
March 27, 2026
The SLO Hierarchy of Pseudo-Boolean Functions and Runtime of Evolutionary Algorithms
Duc-Cuong Dang, Per Kristian Lehre
Algorithmica
|
March 28, 2020
Stable Matchings with Covering Constraints: A Complete Computational Trichotomy
Matthias Mnich, Ildikó Schlotter
Algorithmica
|
January 31, 2020
Solving Problems on Graphs of High Rank-Width
Eduard Eiben, Robert Ganian, Stefan Szeider
Algorithmica
|
June 2, 2022
On 3-Coloring of ( <math></math> )-Free Graphs
Vít Jelínek, Tereza Klimošová, Tomáš Masařík, et al.
Algorithmica
|
July 26, 2022
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan
Jesper Nederlof, Céline M F Swennenhuis
Page
of 8
Search research articles
Search
Showing results (31-40 of 80) with videos related to
Sort By:
Page
of 8
Algorithmica
|
January 14, 2014
Parameterized Complexity of Eulerian Deletion Problems
Marek Cygan, Dániel Marx, Marcin Pilipczuk, et al.
Algorithmica
|
July 26, 2022
Vertex Deletion into Bipartite Permutation Graphs
Łukasz Bożyk, Jan Derbisz, Tomasz Krawczyk, et al.
Algorithmica
|
August 21, 2025
Pareto Sums of Pareto Sets: Lower Bounds and Algorithms
Daniel Funke, Demian Hespe, Peter Sanders, et al.
Algorithmica
|
March 8, 2023
Non-Preemptive Tree Packing
Stefan Lendl, Gerhard Woeginger, Lasse Wulf
Algorithmica
|
April 23, 2024
Connectivity with Uncertainty Regions Given as Line Segments
Sergio Cabello, David Gajser
Algorithmica
|
March 27, 2026
The SLO Hierarchy of Pseudo-Boolean Functions and Runtime of Evolutionary Algorithms
Duc-Cuong Dang, Per Kristian Lehre
Algorithmica
|
March 28, 2020
Stable Matchings with Covering Constraints: A Complete Computational Trichotomy
Matthias Mnich, Ildikó Schlotter
Algorithmica
|
January 31, 2020
Solving Problems on Graphs of High Rank-Width
Eduard Eiben, Robert Ganian, Stefan Szeider
Algorithmica
|
June 2, 2022
On 3-Coloring of ( <math></math> )-Free Graphs
Vít Jelínek, Tereza Klimošová, Tomáš Masařík, et al.
Algorithmica
|
July 26, 2022
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan
Jesper Nederlof, Céline M F Swennenhuis
Page
of 8