ERD

On polynomial recursive sequences

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Randomized Contractions Meet Lean Decompositions

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Efficient fully dynamic elimination forests with applications to detecting long paths and cycles

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Parameterized Inapproximability for Steiner Orientation by Gap Amplification

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

VC density of set systems defnable in tree-like graphs

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Erdös-Hajnal properties for powers of sparse graphs

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Small One-Dimensional Euclidean Preference Profiles

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Equal-Subset-Sum Faster Than the Meet-in-the-Middle

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Minimum Bisection Is Fixed-Parameter Tractable

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Matchings under Preferences - Strength of Stability and Trade-Offs

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Shorter Labeling Schemes for Planar Graphs

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

On Computing Centroids According to the $p$-Norms of Hamming Distance Vectors

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Internal Dictionary Matching

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Improved Distance Queries and Cycle Counting by Frobenius Normal Form

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Improving Schroeppel and Shamir's Algorithm for Subset Sum via Orthogonal Vectors

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Approximation and Parameterized Complexity of Minimax Approval Voting

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Reachability for Bounded Branching VASS

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Faster Approximate Pattern Matching: A Unified Approach

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Integer Programming and Incidence Treedepth.

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

When the Optimum is also Blind: a New Perspective on Universal Optimization

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Hardness of Approximation for H-Free Edge Modification Problems

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Tight Lower Bounds for the Complexity of Multicoloring

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

On Problems Equivalent to (min,+)-Convolution

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Improving TSP Tours Using Dynamic Programming over Tree Decompositions

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Resources

Selected filters:

On polynomial recursive sequences

Randomized Contractions Meet Lean Decompositions

Efficient fully dynamic elimination forests with applications to detecting long paths and cycles

Parameterized Inapproximability for Steiner Orientation by Gap Amplification

VC density of set systems defnable in tree-like graphs

Erdös-Hajnal properties for powers of sparse graphs

Small One-Dimensional Euclidean Preference Profiles

Equal-Subset-Sum Faster Than the Meet-in-the-Middle

Minimum Bisection Is Fixed-Parameter Tractable

Matchings under Preferences - Strength of Stability and Trade-Offs

Shorter Labeling Schemes for Planar Graphs

On Computing Centroids According to the $p$-Norms of Hamming Distance Vectors

Internal Dictionary Matching

Improved Distance Queries and Cycle Counting by Frobenius Normal Form

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs

Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP

Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs

Improving Schroeppel and Shamir's Algorithm for Subset Sum via Orthogonal Vectors

Approximation and Parameterized Complexity of Minimax Approval Voting

From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More

Reachability for Bounded Branching VASS

Faster Approximate Pattern Matching: A Unified Approach

Integer Programming and Incidence Treedepth.

When the Optimum is also Blind: a New Perspective on Universal Optimization

Hardness of Approximation for H-Free Edge Modification Problems

Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration

Tight Lower Bounds for the Complexity of Multicoloring

On Problems Equivalent to (min,+)-Convolution

Improving TSP Tours Using Dynamic Programming over Tree Decompositions