RNDr. Jakub Gajarský, Ph.D.
Assistant professor, Department of Computer Science
| e‑mail: |
|---|
Total number of publications: 19
2023
-
Sparse Graphs of Twin-width 2 Have Bounded Tree-width
ISAAC 2023, year: 2023
2020
-
A New Perspective on FO Model Checking of Dense Graph Classes
ACM Transactions on Computational Logic, year: 2020, volume: 21, edition: 4, DOI
2019
-
Parameterized shifted combinatorial optimization
Journal of Computer and System Sciences, year: 2019, volume: 99, edition: 1, DOI
2018
-
Parameterized Extension Complexity of Independent Set and Related Problems
Discrete Applied Mathematics, year: 2018, volume: 248, edition: SI, DOI
2017
-
First order limits of sparse graphs: Plane trees and path-width
Random Structures & Algorithms, year: 2017, volume: 50, edition: 4, DOI
-
Kernelization using structural parameters on sparse graph classes
Journal of Computer and System Sciences, year: 2017, volume: 84, edition: 1, DOI
-
Parameterized Shifted Combinatorial Optimization
International Computing and Combinatorics Conference COCOON 2017 (LNCS, volume 10392), year: 2017
2016
-
A New Perspective on FO Model Checking of Dense Graph Classes
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science LICS2016, year: 2016
2015
-
Faster Existential FO Model Checking on Posets
Logical Methods in Computer Science, year: 2015, volume: 11, edition: 4, DOI
-
FO Model Checking on Posets of Bounded Width
56th Annual Symposium on Foundations of Computer Science, FOCS 2015, year: 2015