4 citations · 13 across the 20 of their papers we have counts for
4 papers · 1 filter
Exact exponential algorithms for two poset problems
László Kozma
Partially ordered sets (posets) are fundamental combinatorial objects with important applications in computer science. Perhaps the most natural algorithmic task, given a size- p…
Finding and counting permutations via CSPs
Benjamin Aram Berendsohn, László Kozma, Dániel Marx
Permutation patterns and pattern avoidance have been intensively studied in combinatorics and computer science, going back at least to the seminal work of Knuth on stack-sorting (1…
Hamiltonicity below Dirac's condition
Bart M. P. Jansen, László Kozma, Jesper Nederlof
Dirac's theorem (1952) is a classical result of graph theory, stating that an -vertex graph () is Hamiltonian if every vertex has degree at least . Both the value…
Faster and simpler algorithms for finding large patterns in permutations
László Kozma
Permutation patterns and pattern avoidance have been intensively studied in combinatorics and computer science, going back at least to the seminal work of Knuth on stack-sorting (1…