| Publication | Date of Publication | Type |
|---|
| Computational complexity of covering disconnected multigraphs | 2024-11-06 | Paper |
| Reconfiguration graph for vertex colourings of weakly chordal graphs | 2024-10-18 | Paper |
| Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract) | 2024-05-03 | Paper |
| List covering of regular multigraphs with semi-edges | 2024-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6168434 | 2023-08-08 | Paper |
| Computational Complexity of Covering Disconnected Multigraphs | 2023-06-10 | Paper |
| Extending partial representations of circular-arc graphs | 2023-05-05 | Paper |
| List covering of regular multigraphs | 2022-08-30 | Paper |
| Computational complexity of covering disconnected multigraphs | 2022-05-20 | Paper |
| On Edge-Length Ratios of Partial 2-Trees | 2022-04-26 | Paper |
| List covering of regular multigraphs with semi-edges | 2022-04-08 | Paper |
| On the Edge-Length Ratio of 2-Trees | 2021-12-01 | Paper |
| Reconfiguration graph for vertex colourings of weakly chordal graphs | 2020-01-22 | Paper |
| On Vertex- and Empty-Ply Proximity Drawings | 2019-02-20 | Paper |
| Parameterized complexity of distance labeling and uniform channel assignment problems | 2018-09-17 | Paper |
| 3-connected reduction for regular graph covers | 2018-08-24 | Paper |
| Gaps in full homomorphism order | 2018-01-18 | Paper |
| Fractal property of the graph homomorphism order | 2017-09-11 | Paper |
| An universality argument for graph homomorphisms | 2016-10-14 | Paper |
| Algorithmic Aspects of Regular Graph Covers | 2016-09-10 | Paper |
| Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems | 2016-09-02 | Paper |
| Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs | 2015-07-23 | Paper |
| Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree | 2015-06-10 | Paper |
| Locally constrained graph homomorphisms -- structure, complexity, and applications | 2014-10-07 | Paper |
| Universality of intervals of line graph order | 2014-09-02 | Paper |
| Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs | 2014-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5747399 | 2014-02-14 | Paper |
| Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs | 2013-12-06 | Paper |
| Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree | 2013-08-16 | Paper |
| Detecting induced star-like minors in polynomial time | 2013-06-24 | Paper |
| Dichotomy of the H-Quasi-Cover Problem | 2013-06-14 | Paper |
| Distance three labelings of trees | 2012-05-11 | Paper |
| The \(k\)-in-a-path problem for claw-free graphs | 2012-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113764 | 2012-01-23 | Paper |
| Parameterized complexity of coloring problems: treewidth versus vertex cover | 2011-05-18 | Paper |
| Comparing universal covers in polynomial time | 2010-08-13 | Paper |
| Complexity of the packing coloring problem for trees | 2010-05-25 | Paper |
| The packing chromatic number of infinite product graphs | 2009-06-17 | Paper |
| Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover | 2009-06-03 | Paper |
| Complexity of the Packing Coloring Problem for Trees | 2009-01-20 | Paper |
| Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy | 2008-09-04 | Paper |
| Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract) | 2008-08-28 | Paper |
| Comparing Universal Covers in Polynomial Time | 2008-06-05 | Paper |
| Block transitivity and degree matrices | 2008-05-29 | Paper |
| Distance Constrained Labelings of Trees | 2008-05-27 | Paper |
| Locally constrained graph homomorphisms and equitable partitions | 2008-05-13 | Paper |
| On the computational complexity of partial covers of theta graphs | 2008-04-16 | Paper |
| Independence and Coloring Problems on Intersection Graphs of Disks | 2008-03-14 | Paper |
| The subchromatic index of graphs | 2008-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439665 | 2007-05-29 | Paper |
| Block transitivity and degree matrices | 2007-05-29 | Paper |
| Cantor--Bernstein type theorem for locally constrained graph homomorphisms | 2006-11-15 | Paper |
| Theoretical Computer Science | 2006-11-01 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| A Brooks-Type Theorem for the Generalized List T-Coloring | 2006-06-01 | Paper |
| A complete complexity classification of the role assignment problem | 2006-03-20 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| Generalized list \(T\)-colorings of cycles | 2005-05-04 | Paper |
| New lower bounds on the weighted chromatic number of a graph | 2005-04-15 | Paper |
| Systems of distant representatives | 2005-02-22 | Paper |
| On distance constrained labeling of disk graphs | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4825539 | 2004-10-28 | Paper |
| Geometric separation and exact solutions for the parameterized independent set problem on disk graphs | 2004-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474120 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448371 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448755 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449222 | 2004-02-08 | Paper |
| Graph Subcolorings: Complexity and Algorithms | 2004-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427860 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422267 | 2003-09-03 | Paper |
| Partial covers of graphs | 2003-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414498 | 2003-07-25 | Paper |
| NP completeness of the edge precoloring extension problem on bipartite graphs | 2003-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796709 | 2003-04-03 | Paper |
| On-line coloring of geometric intersection graphs | 2003-03-10 | Paper |
| Fixed-parameter complexity of \(\lambda\)-labelings | 2002-03-29 | Paper |
| Computational complexity of covering cyclic graphs | 2002-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944992 | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4842442 | 1995-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3356811 | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3864477 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4132194 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5680921 | 1973-01-01 | Paper |
| Axiomatic theory of investment evaluating | 1971-01-01 | Paper |
| Interpolation with prescribed values of derivatives instead of function values | 1971-01-01 | Paper |
| Zeroes of orthogonal polynomials by QD-algorithm | 1969-01-01 | Paper |
| A note on the integrals involving product of Hermite's polynomials | 1966-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5513155 | 1965-01-01 | Paper |
| Compact sets in locally convex spaces | 1965-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5337314 | 1963-01-01 | Paper |
