The following pages link to Jakub Gajarský (Q340578):
Displaying 28 items.
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- Twin-width and generalized coloring numbers (Q2065919) (← links)
- Parameterized extension complexity of independent set and related problems (Q2413967) (← links)
- Kernelization Using Structural Parameters on Sparse Graph Classes (Q2849343) (← links)
- Parameterized Algorithms for Modular-Width (Q2867081) (← links)
- Finite Integer Index of Pathwidth and Treewidth (Q2946024) (← links)
- Parameterized Algorithms for Parity Games (Q2946404) (← links)
- (Q2957485) (← links)
- A New Perspective on FO Model Checking of Dense Graph Classes (Q4635873) (← links)
- First order limits of sparse graphs: Plane trees and path-width (Q4978432) (← links)
- (Q5002812) (← links)
- (Q5005129) (← links)
- First-Order Interpretations of Bounded Expansion Classes (Q5121280) (← links)
- Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences (Q5246725) (← links)
- (Q5874333) (← links)
- Faster Existential FO Model Checking on Posets (Q5892117) (← links)
- Faster Existential FO Model Checking on Posets (Q5899632) (← links)
- Parameterized shifted combinatorial optimization (Q5915595) (← links)
- Corrigendum to: ``Twin-width and generalized coloring numbers'' (Q6056475) (← links)
- (Q6124954) (← links)
- Recovering sparse graphs (Q6291909) (← links)
- Elementary first-order model checking for sparse graphs (Q6519389) (← links)
- Twin-width and types (Q6560925) (← links)
- Flipper games for monadically stable graph classes (Q6638138) (← links)
- Treelike decompositions for transductions of sparse graphs (Q6649461) (← links)
- Stable graphs of bounded twin-width (Q6649471) (← links)
- Model checking on interpretations of classes of bounded local cliquewidth (Q6649489) (← links)
- Taming graphs with no large creatures and skinny ladders (Q6654126) (← links)
