| Publication | Date of Publication | Type |
|---|
| Edge searching and fast searching with constraints | 2024-03-01 | Paper |
| New results on the zero-visibility cops and robber game | 2024-02-23 | Paper |
| A better subgraph of the minimum weight triangulation | 2023-12-12 | Paper |
| Fast searching on \(k\)-combinable graphs | 2023-07-07 | Paper |
| Fast searching on cactus graphs | 2023-04-17 | Paper |
| Aggregating preferences represented by conditional preference networks | 2023-03-31 | Paper |
| One-visibility cops and robber on trees: optimal cop-win strategies | 2022-10-07 | Paper |
| A simple method for proving lower bounds in the zero-visibility cops and robber game | 2022-07-18 | Paper |
| Computing the one-visibility cop-win strategies for trees | 2022-06-29 | Paper |
| The one-cop-moves game on planar graphs | 2021-11-25 | Paper |
| Four-searchable biconnected outerplanar graphs | 2021-11-11 | Paper |
| One-visibility cops and robber on trees | 2021-10-06 | Paper |
| Computing the one-visibility copnumber of trees | 2021-07-05 | Paper |
| Properties of a \(q\)-analogue of zero forcing | 2021-02-16 | Paper |
| Correction to: ``Properties of a \(q\)-analogue of zero forcing | 2021-02-16 | Paper |
| Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph | 2021-01-14 | Paper |
| The one-cop-moves game on graphs with some special structures | 2020-11-06 | Paper |
| On a homogeneous recurrence relation for the determinants of general pentadiagonal Toeplitz matrices | 2020-10-11 | Paper |
| The one-cop-moves game on graphs of small treewidth | 2020-05-13 | Paper |
| Achievable multiplicity partitions in the inverse eigenvalue problem of a graph | 2020-02-26 | Paper |
| A partition approach to lower bounds for zero-visibility cops and robber | 2020-02-25 | Paper |
| Positive semidefinite zero forcing numbers of two classes of graphs | 2019-08-20 | Paper |
| Positive Zero Forcing and Edge Clique Coverings | 2019-04-26 | Paper |
| A New Lower Bound for Positive Zero Forcing | 2019-04-26 | Paper |
| The fast search number of a complete \(k\)-partite graph | 2018-10-18 | Paper |
| Ovoids of generalized quadrangles of order and Delsarte cocliques in related strongly regular graphs | 2018-10-05 | Paper |
| Compressed cliques graphs, clique coverings and positive zero forcing | 2018-06-05 | Paper |
| The cop number of the one-cop-moves game on planar graphs | 2018-03-26 | Paper |
| Infection in hypergraphs | 2018-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369550 | 2017-10-17 | Paper |
| Fast Searching on Cartesian Products of Graphs | 2017-05-19 | Paper |
| The fast search number of a Cartesian product of graphs | 2017-05-15 | Paper |
| Lower bounds for positive semidefinite zero forcing and their applications | 2017-03-03 | Paper |
| Fast Searching on Complete k-partite Graphs | 2017-02-01 | Paper |
| Triangulations without minimum-weight drawing | 2016-06-16 | Paper |
| On the complexity of the positive semidefinite zero forcing number | 2016-02-12 | Paper |
| Improved parameterized and exact algorithms for cut problems on trees | 2015-12-11 | Paper |
| The complexity of zero-visibility cops and robber | 2015-12-08 | Paper |
| Positive Semidefinite Zero Forcing: Complexity and Lower Bounds | 2015-10-30 | Paper |
| Algorithms for Cut Problems on Trees | 2015-09-11 | Paper |
| The Complexity of the Positive Semidefinite Zero Forcing | 2015-09-11 | Paper |
| The optimal capture time of the one-cop-moves game | 2015-06-11 | Paper |
| Zero-visibility cops and robber and the pathwidth of a graph | 2015-05-11 | Paper |
| A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING THE RESILIENCE OF ARRANGEMENTS OF RAY SENSORS | 2015-04-22 | Paper |
| Generalizing Labeled and Unlabeled Sample Compression to Multi-label Concept Classes | 2015-01-14 | Paper |
| Algebraic methods proving Sauer's bound for teaching complexity | 2014-10-31 | Paper |
| The Complexity of Zero-Visibility Cops and Robber | 2014-09-02 | Paper |
| On the approximability of the exemplar adjacency number problem for genomes with gene repetitions | 2014-08-26 | Paper |
| Zero-Visibility Cops and Robber Game on a Graph | 2014-04-03 | Paper |
| Fast-mixed searching and related problems on graphs | 2014-01-16 | Paper |
| Euclidean chains and their shortcuts | 2014-01-10 | Paper |
| Fast-Mixed Searching on Graphs | 2012-11-02 | Paper |
| Sauer’s Bound for a Notion of Teaching Complexity | 2012-10-16 | Paper |
| Fast searching games on graphs | 2012-04-04 | Paper |
| Parameterized complexity of even/odd subgraph problems | 2011-08-23 | Paper |
| Euclidean Chains and Their Shortcuts | 2011-08-12 | Paper |
| Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem | 2011-08-12 | Paper |
| On the red/blue spanning tree problem | 2011-05-18 | Paper |
| Fast edge searching and fast searching on graphs | 2011-03-14 | Paper |
| Fast Edge-Searching and Related Problems | 2011-01-10 | Paper |
| Parameterized Complexity of Even/Odd Subgraph Problems | 2010-05-28 | Paper |
| Lower Bounds on Fast Searching | 2009-12-17 | Paper |
| Sweeping graphs with large clique number | 2009-12-15 | Paper |
| Standard directed search strategies and their applications | 2009-07-10 | Paper |
| On the Red/Blue Spanning Tree Problem | 2009-06-03 | Paper |
| Lower Bounds on Edge Searching | 2009-03-03 | Paper |
| Searching Cycle-Disjoint Graphs | 2009-03-03 | Paper |
| Arc Searching Digraphs Without Jumping | 2009-03-03 | Paper |
| Monotonicity in digraph search problems | 2008-11-18 | Paper |
| Digraph searching, directed vertex separation and directed pathwidth | 2008-09-10 | Paper |
| On the Monotonicity of Weak Searching | 2008-07-10 | Paper |
| On the Fast Searching Problem | 2008-07-10 | Paper |
| Time constrained graph searching | 2008-06-24 | Paper |
| Searching Trees with Sources and Targets | 2008-06-19 | Paper |
| Non-breaking Similarity of Genomes with Gene Repetitions | 2008-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387690 | 2008-05-27 | Paper |
| Monotonicity of strong searching on digraphs | 2008-04-23 | Paper |
| Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance | 2008-04-15 | Paper |
| An Efficient Algorithm for Inference in Rough Set Flow Graphs | 2008-03-19 | Paper |
| Digraph Strong Searching: Monotonicity and Complexity | 2008-01-04 | Paper |
| Directed Searching Digraphs: Monotonicity and Complexity | 2007-11-13 | Paper |
| Strong-mixed searching and pathwidth | 2007-02-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing | 2006-11-01 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024785 | 2005-07-04 | Paper |
| Minimal tetrahedralizations of a class of polyhedra | 2004-11-22 | Paper |
| Detecting tetrahedralizations of a set of line segments | 2004-11-12 | Paper |
| Solution of an outstanding conjecture: the non-existence of universal cycles with \(k=n-2\) | 2002-12-02 | Paper |
| A lower bound for \(\beta\)-skeleton belonging to minimum weight triangulations | 2002-08-14 | Paper |
| Maximum weight triangulation and graph drawing | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766838 | 2002-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2728899 | 2001-11-06 | Paper |
| On some polyhedra covering problems | 2001-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525730 | 2001-01-24 | Paper |
| The class Steiner minimal tree problem: A lower bound and test problem generation | 2001-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3836909 | 2000-02-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4264789 | 1999-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4264911 | 1999-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218404 | 1999-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4382879 | 1998-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4397456 | 1998-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4388600 | 1998-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3124914 | 1997-05-20 | Paper |
| A successive quadratic programming method that uses new corrections for search directions | 1997-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4876308 | 1996-09-26 | Paper |
| A recursive quadric programming algorithm that uses new nondifferentiable penalty functions | 1994-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4302568 | 1994-09-27 | Paper |
