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 and algorithms for quasi-chain graphs
Composed Degree-Distance Realizations of Graphs
All Subgraphs of a Wheel are 5-Coupled-Choosable
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
Edge exploration of temporal graphs
Optimal monomial quadratization for ODE systems
A Hamilton Cycle in the k-Sided Pancake Network
Algorithms and Complexity of s-Club Cluster Vertex Deletion
Covering Convex Polygons by Two Congruent Disks
The Tandem Duplication Distance Problem is hard over bounded alphabets
On the oriented coloring of the disjoint union of graphs
The Pony Express Communication Problem
Skyline Groups are Ideals. An efficient algorithm for enumerating skyline groups
Vertex Cover at Distance on H-free Graphs
On an Ordering Problem in Weighted Hypergraphs
An Efficient Noisy Binary Search in Graphs via Median Approximation
A study on the existence of null labelling for 3-hypergraphs
Piercing All Translates of a Set of Axis-Parallel Rectangles
A triangle process on regular graphs
Complexity and Algorithms for MUL-Tree Pruning
Makespan Trade-offs for Visiting Triangle Edges
Augmenting a Tree to a k-Arbor-Connected Graph with Pagenumber k
Approximation algorithms for hitting subgraphs
Isomorphic unordered labeled trees up to substitution ciphering
Intersecting Disks using Two Congruent Disks
Disjoint Paths and Connected Subgraphs for H-Free Graphs
Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property
Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters
Non-preemptive tree packing
Card-based Cryptographic Protocols for Three-input Functions Using Private Operations
Königsberg Sightseeing: Eulerian Walks in Temporal Graphs
Reconfiguring Simple s; t Hamiltonian Paths in Rectangular Grid Graphs
New Approximations and Hardness Results for Submodular Partitioning Problems
An FPT Algorithm for Matching Cut and d-Cut
Backtrack search for parallelisms of projective spaces
Approximating Multistage Matching Problems
Heuristically enhanced IPO Algorithms for Covering Array Generation.