Skip to content
- Local Routing on Ordered Theta-Graphs
André van Renssen, Shuei Sakaguchi
- Reforming an Unfair Allocation by Exchanging Goods
Sheung Man Yuen, Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong
- Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs
Michelle Döring
- Compressibility Measures and Succinct Data Structures for Piecewise Linear Approximations
Paolo Ferragina, Filippo Lari
- Hardness and Fixed Parameter Tractability for Pinwheel Scheduling Problems
Yusuke Kobayashi, Bingkai Lin
- Quadratic Kernel for Cliques or Trees Vertex Deletion
Soh Kumabe
- A Tight Lower Bound for Online Service with Deadlines and Lazy Server
Linda Thelen, Yann Disser
- New Approximate Distance Oracles and Their Applications
Avi Kadria, Liam Roditty
- Small Space Encoding and Recognition of k-Palindromic Prefixes
Gabriel Bathie, Jonas Ellert, Tatiana Starikovskaya
- Maximizing Social Welfare among EF1 Allocations at the Presence of Two Types of Agents
Jiaxuan Ma, Yong Chen, Guangting Chen, Mingyang Gong, Guohui Lin, An Zhang
- Parameterized Complexity of Directed Traveling Salesman Problem
Václav Blažej, Andreas Emil Feldmann, Foivos Fioravantes, Paweł Rzążewski, Ondřej Suchý
- Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
- Realizing Metric Spaces with Convex Obstacles
Sándor Kisfaludi-Bak, Leonidas Theocharous
- Streaming Periodicity with Mismatches, Wildcards, and Edits
Tatiana Starikovskaya, Taha El Ghazi
- Realization of Temporally Connected Graphs Based on Degree Sequences
Arnaud Casteigts, Michelle Döring, Nils Morawietz
- Sparse Induced Subgraphs in P_7-Free Graphs of Bounded Clique Number
Maria Chudnovsky, Jadwiga Czyżewska, Kacper Kluk, Marcin Pilipczuk, Paweł Rzążewski
- A General Framework for Finding Diverse Solutions via Network Flow and Its Applications
Yuni Iwamasa, Tomoki Matsuda, Shunya Morihira, Hanna Sumita
- Anonymous Self-Stabilising Localisation via Spatial Population Protocols
Leszek Gasieniec, Łukasz Kuszner, Ehsan Latif, Ramviyas Parasuraman, Paul Spirakis, Grzegorz Stachowiak
- Pathfinding in Self-Deleting Graphs
Michal Dvořák, Dušan Knop, Michal Opler, Jan Pokorný, Ondřej Suchý, Krisztina Szilágyi
- BFS and Reverse Shortest Paths for Ball Intersection Graphs in Three and Higher Dimensions
Matthew Katz, Rachel Saban, Micha Sharir
- Incidences between Curves and Points on the Grid
Esther Ezra, Micha Sharir
- Reachability of Independent Sets and Vertex Covers under Extended Reconfiguration Rules
Shuichi Hirahara, Naoto Ohsaka, Tatsuhiro Suga, Akira Suzuki, Yuma Tamura, Xiao Zhou
- A Dimension-Reducing Fr’echet Simplification Oracle
Boris Aronov, Tsuri Farhana, Matthew Katz, Indu Ramesh
- Space-Efficient Depth-First Search via Augmented Succinct Graph Encodings
Michael Elberfeld, Frank Kammer, Johannes Meintrup
- Finding Diverse Solutions in Combinatorial Problems with a Distributive Lattice Structure
Andres López Martínez, Mark de Berg, Frits Spieksma
- Graph Coloring below Guarantees via Co-Triangle Packing
Shyan Akmal, Tomohiro Koana
- Star-Based Separators for Intersection Graphs of c-Colored Pseudo-Segments
Mark de Berg, Bart M.P. Jansen, Jeroen S.K. Lamme
- New Algorithmic Directions in Optimal Transport and Applications for Product Spaces
Salman Beigi, Omid Etesami, Mohammad Mahmoody, Amir Najafi
- Coloring Reconfiguration under Color Swapping
Janosch Fuchs, Rin Saito, Tatsuhiro Suga, Takahiro Suzuki, Yuma Tamura
- A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth
Sergio Cabello, Alexander Dobler, Gasper Fijavz, Thekla Hamm, Mirko H. Wagner
- Structural Parameterizations of Simultaneous Planarity
Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Matthias Pfretzschner, Ignaz Rutter
- Traffic-Oblivious Multi-Commodity Flow Network Design
Max Ilsen, Markus Chimani
- An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
Yike Chen, Ke Shi, Chao Xu
- Optimal Bipartite Online Matching in Degree 2 Graphs
Arghya Chakraborty, Prahladh Harsha, Amey Bhangale
- On the Approximability of the Monitoring Edge Geodetic Set Problem
Davide Bilò, Giordano Colli, Luca Forlizzi, Stefano Leucci
- Circle-Segment Intersection Queries in Connected Geometric Graphs
Sabine Storandt, Yannick Bosch
- Approximation Schemes for k-Subset Sum Ratio and k-Way Number Partitioning Ratio
Sotiris Kanellopoulos, Giorgos Mitropoulos, Antonis Antonopoulos, Nikos Leonardos, Aris Pagourtzis, Christos Pergaminelis, Stavros Petsalakis, Kanellos Tsitouras
- Parameterized Algorithms for the Drone Delivery Problem
Simon Bartlmae, Andreas Hene, Joshua Könen, Heiko Röglin
- Parallel Joinable B-Trees in the Fork-Join I/O Model
Ryuto Kitagawa, Michael T. Goodrich, Yan Gu, Yihan Sun
- Polynomial Equivalence of Extended Chemical Reaction Models
Divya Bajaj, Jose Luis Castellanos, Ryan Knobel, Austin Luchsinger, Aiden Massie, Adrian Salinas, Pablo Santos, Ramiro Santos, Robert Schweller, Tim Wylie
- Distributed Complexity of P_k-Freeness: Decision and Certification
Masayuki Miyamoto
- Enumerating the Irreducible Closed Sets of an Acyclic Implicational Base of Bounded Degree
Oscar Defrain, Arthur Ohana, Simon Vilmin
- Precoloring Extension with Demands on Paths
Arun Kumar Das, Michal Opler, Tomáš Valla
- Structural Parameters for Steiner Orientation
Tesshu Hanaka, Michael Lampis, Nikolaos Melissinos, Edouard Nemery, Hirotaka Ono, Manolis Vasilakis
- Time-Optimal k-Server
Fabian Frei, Dennis Komm, Moritz Stocker, Philip Whittington
- Finding d-Cuts in Claw-Free Graphs
Jungho Ahn, Tala Eagling-Vose, Felicia Lucke, Daniël Paulusma, Siani Smith
- Matchgate Signatures under Variable Permutations
Boning Meng, Yicheng Pan
- Deterministic Local Problems in Radio Networks: On the Impact of Local Domination and a Bit of Advice
Pawel Garncarek, Tomasz Jurdzinski, Dariusz Kowalski, Shay Kutten, Miguel A. Mosteiro
- A Parameterized Study of Secluded Structures in Directed Graphs
Jonas Schmidt, Shaily Verma, Nadym Mallek
- Covering Weighted Points Using Unit Squares
Chaeyoon Chung, Jaegun Lee, Hee-Kap Ahn
- Minimum Partition of Polygons under Width and Cut Constraints
Jaehoon Chung, Kazuo Iwama, Chung-Shou Liao, Hee-Kap Ahn
- Parameterized Reunion with Achromatic Number
Satyabrata Jana, Souvik Saha, Anannya Upasana, Saket Saurabh