scientific article; zbMATH DE number 7205203
From MaRDI portal
Publication:5111878
DOI10.4230/LIPIcs.IPEC.2017.19zbMath1443.68105MaRDI QIDQ5111878
Petr Hliněný, Bodhayan Roy, Filip Pokrývka
Publication date: 27 May 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60) Classical first-order logic (03B10) Graph representations (geometric and intersection representations, etc.) (05C62) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs
- Characterizing and recognizing weak visibility polygons
- Reducing prime graphs and recognizing circle graphs
- Hiding people in polygons
- Unit disk graph recognition is NP-hard
- Linear-time recognition of circular-arc graphs
- Cleaning interval graphs
- Linear time solvable optimization problems on graphs of bounded clique-width
- Interpreting nowhere dense graph classes as a classical notion of model theory
- Computing the maximum clique in the visibility graph of a simple polygon
- Deciding first-order properties of locally tree-decomposable structures
- FO Model Checking of Interval Graphs
- The Complexity of the Partial Order Dimension Problem
- Model checking existential logic on partially ordered sets
- A New Perspective on FO Model Checking of Dense Graph Classes
- Deciding First-Order Properties of Nowhere Dense Graphs
- Visibility Algorithms in the Plane
- Algorithms – ESA 2005
- Faster Existential FO Model Checking on Posets
- Inapproximability of finding maximum hidden sets on polygons and terrains
This page was built for publication:
