Skip to main content

5 Result(s)

within Chapter Remove this filter Dušan Knop Remove this filter English Remove this filter Data Structures Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Graph Isomorphism Restricted by Lists

    The complexity of graph isomorphism (GraphIso) is a famous problem in computer science. For graphs G and H, it asks whether they are the same up to a relabeling of vertices. In 1981, Lubiw proved that list restri...

    Pavel Klavík, Dušan Knop, Peter Zeman in Graph-Theoretic Concepts in Computer Science (2020)

  2. No Access

    Chapter and Conference Paper

    Integer Programming and Incidence Treedepth

    Recently a strong connection has been shown between the tractability of integer programming (IP) with bounded coefficients on the one side and the structure of its constraint matrix on the other side. To that ...

    Eduard Eiben, Robert Ganian, Dušan Knop… in Integer Programming and Combinatorial Opti… (2019)

  3. No Access

    Chapter and Conference Paper

    Kernelization of Graph Hamiltonicity: Proper H-Graphs

    We obtain new polynomial kernels and compression algorithms for Pat...

    Steven Chaplick, Fedor V. Fomin, Petr A. Golovach… in Algorithms and Data Structures (2019)

  4. No Access

    Chapter and Conference Paper

    Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity

    This paper settles the computational complexity of model checking of several extensions of the monadic second order (MSO) logic on two classes of graphs: graphs of bounded treewidth and graphs of bounded neighbor...

    Dušan Knop, Martin Koutecký, Tomáš Masařík… in Graph-Theoretic Concepts in Computer Scien… (2017)

  5. No Access

    Chapter and Conference Paper

    Computational Complexity of Distance Edge Labeling

    The problem of Distance Edge Labeling is a variant of Distance Vertex Labeling (also known as \(\mathrm{L}_{2,1}\) la...

    Dušan Knop, Tomáš Masařík in Combinatorial Algorithms (2016)