Filip Pokrývka

According to our database, Filip Pokrývka authored at least 8 papers between 2017 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

The χ-Binding Function of d-Directional Segment Graphs.

Lech Duraj, Ross J. Kang, Hoang La, Jonathan Narboni, Filip Pokrývka, Clément Rambaud, Amadeus Reinald

Discret. Comput. Geom., October, 2025

3D-grids are not transducible from planar graphs.

Jakub Gajarský, Michal Pilipczuk, Filip Pokrývka

Proceedings of the 40th Annual ACM/IEEE Symposium on Logic in Computer Science, 2025

2023

Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width.

Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022

Weighted Model Counting with Twin-Width: Experimental Results.

Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider

Dataset, June, 2022

Twin-width and Limits of Tractability of FO Model Checking on Geometric Graphs.

Petr Hlinený, Filip Pokrývka

CoRR, 2022

Weighted Model Counting with Twin-Width.

Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider

Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing, 2022

2020

Clique-Width of Point Configurations.

Onur Çagirici, Petr Hlinený, Filip Pokrývka, Abhisekh Sankaran

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

2017

FO Model Checking of Geometric Graphs.

Petr Hlinený, Filip Pokrývka, Bodhayan Roy

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017