| Publication | Date of Publication | Type |
|---|
| \(S\)-packing coloring of cubic Halin graphs | 2024-04-02 | Paper |
| About \(S\)-packing coloring of subcubic graphs | 2024-03-27 | Paper |
| Distributed leader election and computation of local identifiers for programmable matter | 2023-10-20 | Paper |
| On List Coloring with Separation of the Complete Graph and Set System Intersections | 2022-09-07 | Paper |
| Coloring of the \(d^{\text{th}}\) power of the face-centered cubic grid | 2021-07-21 | Paper |
| On a vertex-edge marking game on graphs | 2021-03-29 | Paper |
| Packing colorings of subcubic outerplanar graphs | 2020-09-10 | Paper |
| Choosability with Separation of Cycles and Outerplanar Graphs | 2020-09-01 | Paper |
| Exact distance graphs of product graphs | 2020-01-21 | Paper |
| On \(S\)-packing edge-colorings of cubic graphs | 2019-03-28 | Paper |
| On the packing chromatic number of subcubic outerplanar graphs | 2019-02-20 | Paper |
| New reducible configurations for graph multicoloring with application to the experimental resolution of McDiarmid-Reed's Conjecture (extended version) | 2018-12-05 | Paper |
| Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees | 2018-01-11 | Paper |
| Completely independent spanning trees in some regular graphs | 2017-03-15 | Paper |
| \(S\)-packing colorings of cubic graphs | 2016-06-16 | Paper |
| Free choosability of outerplanar graphs | 2016-06-09 | Paper |
| A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs | 2016-05-18 | Paper |
| Subdivision into i-packings and S-packing chromatic number of some lattices | 2016-01-22 | Paper |
| On the family of \(r\)-regular graphs with Grundy number \(r+1\) | 2014-05-06 | Paper |
| Radio labelings of distance graphs | 2014-04-23 | Paper |
| The packing coloring of distance graphs \(D(k,t)\) | 2014-03-27 | Paper |
| On packing colorings of distance graphs | 2014-03-27 | Paper |
| Free choosability of the cycle | 2014-03-10 | Paper |
| Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable | 2014-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2864442 | 2013-12-06 | Paper |
| ℓ-distant Hamiltonian walks in Cartesian product graphs | 2013-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4650002 | 2012-11-15 | Paper |
| Vectorial solutions to list multicoloring problems on graphs | 2012-09-18 | Paper |
| Choosability of a weighted path and free-choosability of a cycle | 2010-05-31 | Paper |
| Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs | 2009-12-15 | Paper |
| Total and fractional total colourings of circulant graphs | 2009-01-28 | Paper |
| Radio k-labelings for Cartesian products of graphs | 2008-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387673 | 2008-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387687 | 2008-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387730 | 2008-05-27 | Paper |
| Multilevel Bandwidth and Radio Labelings of Graphs | 2008-03-25 | Paper |
| Linear and cyclic radio k-labelings of trees | 2008-02-22 | Paper |
| Optical Routing of Uniform Instances in Cayley Graphs | 2007-05-29 | Paper |
| Radio k-Labelings for Cartesian Products of Graphs | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3426085 | 2007-03-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5480704 | 2006-08-03 | Paper |
| The irregularity strength of circulant graphs | 2005-12-29 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452101 | 2004-02-11 | Paper |
| All-to-all wavelength-routing in all-optical compound networks | 2002-01-21 | Paper |
| Irregularity strength of trees | 2000-11-02 | Paper |
| Irregularity strength and compound graphs | 2000-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232779 | 1999-03-15 | Paper |
| Irregularity strength of the toroidal grid | 1998-03-01 | Paper |
