Finger Search in the Implicit Model

Linear Layouts in Submodular Systems

Computing the longest common subsequence of two run-length encoded strings

Efficient Computation of Power Indices for Weighted Majority Games

Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors

A Time-Efficient Output-Sensitive Quantum Algorithm for Boolean Matrix Multiplication

On the Hyperbolicity of Small-World and Tree-Like Random Graphs

Fence patrolling by mobile agents with distinct speeds

Parameterized Clique on Scale-Free Networks

Computing 2, 3-centers over Streaming Data

Weak Visibility Queries of Line Segments in Simple Polygons

Interval graph representation with given interval and intersection lengths

On the Complexity of the Maximum Common Subgraph Problem for Partial $k$-Trees of Bounded Degree

Precision vs Confidence Tradeoffs for l2-Based Frequency Estimation in Data Streams

A Framework for Succinct Labeled Ordinal Trees over Large Alphabets

An Improved Algorithm for Static 3D Dominance Reporting in the Pointer Machine

Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs

The Multi-Service Center Problem

Efficient Counting of Square Substrings in a Tree

Area bounds of rectilinear polygons realized by angle sequences

Optimal Point Movement for Covering Circular Regions

A Partially Ordered Structure and a Generalization of the Canonical Partition for General Graphs with Perfect Matchings

The Canadian Traveller Problem Revisited

Segmental Mapping and Distance for Rooted Labeled Ordered Trees

Cubic Augmentation of Planar Graphs

Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting

Reconfiguration of List $L(2,1)$-Labelings in a Graph

How Many Potatoes are in a Mesh?

A strongly polynomial time algorithm for the shortest path problem on coherent planar periodic graphs

Multi-Unit Auctions with Budgets and Non-uniform Valuations

Revenue Maximization in a Bayesian Double Auction Market

Detecting Induced Minors in AT-free Graphs

Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph

Kernelization and Parameterized Complexity of Star Editing and Union Editing

Induced Immersions

Universal Point Subsets for Planar Graphs

Closing Complexity Gaps for Coloring Problems on H-Free Graphs

On the Neighbourhood Helly of some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets

On higher order Voronoi diagrams of line segments

Constant Unary Constraints and Symmetric Real-Weighted Counting CSPs

Interval Scheduling and Colorful Independent Sets

Green scheduling, flows and matchings

A General Method for Improving Insertion-Based Adaptive Sorting

A Space-Efficient Framework for Dynamic Point Location

Fast and Simple Fully-Dynamic Cut Tree Construction

An 8/3 Lower Bound for Online Dynamic Bin Packing

On the Advice Complexity of Buffer Management

Beyond homothetic polygons: recognition and maximum clique.

Degree-constrained orientations of embedded graphs

On the Farthest Line-Segment Voronoi Diagram

Abstract flows over time: A first step towards solving dynamic packing problems

Robust Nonparametric Data Approximation of Point Sets via Data Reduction

Vehicle Scheduling on a Graph Revisited

Counting Partitions of Graphs

Rectilinear Covering for Imprecise Input Points

Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem

Solving Circular Integral Block Decomposition in Polynomial Time

Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights

A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks

On Almost Disjunct Matrices for Group Testing

Extending Partial Representations of Subclasses of Chordal Graphs

Isomorphism for Graphs of Bounded Connected-Path-Distance-Width

Speeding up shortest path algorithms

Popular and Clan-Popular b-Matchings

On the Number of Upward Planar Orientations of Maximal Planar Graphs

More on a Problem of Zarankiewicz

The Minimum Vulnerability Problem

Strong conflict-free coloring for intervals