Parameterized orientable deletion
DOI10.4230/LIPICS.SWAT.2018.24zbMATH Open1477.68229MaRDI QIDQ5116488FDOQ5116488
Authors: Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora 
Publication date: 25 August 2020
Recommendations
Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Planar orientations with low out-degree and compaction of adjacency matrices
- Which problems have strongly exponential complexity?
- Graph balancing: a special case of scheduling unrelated parallel machines
- Degree-constrained graph orientation: maximum satisfaction and minimum violation
- Graph structure and monadic second-order logic. A language-theoretic approach
- GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
- Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
- Parameterized algorithms
- On bounded-degree vertex deletion parameterized by treewidth
- On allocating goods to maximize fairness
- MaxMin allocation via degree lower-bounded arborescences
- Title not available (Why is that?)
- The parameterized complexity of editing graphs for bounded degeneracy
- On the configuration-LP for scheduling on unrelated machines
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity
- Generalized pseudoforest deletion: algorithms and uniform kernel
- A faster parameterized algorithm for pseudoforest deletion
Cited In (8)
- Grundy Distinguishes Treewidth from Pathwidth
- Generalized cuckoo hashing with a stash, revisited
- SEF view deletion under bounded condition
- SSE and SSD: page-efficient searchable symmetric encryption
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation
- Parameterized orientable deletion
- Title not available (Why is that?)
This page was built for publication: Parameterized orientable deletion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5116488)
