Q5091271 (Q5091271): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 15:53, 30 December 2024

scientific article; zbMATH DE number 7561602

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7561602

Statements

scholarly article

0 references

0 references

0 references

Pamela Fleischmann

0 references

Tomasz Kociumaka

0 references

0 references

Markus L. Schmid

0 references

publication date

21 July 2022

0 references

full work available at URL

https://arxiv.org/abs/1902.10983

0 references

zbMATH Keywords

graph and string parameters

0 references

NP-completeness

0 references

approximation algorithms

0 references

MaRDI profile type

MaRDI publication profile

0 references

Generalized function matching

0 references

Finding patterns common to a set of strings

0 references

Subexponential Algorithms for Unique Games and Related Problems

0 references

Expander flows, geometric embeddings and graph partitioning

0 references

0 references

Rounding Semidefinite Programming Hierarchies via Global Correlation

0 references

0 references

A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

0 references

A partial k-arboretum of graphs with bounded treewidth

0 references

Fixed-Parameter Tractability of Treewidth and Pathwidth

0 references

A note on exact algorithms for vertex ordering problems on graphs

0 references

Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth

0 references

0 references

On matching generalised repetitive patterns

0 references

0 references

Fundamentals of parameterized complexity

0 references

Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries

0 references

Improved Approximation Algorithms for Minimum Weight Vertex Separators

0 references

0 references

Revisiting Shinohara's algorithm for computing descriptive patterns

0 references

Pattern matching with variables: a multivariate complexity analysis

0 references

On the parameterised complexity of string morphism problems

0 references

Parametrized complexity theory.

0 references

Extended regular expressions: succinctness and decidability

0 references

Deterministic regular expressions with back-references

0 references

Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives

0 references

The expressibility of languages and relations by word equations

0 references

0 references

On the power of unique 2-prover 1-round games

0 references

Treewidth. Computations and approximations

0 references

Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

0 references

0 references

Topological Bandwidth

0 references

Developments from enquiries into the learnability of the pattern languages from positive data

0 references

0 references

Graph expansion and the unique games conjecture

0 references

Discontinuities in pattern inference

0 references

Patterns with bounded treewidth

0 references

Characterising REGEX languages by regular languages equipped with factor-referencing

0 references

Computing Pathwidth Faster Than 2 n

0 references

Cutwidth I: A linear time fixed parameter algorithm

0 references

Inapproximability of Treewidth and Related Problems

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

10.4230/LIPICS.ICALP.2019.109

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5091271

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5091271&oldid=39529395"