ERD

Clifford Algebras Meet Tree Decompositions

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Why Do Cascade Sizes Follow a Power-Law?

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Shortest Augmenting Paths for Online Matchings on Trees

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Covering minimal separators andpotential maximal cliques in $P_{t}$-free graphs

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Periodic Reporting for period 4 - TOTAL (Technology transfer between modern algorithmic paradigms)

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Many Visits TSP Revisited

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Bounds on Half Graph Orders in Powers of Sparse Graphs

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Online facility location with deletions

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Circular Pattern Matching with k Mismatches.

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Subquadratic Approximation Scheme for Partition

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Finding large $H$-colorable subgraphs in hereditary graph classes

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

SMART: SuperMaximal approximate repeats tool.

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

The Asymmetric Travelling Salesman Problem in Sparse Digraphs

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

On Directed Feedback Vertex Set Parameterized by Treewidth

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Quasi-polynomial-time algorithm for Independent Set in Pt-free graphs via shrinking the space of induced paths

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

On the Complexity Landscape of Connected f -Factor Problems

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Round Compression for Parallel Matching Algorithms

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Rankwidth meets stability

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints

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

Unary Words Have the Smallest Levenshtein k-Neighbourhoods

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max

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

Contracting a planar graph efficiently

Project: TOTAL

Updated at: 27-04-2024

Show more information

Project acronym TOTAL

Resources

Selected filters:

Clifford Algebras Meet Tree Decompositions

Why Do Cascade Sizes Follow a Power-Law?

Shortest Augmenting Paths for Online Matchings on Trees

A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs

Covering minimal separators andpotential maximal cliques in $P_{t}$-free graphs

Periodic Reporting for period 4 - TOTAL (Technology transfer between modern algorithmic paradigms)

Many Visits TSP Revisited

Bounds on Half Graph Orders in Powers of Sparse Graphs

Online facility location with deletions

Circular Pattern Matching with k Mismatches.

Subquadratic Approximation Scheme for Partition

Finding large $H$-colorable subgraphs in hereditary graph classes

SMART: SuperMaximal approximate repeats tool.

The Asymmetric Travelling Salesman Problem in Sparse Digraphs

Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems

On Directed Feedback Vertex Set Parameterized by Treewidth

Quasi-polynomial-time algorithm for Independent Set in Pt-free graphs via shrinking the space of induced paths

On the Complexity Landscape of Connected f -Factor Problems

Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs

From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More

Round Compression for Parallel Matching Algorithms

Rankwidth meets stability

Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints

Improved Distance Queries and Cycle Counting by Frobenius Normal Form.

Unary Words Have the Smallest Levenshtein k-Neighbourhoods

On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five

Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity

Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max

Approximation and Parameterized Complexity of Minimax Approval Voting

Contracting a planar graph efficiently