会议文集


文集名Algorithms and Complexity
会议名14th International Conference on Algorithms and Complexity (CIAC 2025)
中译名《第十四届国际算法与复杂性会议,卷2》
机构European Association for Theoretical Computer Science (EATCS)
会议日期June 10-12, 2025
会议地点Rome, Italy
出版年2025
馆藏号356936


题名作者出版年
Happy Set Problems on Cubic Graphs and Convex Bipartite GraphsYuichi Asahiro; Hiroshi Eto; Guohui Lin; Eiji Miyano; Yudai Oka2025
Network Creation Games with 2-Neighborhood MaximizationMerlin de la Haye; Pascal Lenzner; Daniel Schmand; Nicole Schroder2025
Almost-Catalytic ComputationSagar Bisoyi; Krishnamoothy Dinesh; Bhabya Deep Rai; Jayalal Sarma2025
The Complexity of Landmark Hub LabelingLouann Coste; Ruoying Li; Sabine Storandt; Tobias Topfer2025
Improved Bounds for Geodetic HullsGregor Diatzko; Sabine Storandt; Tobias Topfer2025
Disjoint Temporal Walks Under Waiting Time ConstraintsAllen Ibiapina; Raul Lopes; Andrea Marino; Ana Silva2025
A Fixed-Parameter Branching Algorithm for Chromatic Correlation ClusteringKensuke Oowa; Peter Fulla; Takuro Fukunaga2025
Bounded Degree QBF and Positional GamesNacim Oijid2025
Subsequence Matching and LCS with Segment Number ConstraintsYuki Yonemoto; Takuya Mieno; Shunsuke Inenaga; Ryo Yoshinaka; Ayumi Shinohara2025
Fast Geographic Routing in Fixed-Growth GraphsOfek Gila; Michael T. Goodrich; Abraham M. Illickan; Vinesh Sridhar2025
Arithmetic Circuits with DivisionSilas Cato Sacher2025
Pinwheel CoveringAkitoshi Kawamura; Yusuke Kobayashi; Yosuke Kusano2025
On the Hardness of the Drone Delivery ProblemSimon Bartlmae; Andreas Hene; Kelin Luo2025
Nonpartisan Feedback Vertex SetNidhi Purohit; Souvik Saha; Saket Saurabh; Anannya Upasana2025
Parameterized Complexity of Disconnected MatchingsSushmita Gupta; Pallavi Jain; Lawqueen Kanesh; Sounak Modak; Saket Saurabh2025
Burning Path-Like and Clique-Like GraphsRadhika Aggarwal; Pradeesha Ashok; Dhairya Gupta2025
Online Bichromatic Piercing Set ProblemMinati De; Ratnadip Mandal2025
Packing Dimers to Maximum Occupancy Under Soft-Core ConstraintsRobert D. Barish; Tetsuo Shibuya2025
Atoms Versus Avoiding Simplicial VerticesKarl Boddy; Konrad K. Dabrowski; Daniel Paulusma2025
Supereulerian Testing on Semi-Eulerian GraphsWing-Kai Hon; Meng-Tsung Tsai; Ching-Yu Yang2025
12