Online edition: ISSN 2432-6380
[TOP] | [2018] | [2019] | [2020] | [2021] | [2022] | [2023] | [2024] | [Japanese] / [English]
COMP2024-13
Basis sequence reconfiguration in the union of matroids
Hanaka Tesshu (Kyushu Univ.), Yuni Iwamasa (Kyoto Univ.), Yasuaki Kobayashi (Hokkaido Univ.), Yuto Okada (Nagoya Univ.), Rin Saito (Tohoku Univ.)
pp. 1 - 8
COMP2024-14
Approximation algorithm for Exact Intersection Base Problem
Yuya Ryuzaki, Yu Yokoi (Tokyo Tech)
pp. 9 - 14
COMP2024-15
A Fixed-Parameter Branching Algorithm for Chromatic Correlation Clustering
Kensuke Oowa, Peter Fulla, Takuro Fukunaga (Chuo Univ.)
pp. 15 - 20
COMP2024-16
[Invited Talk]
Arborescences, Colorful Forests, and Popularity
Telikepalli Kavitha (TIFR), Kazuhisa Makino (KyotoU), Ildikó Schlotter (CERS), Yu Yokoi (Tokyo Tech)
p. 21
COMP2024-17
Analysis of Flip Sequences for Pancake Sorting with the Base Sequence (1 3 5 2 4)
Kento Kimura (Seikei Univ.), Tetsuya Araki, Kazuyuki Amano (Gunma Univ.)
pp. 22 - 23
COMP2024-18
Unique Realizations of Graphs in Lp-space
Tomohiro Sugiyama, Shinichi Tanigawa (University of Tokyo)
p. 24
COMP2024-19
Understanding Horn's conditions for preemptive scheduling on identical parallel machines
-- Viewpoint from Network Flows --
Akiyoshi Shioura (Science Tokyo), Vitaly A. Strusevich, Natalia V. Shakhlevich (U. Leeds)
pp. 25 - 31
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.