| Publication | Date of Publication | Type |
|---|
| On 4-colorable robust critical graphs | 2022-03-09 | Paper |
| Global Domination | 2021-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5133058 | 2020-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5119831 | 2020-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5235959 | 2019-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4566241 | 2018-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2960941 | 2017-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2940127 | 2015-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2878221 | 2014-08-28 | Paper |
| Edge dominating sets and vertex covers | 2013-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2839639 | 2013-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2918573 | 2012-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113195 | 2012-02-08 | Paper |
| Global secure sets of grid-like graphs | 2011-03-10 | Paper |
| Rooted secure sets of trees | 2011-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3070314 | 2011-02-02 | Paper |
| On global domination critical graphs | 2009-12-15 | Paper |
| On a graph's security number | 2009-12-10 | Paper |
| Partitioning a graph into alliance free sets | 2009-06-23 | Paper |
| Powerful alliances in graphs | 2009-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3620542 | 2009-04-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3616016 | 2009-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5443200 | 2008-02-20 | Paper |
| Security in graphs | 2007-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3429515 | 2007-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3429552 | 2007-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3423990 | 2007-02-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5488895 | 2006-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5488368 | 2006-09-14 | Paper |
| On the dimension of trees | 2005-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4677931 | 2005-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4677972 | 2005-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4826275 | 2004-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472692 | 2004-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4460555 | 2004-05-18 | Paper |
| Edge-recognizable domination numbers. | 2003-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4405776 | 2003-11-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4405794 | 2003-10-30 | Paper |
| Resolving domination in graphs | 2003-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4529248 | 2002-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4529305 | 2002-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2744375 | 2002-05-02 | Paper |
| Full domination in graphs | 2002-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2760986 | 2001-12-17 | Paper |
| An extremal bandwidth problem for bipartite graphs | 2001-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4943523 | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4489223 | 2000-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4243049 | 2000-03-13 | Paper |
| Inversions in \(k\)-sorted permutations | 1999-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3838412 | 1999-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4393299 | 1998-11-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3838181 | 1998-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4393275 | 1998-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4378181 | 1998-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4337366 | 1997-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2785713 | 1997-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5283983 | 1997-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4880520 | 1996-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4863417 | 1996-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873681 | 1996-04-17 | Paper |
| On the radius and diameter of the clique graph | 1996-03-24 | Paper |
| Weak-heap sort | 1995-11-14 | Paper |
| Changing and unchanging of the radius of a graph | 1995-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4301914 | 1994-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3139726 | 1994-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4039257 | 1994-06-09 | Paper |
| Extremal graphs domination insensitive to the removal of \(k\) edges | 1993-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028502 | 1993-03-28 | Paper |
| Theg-network and its inherent fault tolerant properties | 1992-09-27 | Paper |
| Edges in graphs with large girth | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3984530 | 1992-06-27 | Paper |
| A compilation of relations between graph invariants—supplement I | 1992-06-25 | Paper |
| Factor domination in graphs | 1990-01-01 | Paper |
| BOUNDS ON THE DOMINATION NUMBER OF A GRAPH | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3472128 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3472129 | 1990-01-01 | Paper |
| INGRID: A graph invariant manipulator | 1989-01-01 | Paper |
| On the size of graphs of a given bandwidth | 1989-01-01 | Paper |
| An extremal problem for edge domination insensitive graphs | 1988-01-01 | Paper |
| Vertex domination-critical graphs | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3829572 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4729819 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3472123 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3803157 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3820642 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4729815 | 1987-01-01 | Paper |
| Extension of a clique cover result to uniform hypergraphs | 1986-01-01 | Paper |
| Computationally efficient bounds for the Catalan numbers | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3762358 | 1986-01-01 | Paper |
| A compilation of relations between graph invariants | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3735729 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3791168 | 1985-01-01 | Paper |
| Bounds on graph spectra | 1984-01-01 | Paper |
| Upper bounds on the edge clique cover number of a graph | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3695292 | 1984-01-01 | Paper |
| A characterization of competition graphs | 1983-01-01 | Paper |
| On clique covers and independence numbers of graphs | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3313890 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3318779 | 1983-01-01 | Paper |
| Generalized k-tuple colorings of cycles and other graphs | 1982-01-01 | Paper |
| The complexity of a multiprocessor task assignment problem without deadlines | 1982-01-01 | Paper |
| Graphs which, with their complements, have certain clique covering numbers | 1981-01-01 | Paper |
| A new graph colouring algorithm | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3901552 | 1980-01-01 | Paper |
