scientific article; zbMATH DE number 7561672
From MaRDI portal
Publication:5092387
DOI10.4230/LIPIcs.MFCS.2019.28MaRDI QIDQ5092387
Jayakrishnan Madathil, Roohani Sharma, Meirav Zehavi
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the algorithmic effectiveness of digraph decompositions and complexity measures
- A well-quasi-order for tournaments
- Kernels for feedback arc set in tournaments
- Parameterized graph separation problems
- On the complexity of finding balanced oneway cuts
- Some simplified NP-complete graph problems
- Fixed-parameter tractability results for feedback set problems in tournaments
- Tournament minors
- Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph
- Minimum Bisection Is NP-hard on Unit Disk Graphs
- Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament
- Fast FAST
- Partitioning Planar Graphs
- Color-coding
- Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs
- Strong immersion is a well‐quasi‐ordering for semicomplete digraphs
- Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity
- Minimum bisection is fixed parameter tractable
- Parameterized Algorithms
- Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
