Petr Hlinen{\'{y}} | AC Group | TU Wienhttps://ac.notready.eu/author/petr-hlinen%5Cy/Petr Hlinen{\'{y}}Hugo Blox Builder (https://hugoblox.com)en-usMon, 01 Jan 2024 00:00:00 +0000https://ac.notready.eu/media/logo_hu10234977157890132473.pngPetr Hlinen{\'{y}}https://ac.notready.eu/author/petr-hlinen%5Cy/Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width)https://ac.notready.eu/publication/crossing-number-is-np-hard-for-constant-path-width-and-tree-width/Mon, 01 Jan 2024 00:00:00 +0000https://ac.notready.eu/publication/crossing-number-is-np-hard-for-constant-path-width-and-tree-width/Parameterised Partially-Predrawn Crossing Numberhttps://ac.notready.eu/publication/parameterised-partially-predrawn-crossing-number/Sat, 01 Jan 2022 00:00:00 +0000https://ac.notready.eu/publication/parameterised-partially-predrawn-crossing-number/Kernelization using structural parameters on sparse graph classeshttps://ac.notready.eu/publication/kernelization-using-structural-parameters-on-sparse-graph-classes-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.notready.eu/publication/kernelization-using-structural-parameters-on-sparse-graph-classes-2/A New Perspective on FO Model Checking of Dense Graph Classeshttps://ac.notready.eu/publication/a-new-perspective-on-fo-model-checking-of-dense-graph-classes/Fri, 01 Jan 2016 00:00:00 +0000https://ac.notready.eu/publication/a-new-perspective-on-fo-model-checking-of-dense-graph-classes/Tree-depth and vertex-minorshttps://ac.notready.eu/publication/tree-depth-and-vertex-minors/Fri, 01 Jan 2016 00:00:00 +0000https://ac.notready.eu/publication/tree-depth-and-vertex-minors/FO Model Checking on Posets of Bounded Widthhttps://ac.notready.eu/publication/fo-model-checking-on-posets-of-bounded-width/Thu, 01 Jan 2015 00:00:00 +0000https://ac.notready.eu/publication/fo-model-checking-on-posets-of-bounded-width/Digraph width measures in parameterized algorithmicshttps://ac.notready.eu/publication/digraph-width-measures-in-parameterized-algorithmics/Wed, 01 Jan 2014 00:00:00 +0000https://ac.notready.eu/publication/digraph-width-measures-in-parameterized-algorithmics/Faster Existential FO Model Checking on Posetshttps://ac.notready.eu/publication/faster-existential-fo-model-checking-on-posets/Wed, 01 Jan 2014 00:00:00 +0000https://ac.notready.eu/publication/faster-existential-fo-model-checking-on-posets/Lower bounds on the complexity of MSO1 model-checkinghttps://ac.notready.eu/publication/lower-bounds-on-the-complexity-of-mso1-model-checking-2/Wed, 01 Jan 2014 00:00:00 +0000https://ac.notready.eu/publication/lower-bounds-on-the-complexity-of-mso1-model-checking-2/A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-widthhttps://ac.notready.eu/publication/a-unified-approach-to-polynomial-algorithms-on-graphs-of-bounded-bi-rank-width/Tue, 01 Jan 2013 00:00:00 +0000https://ac.notready.eu/publication/a-unified-approach-to-polynomial-algorithms-on-graphs-of-bounded-bi-rank-width/Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-widthhttps://ac.notready.eu/publication/better-algorithms-for-satisfiability-problems-for-formulas-of-bounded-rank-width-2/Tue, 01 Jan 2013 00:00:00 +0000https://ac.notready.eu/publication/better-algorithms-for-satisfiability-problems-for-formulas-of-bounded-rank-width-2/FO Model Checking of Interval Graphshttps://ac.notready.eu/publication/fo-model-checking-of-interval-graphs/Tue, 01 Jan 2013 00:00:00 +0000https://ac.notready.eu/publication/fo-model-checking-of-interval-graphs/Kernelization Using Structural Parameters on Sparse Graph Classeshttps://ac.notready.eu/publication/kernelization-using-structural-parameters-on-sparse-graph-classes/Tue, 01 Jan 2013 00:00:00 +0000https://ac.notready.eu/publication/kernelization-using-structural-parameters-on-sparse-graph-classes/Lower Bounds on the Complexity of MSO1 Model-Checkinghttps://ac.notready.eu/publication/lower-bounds-on-the-complexity-of-mso1-model-checking/Sun, 01 Jan 2012 00:00:00 +0000https://ac.notready.eu/publication/lower-bounds-on-the-complexity-of-mso1-model-checking/When Trees Grow Low: Shrubs and Fast MSO1https://ac.notready.eu/publication/when-trees-grow-low-shrubs-and-fast-mso1/Sun, 01 Jan 2012 00:00:00 +0000https://ac.notready.eu/publication/when-trees-grow-low-shrubs-and-fast-mso1/Clique-width: When Hard Does Not Mean Impossiblehttps://ac.notready.eu/publication/clique-width-when-hard-does-not-mean-impossible/Sat, 01 Jan 2011 00:00:00 +0000https://ac.notready.eu/publication/clique-width-when-hard-does-not-mean-impossible/Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-widthhttps://ac.notready.eu/publication/better-algorithms-for-satisfiability-problems-for-formulas-of-bounded-rank-width/Fri, 01 Jan 2010 00:00:00 +0000https://ac.notready.eu/publication/better-algorithms-for-satisfiability-problems-for-formulas-of-bounded-rank-width/New Results on the Complexity of Oriented Colouring on Restricted Digraph Classeshttps://ac.notready.eu/publication/new-results-on-the-complexity-of-oriented-colouring-on-restricted-digraph-classes/Fri, 01 Jan 2010 00:00:00 +0000https://ac.notready.eu/publication/new-results-on-the-complexity-of-oriented-colouring-on-restricted-digraph-classes/On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-widthhttps://ac.notready.eu/publication/on-parse-trees-and-myhill-nerode-type-tools-for-handling-graphs-of-bounded-rank-width/Fri, 01 Jan 2010 00:00:00 +0000https://ac.notready.eu/publication/on-parse-trees-and-myhill-nerode-type-tools-for-handling-graphs-of-bounded-rank-width/Automata approach to graphs of bounded rank-widthhttps://ac.notready.eu/publication/automata-approach-to-graphs-of-bounded-rank-width/Tue, 01 Jan 2008 00:00:00 +0000https://ac.notready.eu/publication/automata-approach-to-graphs-of-bounded-rank-width/