Search research articles
Contact Us
Filters
Showing results (41-50 of 80) with videos related to
Page
of 8
Sort By:
Algorithmica
|
February 15, 2021
Building a Nest by an Automaton
Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc
Algorithmica
|
September 10, 2019
New Tools and Connections for Exponential-Time Approximation
Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, et al.
Algorithmica
|
January 23, 2023
Social Distancing Network Creation
Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, et al.
Algorithmica
|
February 20, 2014
Spin-the-bottle Sort and Annealing Sort: Oblivious Sorting via Round-robin Random Comparisons
Michael T Goodrich
Algorithmica
|
April 23, 2019
The A Priori Traveling Repairman Problem
Martijn van Ee, René Sitters
Algorithmica
|
November 1, 2021
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs
Jana Novotná, Karolina Okrasa, Michał Pilipczuk, et al.
Algorithmica
|
February 7, 2022
Bounding the Inefficiency of Compromise in Opinion Formation
Ioannis Caragiannis, Panagiotis Kanellopoulos, Alexandros A Voudouris
Algorithmica
|
May 7, 2019
Dynamic Graph Stream Algorithms in <i>o</i>(<i>n</i>) Space
Zengfeng Huang, Pan Peng
Algorithmica
|
April 19, 2019
The Impact of a Sparse Migration Topology on the Runtime of Island Models in Dynamic Optimization
Andrei Lissovoi, Carsten Witt
Algorithmica
|
April 3, 2023
Faster Cut Sparsification of Weighted Graphs
Sebastian Forster, Tijn de Vos
Page
of 8
Search research articles
Search
Showing results (41-50 of 80) with videos related to
Sort By:
Page
of 8
Algorithmica
|
February 15, 2021
Building a Nest by an Automaton
Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc
Algorithmica
|
September 10, 2019
New Tools and Connections for Exponential-Time Approximation
Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, et al.
Algorithmica
|
January 23, 2023
Social Distancing Network Creation
Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, et al.
Algorithmica
|
February 20, 2014
Spin-the-bottle Sort and Annealing Sort: Oblivious Sorting via Round-robin Random Comparisons
Michael T Goodrich
Algorithmica
|
April 23, 2019
The A Priori Traveling Repairman Problem
Martijn van Ee, René Sitters
Algorithmica
|
November 1, 2021
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs
Jana Novotná, Karolina Okrasa, Michał Pilipczuk, et al.
Algorithmica
|
February 7, 2022
Bounding the Inefficiency of Compromise in Opinion Formation
Ioannis Caragiannis, Panagiotis Kanellopoulos, Alexandros A Voudouris
Algorithmica
|
May 7, 2019
Dynamic Graph Stream Algorithms in <i>o</i>(<i>n</i>) Space
Zengfeng Huang, Pan Peng
Algorithmica
|
April 19, 2019
The Impact of a Sparse Migration Topology on the Runtime of Island Models in Dynamic Optimization
Andrei Lissovoi, Carsten Witt
Algorithmica
|
April 3, 2023
Faster Cut Sparsification of Weighted Graphs
Sebastian Forster, Tijn de Vos
Page
of 8