Search research articles
Contact Us
Filters
Showing results (11-20 of 18) with videos related to
Page
of 2
Sort By:
You have reached the last page of results.
This site can display upto 18 results.
Theory of Computing Systems
|
February 9, 2026
Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths
Matthias Bentert, Fedor V Fomin, Petr A Golovach
Theory of Computing Systems
|
August 10, 2019
Improved Distance Queries and Cycle Counting by Frobenius Normal Form
Piotr Sankowski, Karol Węgrzycki
Theory of Computing Systems
|
August 25, 2015
Sitting Closer to Friends than Enemies, Revisited
Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, et al.
Theory of Computing Systems
|
February 7, 2020
The Complexity of Optimal Design of Temporally Connected Graphs
Eleni C Akrida, Leszek Gąsieniec, George B Mertzios, et al.
Theory of Computing Systems
|
November 1, 2021
Space Lower Bounds for the Signal Detection Problem
Faith Ellen, Rati Gelashvili, Philipp Woelfel, et al.
Theory of Computing Systems
|
July 2, 2019
Limits of Schema Mappings
Phokion G Kolaitis, Reinhard Pichler, Emanuel Sallinger, et al.
Theory of Computing Systems
|
February 13, 2026
FullSynesth: Syntenic Reconciliation of a Set of Consistent Gene Trees
Mathieu Gascon, Mattéo Delabre, Nadia El-Mabrouk
Theory of Computing Systems
|
August 26, 2024
On Polynomial Recursive Sequences
Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, et al.
Page
of 2
Search research articles
Search
Showing results (11-20 of 18) with videos related to
Sort By:
Page
of 2
You have reached the last page of results.
This site can display upto 18 results.
Theory of Computing Systems
|
February 9, 2026
Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths
Matthias Bentert, Fedor V Fomin, Petr A Golovach
Theory of Computing Systems
|
August 10, 2019
Improved Distance Queries and Cycle Counting by Frobenius Normal Form
Piotr Sankowski, Karol Węgrzycki
Theory of Computing Systems
|
August 25, 2015
Sitting Closer to Friends than Enemies, Revisited
Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, et al.
Theory of Computing Systems
|
February 7, 2020
The Complexity of Optimal Design of Temporally Connected Graphs
Eleni C Akrida, Leszek Gąsieniec, George B Mertzios, et al.
Theory of Computing Systems
|
November 1, 2021
Space Lower Bounds for the Signal Detection Problem
Faith Ellen, Rati Gelashvili, Philipp Woelfel, et al.
Theory of Computing Systems
|
July 2, 2019
Limits of Schema Mappings
Phokion G Kolaitis, Reinhard Pichler, Emanuel Sallinger, et al.
Theory of Computing Systems
|
February 13, 2026
FullSynesth: Syntenic Reconciliation of a Set of Consistent Gene Trees
Mathieu Gascon, Mattéo Delabre, Nadia El-Mabrouk
Theory of Computing Systems
|
August 26, 2024
On Polynomial Recursive Sequences
Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, et al.
Page
of 2