Table of Contents: “...Optimization in Graphs -- An Efficient Local Search Algorithm for Correlation Clustering on Large Graphs -- Algorithms on a path covering problem with applications in transportation -- Faster Algorithms for Evacuation Problems in Networks with a Single...”

Full text 

Table of Contents: “...Modeling and Algorithms -- Differentiable Discrete Optimization using Dataless Neural Networks -- When Advertising meets Assortment Planning: Joint Advertising and Assortment Optimization under Multinomial Logit Model -- Twin-treewidth: A single...”

Full text 

Table of Contents: “...-Node-, H-Node- and H-Edge-Deletion Problems -- Parameterized algorithms for Eccentricity Shortest Path Problem -- A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs -- Deterministic Performance Guarantees...”

Full text 

Table of Contents: “...Geometric Spanning Trees Minimizing the Wiener Index -- The Mutual Visibility Problem for Fat Robots -- Faster Algorithms for Cycle Hitting Problems on Disk Graphs -- Tight analysis of the lazy algorithm for open online dial-a-ride -- Online TSP...”

Full text 

Table of Contents: “... Problem Parameterized by Treewidth -- Isomorphism Testing for T -graphs in FPT -- Parameterized algorithms for Steiner Tree and Dominating Set: bounding the leafage by the vertex leafage -- Parameterized complexity of reconfiguration of atoms -- Parameterized...”

Full text 

Table of Contents: “...Distance from Triviality 2.0: Hybrid Parameterizations -- Graphs as Algorithms: Characterizing Motion-Planning Gadgets through Simulation and Complexity -- On the Existence of EFX Allocations -- Lower Bounds for Restricted Schemes in the Two-Adaptive...”

Full text 

Table of Contents: “...Design and analysis of sequential, parallel, randomized, parameterized algorithms. Distributed graph and network algorithms -- Structural graph theory with algorithmic or complexity applications -- Computational complexity of graph and network problems...”

Full text 

Table of Contents: “...Adjacency Labelling of Planar Graphs (and Beyond) -- Algorithms for Explainable Clustering -- On the Spanning and Routing Ratios of the Directed Ѳ6-Graph -- The Minimum Moving Spanning Tree Problem -- Scheduling with Testing on Multiple Identical...”

Full text 

Table of Contents: “...Routing among Convex Polygonal Obstacles in the Plane -- Target Coverage with Minimized Number of Camera Sensors -- Two-Stage Submodular Maximization under Curvature -- An Improved Approximation Algorithm for Capacitated Correlation Clustering Problem...”

Full text 

Table of Contents: “...Invited Papers -- Relaxed and Approximate Graph Realizations -- Search for combinatorial objects using lattice algorithms - revisited -- Contributed Papers -- Linear Algorithms for Red Blue Domination in Convex Bipartite Graphs -- Combinatorics...”

Full text 

Table of Contents: “...Invited talks -- Majority Spanning Trees, Cotrees and Their Applications -- New Transportation Problem on a Graph with Sending and Bringing-Back Operations -- Long papers -- Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting...”

Full text 

Subject (ZB): “...Algorithms....”

Full text 

Table of Contents: “...Invited Talks -- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics -- Open Problems on Graph Coloring for Special Graph Classes -- On the Complexity of Approximation and Online Scheduling Problems...”

Full text 

Table of Contents: “... graphs of paths with 2 bends -- Almost Induced Matching: Linear Kernels and Parameterized Algorithms -- Parameterized vertex deletion problems for hereditary graph classes with a block property -- Harmonious Coloring: Parameterized Algorithms and Upper bounds...”

Full text 

Subject (ZB): “...Algorithms....”

Full text 

Table of Contents: “...Algorithms for Problems on Maximum Density Segment -- Distance spectral radius of k-partitioned transmission regular graphs -- Color Spanning Objects: Algorithms and Hardness Results -- On Hamiltonian colorings of trees -- On the Complexity Landscape...”

Full text 

Subject (ZB): “...Algorithms....”

Full text 

Table of Contents: “... Bipartite Graph Matching -- Consensus of Two Graph Correspondences through a Generalisation of the Bipartite Graph Matching Algorithm -- Revisiting Volegnant-Jonker for Approximating Graph Edit Distance -- A Hypergraph Matching Framework for Refining Multi-source...”

Full text 

Subject (ZB): “...Algorithms....”

Full text 

Table of Contents: “... Adjustment -- An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs -- Generation of Colourings and Distinguishing Colourings of Graphs -- Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time -- On Coct-Free Multi...”

Full text