pith. sign in

Ond\v{r}ej Such\'y

Identifiers

  • name variant Ond\v{r}ej Such\'y 0.60 · backfill

Papers (10)

  1. Tree-independence number of $P_5$-free graphs with no large bicliques math.CO · 2026 · author #7
  2. Balancing the Spread of Two Opinions in Sparse Social Networks cs.DS · 2021 · author #3
  3. Complexity of the Steiner Network Problem with Respect to the Number of Terminals cs.DM · 2018 · author #4
  4. Fixed-Parameter Algorithms for DAG Partitioning cs.DS · 2016 · author #7
  5. A Simple Streaming Bit-parallel Algorithm for Swap Pattern Matching cs.DS · 2016 · author #2
  6. On Directed Steiner Trees with Multiple Roots cs.DS · 2016 · author #1
  7. A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack cs.DS · 2015 · author #3
  8. On the Parameterized Complexity of Computing Balanced Partitions in Graphs cs.DM · 2013 · author #4
  9. Parameterized Complexity of Directed Steiner Tree on Sparse Graphs cs.DS · 2012 · author #5
  10. Beyond Max-Cut: \lambda-Extendible Properties Parameterized Above the Poljak-Turz\'{i}k Bound cs.DS · 2012 · author #4

Mentions

  • 1508.01657 #3 · backfill · confidence 0.70 Ond\v{r}ej Such\'y
  • 2105.10184 #3 · arxiv_oai · confidence 0.70 Ond\v{r}ej Such\'y
  • 1312.7014 #4 · backfill · confidence 0.70 Ond\v{r}ej Such\'y
  • 1210.0260 #5 · backfill · confidence 0.70 Ond\v{r}ej Such\'y
  • 1207.5696 #4 · backfill · confidence 0.70 Ond\v{r}ej Such\'y

Frequent Coauthors