Maximum Matching on Trees in the Online Preemptive and the Incremental Dynamic Graph Models

Parameterized Shifted Combinatorial Optimization

Approximation algorithms for the maximum weight internal spanning tree problem

An Improved Lower Bound on the Growth Constant of Polyiamonds

Simple O(n log ^2 n) algorithms for the planar 2-center problem

Better Inapproximability Bounds and Approximation Algorithms for Min-Max Tree/Cycle/Path Cover Problems

Constrained Routing Between Non-Visible Vertices

Stable Matchings in Trees

An FPTAS for the Volume of Some V-polytopes --It is Hard to Compute The Volume of The Intersection of Two Cross-polytopes

On the Complexity of k-Metric Antidimension Problem and the Size of k-Antireloving Sets in Random Graphs

An Incentive Compatible, Efficient Market for Air Traffic Flow Management

Bend Complexity and Hamiltonian Cycles in Grid Graphs

Approximation Algorithms for Scheduling Multiple Two-Stage Flowshops

Optimal Online Two-way Trading with Bounded Number of Transactions

NP-hardness and structural results for half-squares of tree convex bipartite graphs

Information Complexity of the AND Function in the Two-Party and Multi-Party Settings

Optimal covering and hitting of line segments by two axis-parallel squares

Complexity and Algorithms for Finding a Subset of Vectors with the Longest Sum

Improved Approximation Algorithm for the Maximum Base Pair Stackings Problem in RNA Secondary Structures Prediction

Quantum Query Complexity of Unitary Operator Discrimination

Incentive Ratios of a Proportional Sharing Mechanism in Resource Sharing

The approximability of the p-hub center problem with parameterized triangle inequality

NP-completeness results for partitioning a graph into total dominating sets

Strong Triadic Closure in Cographs and Graphs of Low Maximum Degree

A Time-Space Trade-off for Triangulations of Points in the Plane

Unfolding Some Classes of Orthogonal Polyhedra of Arbitrary Genus

Pure Nash Equilibria in Restricted Budget Games

Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes

A local search approximation algorithm for the $k$-means problem with penalties

Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and Applications

Depth Distribution in High Dimensions

Approximate Minimum Diameter

Deletion Graph Problems Based on Deadlock Resolution

Approximating Weighted Duo-Preservation in Comparative Genomics

Dynamic Rank-Maximal Matchings

Randomized Incremental Construction for the Hausdorff Voronoi Diagram revisited and extended

The Existence of Universally Agreed Fairest Semi-matchings in Any Given Bipartite Graph

An improved kernel for Parameterized Bisection above Tight Lower Bound

Reconfiguration of Maximum-Weight b-Matchings in a Graph

Constant Approximation for Stochastic Orienteering Problem with $(1+\epsilon)$-Budget Relaxiation

Faster Graph Coloring in Polynomial Space

Local Search strikes again: PTAS for variants of Geometric Covering and Packing

Efficient Enumeration of Maximal $k$-Degenerate Subgraphs in a Chordal Graph

Linear Representation of Transversal Matroids and Gammoids parameterized by rank

Reoptimization of Minimum Latency Problem

On Constant depth circuits parameterized by degree: Identity testing and depth reduction

A Tighter Relation between Sensitivity Complexity and Certificate Complexity

On the Modulo Degree Complexity of Boolean Functions