Classes
- Selected Chapters on Graph TheoryNDMI070 | Faculty of Mathematics and Physics
- Linear Algebra Applications in Combinatorics +1NDMI028 | Faculty of Mathematics and Physics
- Geometric Representations of Graphs 2NDMI035 | Faculty of Mathematics and Physics
- Combinatorial StructuresNDMI036 | Faculty of Mathematics and Physics
- Geometric Representations of Graphs 1NDMI037 | Faculty of Mathematics and Physics
- Seminar on Combinatorial ProblemsNDMI052 | Faculty of Mathematics and Physics
- CombinatoricsNMAG403 | Faculty of Mathematics and Physics
Publications
- Determining the L(2, 1)-Span in Polynomial Space2012 | Faculty of Mathematics and Physics
- Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width2012 | Faculty of Mathematics and Physics
- Parameterized complexity of coloring problems: Treewidth versus vertex cover2011 | Faculty of Mathematics and Physics
- Exact algorithms for L(2,1)-labelings of graphs2011 | Faculty of Mathematics and Physics
- Fixed-parameter complexity of $\lambda$-colorings1999 | Faculty of Mathematics and Physics
- Choosing sets of color sets1998 | Faculty of Mathematics and Physics
- Coloring and covering polygon-circle graphs1997 | Faculty of Mathematics and Physics
- Complexity of colored graph covers I. Colored directed multigraphs1997 | Faculty of Mathematics and Physics
- Coloring precolored perfect graphs1997 | Faculty of Mathematics and Physics
- Complexity of colored graph covers II. When 2-SAT helpsPublication without faculty affiliation
Loading network view...