| Publication | Date of Publication | Type |
|---|
| Secretary problem with hidden information; searching for a high merit candidate | 2022-12-28 | Paper |
| Tail probabilities of a random walk on an interval | 2022-05-23 | Paper |
| Total chromatic sum for trees | 2021-12-08 | Paper |
| An optimal algorithm for stopping on the element closest to the center of an interval | 2021-11-19 | Paper |
| Boundary-type sets in maximal outerplanar graphs | 2021-05-19 | Paper |
| Maximizing survival time in a random walk on an interval | 2018-05-28 | Paper |
| Total colorings of graphs with minimum sum of colors | 2017-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5500317 | 2015-08-05 | Paper |
| Chromatic sums for colorings avoiding monochromatic subgraphs | 2015-08-04 | Paper |
| Global properties of graphs with local degree conditions | 2015-06-12 | Paper |
| An efficient algorithm for stopping on a sink in a directed graph | 2014-05-14 | Paper |
| How to choose the best twins | 2012-08-22 | Paper |
| Choosing Rarity: An Exercise in Stopping Times | 2011-12-07 | Paper |
| On domination and reinforcement numbers in trees | 2008-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3433922 | 2007-04-23 | Paper |
| Counting chains and antichains in the complete binary tree. | 2007-03-29 | Paper |
| The step domination number of a graph | 2006-12-18 | Paper |
| Sphere-of-influence graphs on a sphere. | 2006-06-26 | Paper |
| Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case | 2006-06-01 | Paper |
| An asymptotic ratio in the complete binary tree | 2004-03-15 | Paper |
| Patch colorings and rigid colorings of the rational \(n\)-space | 2002-12-10 | Paper |
| A Ratio Inequality for Binary Trees and the Best Secretary | 2002-10-21 | Paper |
| Attainable results in committee elections. | 2002-05-05 | Paper |
| Totally positive matrices and totally positive hypergraphs | 2002-02-12 | Paper |
| Between packable and arbitrarily packable graphs: Packer-spoiler games | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4487461 | 2001-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4943528 | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940050 | 2000-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4390687 | 1998-08-10 | Paper |
| Graph similarity and distance in graphs | 1998-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4387723 | 1998-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375746 | 1998-04-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4352333 | 1998-04-01 | Paper |
| Steiner intervals in graphs | 1998-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5283998 | 1997-03-09 | Paper |
| The asymptotic plurality rule for molecular sequences | 1996-07-15 | Paper |
| An algorithm to find agreement subtrees | 1995-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4326920 | 1995-06-11 | Paper |
| The agreement metric for labeled binary trees | 1994-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4304567 | 1994-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3139538 | 1994-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3139714 | 1993-11-18 | Paper |
| Planar graphs and greatest common subgraphs | 1993-10-28 | Paper |
| The irregularity cost or sum of a graph | 1993-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028480 | 1993-03-28 | Paper |
| On multipartite tournaments | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3976626 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3976605 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3972510 | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3469131 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3472127 | 1990-01-01 | Paper |
| On a modified game of Sierpiński | 1987-01-01 | Paper |
| On a game of Sierpiński | 1987-01-01 | Paper |
