| Publication | Date of Publication | Type |
|---|
| The equivalence of the Szemerédi and Petruska conjecture and the maximum order of 3-uniform \(\tau\)-critical hypergraphs | 2023-08-02 | Paper |
| An asymptotic resolution of a conjecture of Szemerédi and Petruska | 2023-05-31 | Paper |
| Systems of overlap representation for families of intervals | 2022-03-15 | Paper |
| Reduction formulas for higher order derivations and a hypergeometric identity | 2021-12-06 | Paper |
| Path-pairability of infinite planar grids | 2021-11-27 | Paper |
| The Szemerédi-Petruska conjecture for a few small values | 2021-11-24 | Paper |
| Eckhoff's problem on convex sets in the plane | 2021-08-27 | Paper |
| Minimal 2-connected graphs satisfying the even cut condition | 2021-03-11 | Paper |
| All minor-minimal apex obstructions with connectivity two | 2021-01-29 | Paper |
| Note on the bisection width of cubic graphs | 2020-08-31 | Paper |
| Petruska's question on planar convex sets | 2020-07-08 | Paper |
| On path-pairability of the finite grids | 2019-11-27 | Paper |
| The path-pairability number of product of stars | 2019-07-04 | Paper |
| On a conjecture of Szemer\'edi and Petruska | 2019-04-09 | Paper |
| Linkage on the infinite grid | 2018-06-15 | Paper |
| The minimum size of graphs satisfying cut conditions | 2018-02-22 | Paper |
| The $6\times 6$ grid is $4$-path-pairable | 2017-08-17 | Paper |
| Escaping from a quadrant of the $6\times 6$ grid by edge disjoint paths | 2017-08-17 | Paper |
| Escaping from the corner of a grid by edge disjoint paths | 2017-08-17 | Paper |
| Detour trees | 2016-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2951140 | 2015-10-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4982948 | 2015-04-13 | Paper |
| Connected matchings in chordal bipartite graphs | 2015-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5412360 | 2014-04-25 | Paper |
| Ramsey functions for quasi-progressions with large diameter | 2013-07-30 | Paper |
| Generalized Schur numbers for \(x_1+ x_2+ c= 3x_3\) | 2010-03-26 | Paper |
| On the editing distance of graphs | 2008-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3433939 | 2007-04-23 | Paper |
| Odd cycles and \(\Theta\)-cycles in hypergraphs | 2006-10-30 | Paper |
| \(\rho\)-valuations for some stunted trees | 2006-10-30 | Paper |
| Polynomials that Vanish on Distinct $n$ th Roots of Unity | 2004-09-07 | Paper |
| Heavy transversals and indecomposable hypergraphs | 2004-09-07 | Paper |
| A finite basis characterization of alpha-split colorings | 2002-12-02 | Paper |
| A proof of Hougardy's conjecture for diamond-free graphs | 2002-07-22 | Paper |
| Distinct Sums Modulo n and Tree Embeddings | 2002-05-14 | Paper |
| Isomorphisms involving reversing arcs of digraphs | 2002-04-08 | Paper |
| Generalized triangle inequalities in \(\mathbb{R}^n\) | 2002-03-11 | Paper |
| Scenic graphs. I: Traceable graphs | 2001-06-10 | Paper |
| Clique covering the edges of a locally cobipartite graph | 2000-06-21 | Paper |
| Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling | 2000-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4262254 | 1999-11-03 | Paper |
| Recognizing intersection graphs of linear uniform hypergraphs | 1998-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4390687 | 1998-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4393240 | 1998-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4383890 | 1998-04-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4352333 | 1998-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4378526 | 1998-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4378523 | 1998-03-05 | Paper |
| On extensions of a conjecture of Gallai | 1997-08-12 | Paper |
| Partitioning permutations into increasing and decreasing subsequences | 1996-02-26 | Paper |
| The poset on connected induced subgraphs of a graph need not be Sperner | 1995-12-20 | Paper |
| The 2‐intersection number of paths and bounded‐degree trees | 1995-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763420 | 1995-04-11 | Paper |
| Do 3n − 5 edges force a subdivision ofK5? | 1992-06-26 | Paper |
| Wide posets with fixed height and cutset number | 1990-01-01 | Paper |
