.- Happy set problems on cubic graphs and convex bipartite graphs.
.- Network Creation Games with 2-Neighborhood Maximization.
.- Almost-catalytic Computation.
.- The Complexity of Landmark Hub Labeling.
.- Improved Bounds for Geodetic Hulls.
.- Disjoint Temporal Walks Under Waiting Time Constraints.
.- A Fixed-Parameter Branching Algorithm for Chromatic Correlation Clustering.
.- Bounded degree QBF and positional games.
.- Subsequence Matching and LCS with Segment Number Constraints.
.- Fast Geographic Routing in Fixed-Growth Graphs.
.- Arithmetic Circuits with Division.
.- Pinwheel Covering.
.- On the Hardness of the Drone Delivery Problem.
.- Nonpartisan Feedback Vertex Set.
.- Parameterized Complexity of Disconnected Matchings.
.- Burning Path-like and Clique-like Graphs.
.- Online Bichromatic Piercing Set Problem.
.- Packing dimers to maximum occupancy under soft-core constraints.
.- Atoms versus Avoiding Simplicial Vertices.
.- Supereulerian Testing on Semi-Eulerian Graphs.
.- Perpetual Scheduling with Explorable Uncertainty.
.- Exact and Parameterized Algorithms for Window Width Minimization in Bipartite Arrangement.
