On the parameterized complexity of the Maximum Exposure Problem (Q2680233): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4947407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum exposure problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced Judicious Bipartition is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of multi-node hubs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms for graph partitioning problems / rank
 
Normal rank

Latest revision as of 09:19, 31 July 2024

scientific article
Language Label Description Also known as
English
On the parameterized complexity of the Maximum Exposure Problem
scientific article

    Statements

    On the parameterized complexity of the Maximum Exposure Problem (English)
    0 references
    0 references
    0 references
    0 references
    30 January 2023
    0 references
    maximum exposure problem
    0 references
    computational geometry
    0 references
    parameterized complexity
    0 references

    Identifiers