scientific article; zbMATH DE number 7561679
From MaRDI portal
Publication:5092396
DOI10.4230/LIPIcs.MFCS.2019.35MaRDI QIDQ5092396
Saket Saurabh, Pallavi Jain, Lawqueen Kanesh, Akanksha Agrawal
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- The maximum flow problem with disjunctive constraints
- Fundamentals of parameterized complexity
- Online variable-sized bin packing with conflicts
- On the parameterized complexity of some optimization problems related to multiple-interval graphs
- Paths, trees and matchings under disjunctive constraints
- Scheduling with conflicts: Online and offline algorithms
- A parameterized view on matroid optimization problems
- Treewidth. Computations and approximations
- Heuristics and lower bounds for the bin packing problem with conflicts
- An approximation scheme for bin packing with conflicts
- Approximation of knapsack problems with conflict and forcing graphs
- Parametrized complexity theory.
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- The Maximum Flow Problem with Conflict and Forcing Conditions
- Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
- The Knapsack Problem with Conflict Graphs
- On a routing problem
- Deterministic Truncation of Linear Matroids
- Determining a Minimum Spanning Tree with Disjunctive Constraints
- Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms
- Exploring the Kernelization Borders for Hitting Cycles
- Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms
- Multiplying matrices faster than coppersmith-winograd
- Parameterized Algorithms
- Conflict free version of covering problems on graphs: classical and parameterized
This page was built for publication:
