Q5091271 (Q5091271): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.ICALP.2019.109 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Generalized function matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding patterns common to a set of strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential Algorithms for Unique Games and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander flows, geometric embeddings and graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding Semidefinite Programming Hierarchies via Global Correlation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability of Treewidth and Pathwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on exact algorithms for vertex ordering problems on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5136316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On matching generalised repetitive patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Minimum Weight Vertex Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2955004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting Shinohara's algorithm for computing descriptive patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern matching with variables: a multivariate complexity analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterised complexity of string morphism problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended regular expressions: succinctness and decidability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic regular expressions with back-references / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressibility of languages and relations by word equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4013526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of unique 2-prover 1-round games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological Bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Developments from enquiries into the learnability of the pattern languages from positive data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph expansion and the unique games conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discontinuities in pattern inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Patterns with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterising REGEX languages by regular languages equipped with factor-referencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Pathwidth Faster Than 2 n / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutwidth I: A linear time fixed parameter algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of Treewidth and Related Problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.ICALP.2019.109 / rank
 
Normal rank

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

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    21 July 2022
    0 references
    graph and string parameters
    0 references
    NP-completeness
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers