Semi-streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints

2024-9-14

On the Parameterized Complexity of Compact Set Packing

2024-9-13

Ultimate Greedy Approximation of Independent Sets in Subcubic Graphs

2024-9-12

Testing Connectedness of Images

2024-9-12

Romeo and Juliet Meeting in Forest Like Regions

2024-9-3

Connected k-Center and k-Diameter Clustering

2024-9-2

Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited

2024-9-2

A Framework for Adversarial Streaming Via Differential Privacy and Difference Estimators

2024-8-31

Reconfiguring Shortest Paths in Graphs

2024-8-27

Parameterized Complexity of Reconfiguration of Atoms

2024-8-26

Runtime Analysis of Quality Diversity Algorithms

2024-8-13

On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity

2024-8-4

The Complexity of Finding and Enumerating Optimal Subgraphs to Represent Spatial Correlation

2024-7-31

Limitations of the Impagliazzo–Nisan–Wigderson Pseudorandom Generator Against Permutation Branching Programs

2024-7-29

Minimizing Energy Consumption for Real-Time Tasks on Heterogeneous Platforms Under Deadline and Reliability Constraints

2024-7-22

Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions

2024-7-22

On a Traveling Salesman Problem for Points in the Unit Cube

2024-7-18

New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling

2024-7-18

Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time

2024-7-18

Sublinear Algorithms in T-Interval Dynamic Networks

2024-7-12

Stagnation Detection in Highly Multimodal Fitness Landscapes

2024-7-2

Approximation Algorithms for the Two-Watchman Route in a Simple Polygon

2024-6-19

Parameterized Complexity of Streaming Diameter and Connectivity Problems

2024-6-19

Algorithms for Matrix Multiplication via Sampling and Opportunistic Matrix Multiplication

2024-6-17

Online Unit Profit Knapsack with Predictions

2024-6-13

Approximate and Randomized Algorithms for Computing a Second Hamiltonian Cycle

2024-6-12

Online Geometric Covering and Piercing

2024-6-3

Slim Tree-Cut Width

2024-6-1

Approximating Long Cycle Above Dirac’s Guarantee

2024-5-30

New Algorithms for Steiner Tree Reoptimization

2024-5-29

Approximation Algorithms for Covering Vertices by Long Paths

2024-5-28

Parity Permutation Pattern Matching

2024-5-22

Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions

2024-5-20

Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants

2024-5-13

Sample-Based Distance-Approximation for Subsequence-Freeness

2024-5-13

Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus

2024-5-10

Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data

2024-5-9

Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees

2024-5-9

Online Multiset Submodular Cover

2024-5-8

Runtime Analysis of Competitive Co-evolutionary Algorithms for Maximin Optimisation of a Bilinear Function

2024-4-27

Analysing Equilibrium States for Population Diversity

2024-4-16

Min Orderings and List Homomorphism Dichotomies for Graphs and Signed Graphs

2024-4-12

Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs

2024-4-6

The Impacts of Dimensionality, Diffusion, and Directedness on Intrinsic Cross-Model Simulation in Tile-Based Self-Assembly

2024-4-3

Generalized Coloring of Permutations

2024-3-29

Extending Partial Representations of Circle Graphs in Near-Linear Time

2024-3-26

$$\alpha _i$$-Metric Graphs: Radius, Diameter and all Eccentricities

2024-3-25

On The Closures of Monotone Algebraic Classes and Variants of the Determinant

2024-3-25

Embedding Arbitrary Boolean Circuits into Fungal Automata

2024-3-21

The Near Exact Bin Covering Problem

2024-3-19