scientific article; zbMATH DE number 7238979
From MaRDI portal
Publication:5116488
DOI10.4230/LIPIcs.SWAT.2018.24zbMath1477.68229MaRDI QIDQ5116488
Florian Sikora, Yota Otachi, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis
Publication date: 25 August 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Directed graphs (digraphs), tournaments (05C20) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (6)
SSE and SSD: page-efficient searchable symmetric encryption ⋮ Grundy Distinguishes Treewidth from Pathwidth ⋮ Generalized cuckoo hashing with a stash, revisited ⋮ Unnamed Item ⋮ Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation ⋮ Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation
Cites Work
- Unnamed Item
- Unnamed Item
- Degree-constrained graph orientation: maximum satisfaction and minimum violation
- On the configuration-LP for scheduling on unrelated machines
- Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
- 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
- On bounded-degree vertex deletion parameterized by treewidth
- The parameterized complexity of editing graphs for bounded degeneracy
- 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
- Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel
- GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
- A faster parameterized algorithm for pseudoforest deletion
- On Allocating Goods to Maximize Fairness
- MaxMin allocation via degree lower-bounded arborescences
- Parameterized Algorithms
This page was built for publication:
