Accepted papers

  • Sammy Khalife, Yann Ponty and Laurent Bulteau. Sequence graphs realizations and ambiguity in language models
  • Jan Goedgebeur, Shenwei Huang, Yiao Ju and Owen Merkel. Colouring graphs with no induced six-vertex path or diamond
  • Sheng-Yen Ko, Ho-Lin Chen, Siu-Wing Cheng, Wing-Kai Hon and Chung-Shou Liao. General Max-Min Fair Allocation
  • Suthee Ruangwises. Two Standard Decks of Playing Cards are Sufficient for a ZKP for Sudoku
  • T-H. Hubert Chan and Chui Shan Lee. On the Hardness of Opinion Dynamics Optimization with $L_1$-Budget on Varying Susceptibility to Persuasion
  • Ruo-Wei Hung and Ming-Jung Chiu. The Restrained Domination and Independent Restrained Domination in Supergrid Graphs
  • Stephane Durocher, Mark Keil and Debajyoti Mondal. Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set
  • Alan Frieze, Krzysztof Turowski and Wojciech Szpankowski. The Concentration of the Maximum Degree in the Duplication-Divergence Models
  • Edward Pyne and Salil Vadhan. Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator against Permutation Branching Programs
  • Yu-Han Chen, Kung-Jui Pai, Hsin-Jung Lin and Jou-Ming Chang. Constructing Tri-CISTs in Shuffle-Cubes
  • Ching-Lueh Chang. Deterministic metric $1$-median selection with a $1-o(1)$ fraction of points ignored
  • Shin-Ichi Nakano. The Coverage problem by Aligned Disks
  • Dong Xiang and Yunzhou Ju. All-to-All Broadcast in Dragonfly Networks
  • Sambhav Gupta, Eddie Cheng and László Lipták. Conditional Fractional Matching Preclusion for Burnt Pancake Graphs and Pancake-Like Graphs
  • Tom Davot, Lucas Isenmann and Jocelyn Thiebaut. On the approximation hardness of geodetic set and its variants
  • Liam Roditty and Roei Tov. Approximate Distance Oracles with Improved Stretch for Sparse Graphs
  • Justie Su-Tzu Juan and Zong-You Lai. The Weakly Dimension-balanced Pancyclicity on Toroidal Mesh Graph Tm,n for Both m and n Are Odd
  • Yannick Bosch, Peter Schäfer, Joachim Spoerhase, Sabine Storandt and Johannes Zink. Consistent Simplification of Polyline Tree Bundles
  • Yihong Wang, Shuming Zhou and Zhengqin Yu. Reliability Evaluation of Subsystem Based on Exchanged Hypercube
  • Win Hlaing Hlaing Myint, Ryuhei Uehara and Giovanni Viglietta. Token Shifting on Graphs
  • Jiafei Liu, Shuming Zhou, Qianru Zhou and Zhengqin Yu. Fault diagnosability of regular networks under the Hybrid PMC model
  • Chun Lin, Chao-Yuan Huang and Ming-Jer Tsai. Efficient Algorithm for Enumerating Longest Common Increasing Subsequences
  • Guilherme C. M. Gomes, Bruno P. Masquio, Paulo E. D. Pinto, Vinicius F. dos Santos and Jayme L. Szwarcfiter. Disconnected Matchings
  • Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi and Kunihiro Wasa. Reconguring Directed Trees in a Digraph
  • Nai-Wen Chang, Hsuan-Jung Wu and Sun-Yuan Hsieh. A Study for Conditional Diagnosability of Pancake Graphs
  • Masaaki Kanzaki, Yota Otachi and Ryuhei Uehara. Computational Complexity of Jumping Block Puzzles
  • Vladimir Braverman, Viska Wei and Samson Zhou. Symmetric Norm Estimation and Regression on Sliding Windows
  • Yusuke Yanagisawa, Yuma Tamura, Akira Suzuki and Xiao Zhou. Decremental Optimization of Vertex-Coloring Under the Reconfiguration Framework
  • Sun-Yuan Hsieh, Van Bang Le and Sheng-Lung Peng. On the d-Claw Vertex Deletion Problem (Best Paper)
  • Tomoyuki Yamakami. Between SC and LOGDCFL: A Hierarch of Language Families Accepted by Log-Space Deterministic Auxiliary Depth-k Storage Automata
  • Bugra Caskurlu, Ozgun Ekici and Fatih Erdem Kızılkaya. On Singleton Congestion Games with Resilience Against Collusion
  • Stefan Hoffmann. Ideal Separation and General Theorems for Constrained Synchronization and their Application to Small Constraint Automata
  • Yuki Kobayashi, Yuya Higashikawa and Naoki Katoh. Improving Upper and Lower Bounds for the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs
  • Hyunjoon Cheon, Joonghyuk Hahn, Yo-Sub Han and Sang-Ki Ko. Most Pseudo-copy Languages Are Not Context-free
  • Kung-Jui Pai. Embedding Three Edge-disjoint Hamiltonian Cycles into Locally Twisted Cubes
  • Neelima Gupta, Sapna Grover and Rajni Dabas. Respecting Lower Bounds in Uniform Lower and Upper Bounded Facility Location Problem
  • Ankush Acharyya, Vahideh Keikha, Diptapriyo Majumdar and Supantha Pandit. Constrained Hitting Set Problem with Intervals
  • Meirun Chen, D. Frank Hsu and Cheng-Kuan Lin. A new measure for locally $t$-diagnosable under PMC model
  • Wei Ding. Finding Cheapest Deadline Paths
  • Pooja Goyal and B S Panda. Hardness and Approximation Results of Roman \{3\}-Domination in Graphs
  • Luerbio Faria and Uéverton Souza. On the Probe Problem for (r,l)-Well-Coveredness
  • Maciej Skorski. Hypercontractivity via Tensor Calculus
  • Cheng-Hung Chiang and Meng-Tsung Tsai. Single-Pass Streaming Algorithms to Partition Graphs into Few Forests
  • Richard Spence, Stephen Kobourov and Faryad Sahneh. Approximation algorithms for priority Steiner tree problems
  • Raimu Isuzugawa, Kodai Toyoda, Yu Sasaki, Daiki Miyahara and Takaaki Mizuki. A Card-minimal Three-Input AND Protocol Using Two Shuffles
  • Ben Cameron, Aaron Grubb and Joe Sawada. A Greedy Gray Code Listing for the Spanning Trees of the Fan Graph
  • Elisabet Burjons, Matthias Gehnen, Henri Lotze, Daniel Mock and Peter Rossmanith. The Secretary Problem with Reservation Costs
  • Eurinardo Costa, Nicolas Martins and Rudini Sampaio. Spy game: FPT-algorithm and results on graph products
  • Lu Han, Chenchen Wu and Yicheng Xu. Algorithms for the Lower-Bounded Connected Facility Location Problem
  • Ankush Acharyya, Ramesh Jallu, Vahideh Keikha, Maarten Löffler and Maria Saumell. Minimum Color Spanning Circle in Imprecise Setup
  • Songhua Li, Minming Li, Lingjie Duan and Victor C.S. Lee. Online Ride-Hitching in UAV Travelling
  • Nina Klobas and Matjaž Krnc. Distinguishing graphs via cycles
  • Chenhao Wang, Minming Li, Xiaoying Wu, Longteng Duan and Zifan Gong. Mechanism Design for Facility Location with Fractional Preferences and Minimum Distance
  • Sen Huang, Mingyu Xiao and Xiaoyu Chen. Exact algorithms for maximum weighted independent set on sparse graphs
  • Arindam Biswas and Venkatesh Raman. Sublinear-Space Approximation Algorithms for Max r-SAT
  • Jingyang Zhao and Mingyu Xiao. A Further Improvement on Approximating TTP-2