Vyzkoušejte nový nástroj s podporou AI
Summon Research Assistant
BETA
Approximation Results for the Incremental Knapsack Problem
Della Croce, Federico, Pferschy, Ulrich, Scatamacchia, Rosario
Published in Combinatorial Algorithms (2018)
Published in Combinatorial Algorithms (2018)
Get full text
Book Chapter
Computing Longest (Common) Lyndon Subsequences
Bannai, Hideo, I, Tomohiro, Kociumaka, Tomasz, Köppl, Dominik, Puglisi, Simon J.
Published in Combinatorial Algorithms (2022)
Published in Combinatorial Algorithms (2022)
Get full text
Book Chapter
An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number
Kobayashi, Yasuaki, Kobayashi, Yusuke, Miyazaki, Shuichi, Tamaki, Suguru
Published in Combinatorial Algorithms (01.01.2019)
Published in Combinatorial Algorithms (01.01.2019)
Get full text
Book Chapter
The Steiner Problem for Count Matroids
Published in Lecture notes in computer science
(01.01.2020)
Get full text
Book Chapter
Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings
Watanabe, Kiichi, Nakashima, Yuto, Inenaga, Shunsuke, Bannai, Hideo, Takeda, Masayuki
Published in Combinatorial Algorithms (01.01.2019)
Published in Combinatorial Algorithms (01.01.2019)
Get full text
Book Chapter
Minsum k-Sink Problem on Dynamic Flow Path Networks
Benkoczi, Robert, Bhattacharya, Binay, Higashikawa, Yuya, Kameda, Tsunehiko, Katoh, Naoki
Published in Combinatorial Algorithms (01.01.2018)
Published in Combinatorial Algorithms (01.01.2018)
Get full text
Book Chapter
On Computing Large Temporal (Unilateral) Connected Components
Published in Lecture notes in computer science
Get full text
Book Chapter