| Publication | Date of Publication | Type |
|---|
| On the oriented coloring of the disjoint union of graphs | 2024-04-14 | Paper |
| Smash and grab: the \(0 \cdot 6\) scoring game on graphs | 2024-02-20 | Paper |
| (k-2)-linear connected components in hypergraphs of rank k | 2023-07-13 | Paper |
| An update on the coin-moving game on the square grid | 2023-07-13 | Paper |
| A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals | 2023-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5881856 | 2023-03-13 | Paper |
| Partitions and well-coveredness: the graph sandwich problem | 2023-01-17 | Paper |
| Graph sandwich problem for the property of being well-covered and partitionable into \(k\) independent sets and \(\ell\) cliques | 2022-10-13 | Paper |
| Maker-Breaker is solved in polynomial time on hypergraphs of rank 3 | 2022-09-26 | Paper |
| On caterpillars of game chromatic number 4 | 2022-04-27 | Paper |
| On clique‐inverse graphs of graphs with bounded clique number | 2022-03-31 | Paper |
| On the oriented coloring of the disjoint union of graphs | 2022-03-22 | Paper |
| Characterizations, probe and sandwich problems on \(( k , \ell )\)-cographs | 2020-05-29 | Paper |
| Optimal Adjacent Vertex-Distinguishing Edge-Colorings of Circulant Graphs | 2020-04-27 | Paper |
| Timber game as a counting problem | 2019-05-17 | Paper |
| On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers | 2019-03-25 | Paper |
| A New Game Invariant of Graphs: the Game Distinguishing Number | 2018-11-26 | Paper |
| Octal games on graphs: the game 0.33 on subdivided stars and bistars | 2018-09-27 | Paper |
| Game distinguishing numbers of Cartesian products | 2018-07-18 | Paper |
| On the forbidden induced subgraph probe and sandwich problems | 2017-12-20 | Paper |
| Constant 2-labellings and an application to \((r, a, b)\)-covering codes | 2017-10-13 | Paper |
| Twins and Vertex- Identification on Graphs | 2017-08-10 | Paper |
| Trinque problem: covering complete graphs by plane degree-bounded hypergraphs | 2017-02-22 | Paper |
| On the choosability of claw-free perfect graphs | 2017-01-13 | Paper |
| Relaxed locally identifying coloring of graphs | 2016-11-29 | Paper |
| On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs | 2016-10-21 | Paper |
| Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs | 2016-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816053 | 2016-07-01 | Paper |
| Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs | 2015-12-07 | Paper |
| Identifying codes in vertex-transitive graphs and strongly regular graphs | 2015-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2949114 | 2015-10-07 | Paper |
| On weak odd domination and graph-based quantum secret sharing | 2015-09-16 | Paper |
| On disjoint hypercubes in Fibonacci cubes | 2015-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4982362 | 2015-04-09 | Paper |
| Solitaire clobber played on Cartesian product of graphs | 2015-02-06 | Paper |
| Solitaire Clobber on circulant graphs | 2014-06-25 | Paper |
| Distinguishing Number for some Circulant Graphs | 2014-06-15 | Paper |
| Graphs where every k-subset of vertices is an identifying set | 2014-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5396737 | 2014-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2867320 | 2013-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857369 | 2013-11-01 | Paper |
| Weighted perfect codes in Lee metric | 2013-10-10 | Paper |
| New results on variants of covering codes in Sierpiński graphs | 2013-08-05 | Paper |
| Identifying Codes in Line Graphs | 2013-07-31 | Paper |
| Strong reducibility of powers of paths and powers of cycles on Impartial Solitaire Clobber | 2013-07-23 | Paper |
| Impartial Solitaire Clobber played on Powers of Paths | 2013-07-19 | Paper |
| LAD models, trees, and an analog of the fundamental theorem of arithmetic | 2013-04-25 | Paper |
| \((a,b)\)-codes in \(\mathbb Z/n\mathbb Z\) | 2013-03-12 | Paper |
| Locally identifying coloring of graphs | 2012-10-24 | Paper |
| Optimal accessing and non-accessing structures for graph protocols | 2011-09-28 | Paper |
| On two variations of identifying codes | 2011-08-09 | Paper |
| Adaptive identification in Torii in the King lattice | 2011-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3073546 | 2011-02-11 | Paper |
| Paired-domination in subdivided star-free graphs | 2010-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3575007 | 2010-07-05 | Paper |
| Isometric embeddings of subdivided connected graphs into hypercubes | 2009-12-15 | Paper |
| New results about impartial solitaire clobber | 2009-11-12 | Paper |
| Weighted codes in Lee metrics | 2009-10-14 | Paper |
| Isometric Embeddings of Subdivided Complete Graphs in the Hypercube | 2009-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3635508 | 2009-07-06 | Paper |
| ON PLANARITY OF DIRECT PRODUCT OF MULTIPARTITE COMPLETE GRAPHS | 2009-06-23 | Paper |
| Geometrical extensions of Wythoff's game | 2009-06-19 | Paper |
| Subdivided graphs as isometric subgraphs of Hamming graphs | 2009-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3629024 | 2009-05-26 | Paper |
| Paired-domination in \(P_{5}\)-free graphs | 2009-04-29 | Paper |
| Identifying codes of Cartesian product of two cliques of the same size | 2009-04-07 | Paper |
| Adaptive identification in graphs | 2008-12-08 | Paper |
| On the total domination number of cross products of graphs | 2008-11-12 | Paper |
| Monochromatic Hamiltoniant-tight Berge-cycles in hypergraphs | 2008-10-08 | Paper |
| Isometric embeddings of subdivided complete graphs in the hypercube | 2008-06-05 | Paper |
| Paired-domination in generalized claw-free graphs | 2007-11-14 | Paper |
| Around Wythoff's game | 2007-05-29 | Paper |
| 2K2-Partition Problem | 2007-05-29 | Paper |
| Isometric embedding of subdivided Connected graphs in the hypercube | 2007-05-29 | Paper |
| On graphs having a \(V\setminus \{x\}\) set as an identifying code | 2007-02-13 | Paper |
| A generalization of the pentomino exclusion problem: dislocation of graphs | 2007-02-13 | Paper |
| Extended skew partition problem | 2006-10-30 | Paper |
| Some results on total domination in direct products of graphs | 2006-10-16 | Paper |
| Coloring fiber product of graphs | 2006-10-12 | Paper |
| QUANTUM OCTAL GAMES | 2006-08-21 | Paper |
| A linear algorithm for minimum 1-identifying codes in oriented trees | 2006-06-30 | Paper |
| Codes and \(L(2,1)\)-labelings in Sierpiński graphs | 2006-06-26 | Paper |
| Identifying codes of cycles | 2006-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3377548 | 2006-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708502 | 2005-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5461448 | 2005-07-26 | Paper |
| FindingH-partitions efficiently | 2005-06-07 | Paper |
| Construction of codes identifying sets of vertices | 2005-04-25 | Paper |
| Coloring the Maximal Cliques of Graphs | 2005-02-28 | Paper |
| Stable skew partition problem | 2004-11-23 | Paper |
| Hajós' theorem for list colorings of hypergraphs | 2004-10-27 | Paper |
| Identifying codes in some subgraphs of the square lattice | 2004-08-10 | Paper |
| Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets | 2004-08-06 | Paper |
| Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4461636 | 2004-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4461637 | 2004-05-18 | Paper |
| On a modular domination game. | 2004-03-14 | Paper |
| Graph covers using \(t\)-colourable vertex sets. | 2004-03-14 | Paper |
| On the choice number of claw-free perfect graphs | 2004-02-14 | Paper |
| Coloring the hypergraph of maximal cliques of a graph with no long path | 2003-11-25 | Paper |
| Isometric embeddings of subdivided wheels in hypercubes | 2003-08-19 | Paper |
| On a list-coloring problem | 2003-07-29 | Paper |
| Flips signés et triangulations d'un polygone. (Signed flips and triangulations of a polygon) | 2003-03-18 | Paper |
| Three moves on signed surface triangulations | 2002-12-10 | Paper |
| Total domination number of grid graphs | 2002-08-29 | Paper |
| On the pentomino exclusion problem | 2002-06-11 | Paper |
| Complexity of list coloring problems with a fixed total number of colors | 2002-05-15 | Paper |
| On Tucker's proof of the strong perfect graph conjecture for \((K_4-e)\)-free graphs | 2002-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741457 | 2001-10-24 | Paper |
| On the nonexistence of three-dimensional tiling in the Lee metric. II | 2001-10-23 | Paper |
| Variations on tilings in the Manhattan metric | 2001-03-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934399 | 2000-01-17 | Paper |
| On Tucker vertices of graphs | 1999-12-20 | Paper |
| Domination number of the cross product of paths | 1999-10-25 | Paper |
| On the complexity of a restricted list-coloring problem | 1999-08-03 | Paper |
| On the non-existence of 3-dimensional tiling in the Lee metric | 1999-04-08 | Paper |
| On domination numbers of Cartesian products of paths | 1998-10-27 | Paper |
| An algorithm for coloring some perfect graphs | 1998-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4379734 | 1998-07-08 | Paper |
| Choice number of 3-colorable elementary graphs | 1998-06-01 | Paper |
| Hamiltonicity of the cross product of two Hamiltonian graphs | 1997-08-10 | Paper |
| A Hajós-like theorem for list coloring | 1996-12-09 | Paper |
| On weakly diamond-free Berge graphs | 1996-12-08 | Paper |
| On the domination number of cross products of graphs | 1996-03-11 | Paper |
