scientific article; zbMATH DE number 6862107
From MaRDI portal
Publication:4636613
DOI10.4230/LIPICS.STACS.2017.15zbMATH Open1402.68140MaRDI QIDQ4636613FDOQ4636613
Michał Pilipczuk, Mikołaj Bojańczyk
Publication date: 19 April 2018
Title of this publication is not available (Why is that?)
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Automata and formal grammars in connection with logical questions (03D05)
Cited In (12)
- Title not available (Why is that?)
- A polynomial excluded-minor approximation of treedepth
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing Tree Decompositions
- Complexity of secure sets
- Title not available (Why is that?)
- Evaluation of an MSO-Solver
- Title not available (Why is that?)
- Typical sequences revisited -- computing width parameters of graphs
- A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth
- Title not available (Why is that?)
Recommendations
- Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning 👍 👎
- Computing Optimal Hypertree Decompositions 👍 👎
- Finding good tree decompositions by local search 👍 👎
- Tree decomposition and discrete optimization problems: a survey 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636613)
