| Publication | Date of Publication | Type |
|---|
| Monochromatic graph decompositions inspired by anti-Ramsey colorings | 2025-01-27 | Paper |
| Hypercycle systems from semi-parallel classes | 2024-11-28 | Paper |
| Covering the edges of a graph with triangles | 2024-11-09 | Paper |
| Connected Turán number of trees | 2024-10-15 | Paper |
| Optimal strategies in fractional games: vertex cover and domination | 2024-10-10 | Paper |
| Counting connected partitions of graphs | 2024-09-16 | Paper |
| The robust chromatic number of graphs | 2024-09-04 | Paper |
| Indicated domination game | 2024-06-11 | Paper |
| Some exact results for regular Turán problems for all large orders | 2024-01-23 | Paper |
| Spectrum of 3-uniform 6- and 9-cycle systems over \(K_v^{( 3 )} - I\) | 2024-01-17 | Paper |
| Rankings of graphs | 2024-01-05 | Paper |
| The k‐path vertex cover: General bounds and chordal graphs | 2023-12-12 | Paper |
| Realization of digraphs in Abelian groups and its consequences | 2023-10-05 | Paper |
| Vector sum-intersection theorems | 2023-07-19 | Paper |
| The board packing problem | 2023-07-10 | Paper |
| Connected domination in random graphs | 2023-07-03 | Paper |
| The bin covering with delivery problem, extended investigations for the online case | 2023-06-22 | Paper |
| Extremal graph theoretic questions for q-ary vectors | 2023-05-03 | Paper |
| The robust chromatic number of graphs | 2023-05-03 | Paper |
| The robust chromatic number of certain graph classes | 2023-05-03 | Paper |
| Guillotine cutting is asymptotically optimal for packing consecutive squares | 2022-11-01 | Paper |
| Counting Connected Partitions of Graphs | 2022-10-20 | Paper |
| Connected Tur\'an number of trees | 2022-08-12 | Paper |
| Singular Turán numbers and worm-colorings | 2022-07-26 | Paper |
| Saturation problems with regularity constraints | 2022-05-27 | Paper |
| Distance Domination in Vertex Partitioned Graphs | 2022-05-09 | Paper |
| On saturation of Berge hypergraphs | 2022-04-07 | Paper |
| Strong edge coloring of Cayley graphs and some product graphs | 2022-03-15 | Paper |
| Complex uniformly resolvable decompositions of K_v | 2021-11-30 | Paper |
| An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time | 2021-07-22 | Paper |
| \( \mathbb{Z}_2 \times \mathbb{Z}_2\)-cordial cycle-free hypergraphs | 2021-07-21 | Paper |
| Comparison of sum choice number with chromatic sum | 2021-06-14 | Paper |
| Aspects of upper defensive alliances | 2021-05-19 | Paper |
| The domination number of the graph defined by two levels of the \(n\)-cube | 2021-05-19 | Paper |
| Optimal strategies in fractional games: vertex cover and domination | 2021-05-09 | Paper |
| Precoloring Extension. IV. General Bounds and List Colorings | 2021-04-01 | Paper |
| On specific factors in graphs | 2021-02-16 | Paper |
| The domination number of the graph defined by two levels of the \(n\)-cube. II | 2021-02-08 | Paper |
| Regular Tur\'an numbers | 2020-12-10 | Paper |
| On Grundy total domination number in product graphs | 2020-12-08 | Paper |
| On caterpillar factors in graphs | 2020-11-06 | Paper |
| The equal–sum–free subset problem | 2020-10-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3300708 | 2020-07-29 | Paper |
| Independent \((k + 1)\)-domination in \(k\)-trees | 2020-07-07 | Paper |
| Clique coverings and claw-free graphs | 2020-06-16 | Paper |
| The variety of domination games | 2019-11-22 | Paper |
| Disjoint paired-dominating sets in cubic graphs | 2019-11-06 | Paper |
| Fractional domination game | 2019-10-14 | Paper |
| Mixed hypergraphs and beyond | 2019-10-02 | Paper |
| Tight lower bounds for semi-online scheduling on two uniform machines with known optimum | 2019-09-02 | Paper |
| Safe sets, network majority on weighted trees | 2019-08-12 | Paper |
| Singular Ramsey and Turán numbers | 2019-07-22 | Paper |
| Using weight decision for decreasing the price of anarchy in selfish bin packing games | 2019-06-25 | Paper |
| Improved bounds for batch scheduling with nonidentical job sizes | 2019-05-02 | Paper |
| Finding a potential community in networks | 2019-04-23 | Paper |
| Domination game on uniform hypergraphs | 2019-03-22 | Paper |
| Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs | 2019-02-14 | Paper |
| Restricted assignment scheduling with resource constraints | 2019-01-25 | Paper |
| Bin packing games with weight decision: how to get a small value for the price of anarchy | 2019-01-15 | Paper |
| Safe sets in graphs: graph classes and structural parameters | 2018-12-06 | Paper |
| Partition-Crossing Hypergraphs | 2018-09-03 | Paper |
| Optimal multi-TDMA scheduling in ring topology networks | 2018-08-27 | Paper |
| Tight upper bounds for semi-online scheduling on two uniform machines with known optimum | 2018-06-15 | Paper |
| Grundy dominating sequences and zero forcing sets | 2018-05-24 | Paper |
| Extended bicolorings of Steiner triple systems of order \(2^{h}-1\) | 2018-05-23 | Paper |
| A general bin packing game: interest taken into account | 2018-05-18 | Paper |
| Tropical dominating sets in vertex-coloured graphs | 2018-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4634386 | 2018-04-10 | Paper |
| Tropical matchings in vertex-colored graphs | 2018-04-09 | Paper |
| Graph labeling games | 2018-01-04 | Paper |
| Multiprofessor scheduling | 2017-12-20 | Paper |
| A note on the polytope of bipartite TSP | 2017-12-06 | Paper |
| Computing all possible graph structures describing linearly conjugate realizations of kinetic systems | 2017-11-30 | Paper |
| A combinatorial problem related to sparse systems of equations | 2017-09-15 | Paper |
| \(F\)-WORM colorings: results for 2-connected graphs | 2017-09-12 | Paper |
| Coloring the cliques of line graphs | 2017-09-05 | Paper |
| The minimum number of vertices in uniform hypergraphs with given domination number | 2017-09-05 | Paper |
| On the Complexity of Finding a Potential Community | 2017-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5279158 | 2017-07-19 | Paper |
| Asymptotically optimal induced decompositions | 2017-03-14 | Paper |
| Network majority on tree topological network | 2017-02-13 | Paper |
| Safe Sets in Graphs: Graph Classes and Structural Parameters | 2017-02-01 | Paper |
| Dominating sequences in grid-like and toroidal graphs | 2017-01-18 | Paper |
| When the vertex coloring of a graph is an edge coloring of its line graph -- a rare coincidence. | 2016-10-26 | Paper |
| An application of combinatorics in cryptography | 2016-10-14 | Paper |
| Bounds on the game transversal number in hypergraphs | 2016-10-12 | Paper |
| Hypergraph colouring | 2016-09-30 | Paper |
| Colouring games | 2016-09-30 | Paper |
| Transversal game on hypergraphs and the \(\frac{3}{4}\)-conjecture on the total domination game | 2016-09-22 | Paper |
| \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum | 2016-07-13 | Paper |
| New models of graph-bin packing | 2016-07-05 | Paper |
| Circular coloring of graphs via linear programming and tabu search | 2016-07-04 | Paper |
| Maximum number of colors in hypertrees of bounded degree | 2016-07-04 | Paper |
| Bin covering with a general profit function: approximability results | 2016-06-29 | Paper |
| Induced cycles in triangle graphs | 2016-06-21 | Paper |
| A 13/12 approximation algorithm for bin packing with extendable bins | 2016-06-09 | Paper |
| Transversal designs and induced decompositions of graphs | 2016-05-25 | Paper |
| Tropical dominating sets in vertex-coloured graphs | 2016-05-03 | Paper |
| The disjoint domination game | 2016-04-27 | Paper |
| Generalized line graphs: Cartesian products and complexity of recognition | 2015-11-02 | Paper |
| Bin Packing Game with an Interest Matrix | 2015-10-29 | Paper |
| Some properties of vertex-oblique graphs | 2015-10-08 | Paper |
| Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling | 2015-08-24 | Paper |
| Offline black and white bin packing | 2015-07-24 | Paper |
| Maximum uniformly resolvable decompositions of \(K_v\) and \(K_v - I\) into 3-stars and 3-cycles | 2015-06-01 | Paper |
| Approximability of the upper chromatic number of hypergraphs | 2015-06-01 | Paper |
| Turán numbers and batch codes | 2015-05-22 | Paper |
| Online results for black and white bin packing | 2015-05-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5248308 | 2015-05-06 | Paper |
| Distance-constrained labeling of complete trees | 2015-04-29 | Paper |
| Speeding up deciphering by hypergraph ordering | 2015-03-30 | Paper |
| Minimum order of graphs with given coloring parameters | 2015-01-23 | Paper |
| Induced Decompositions of Highly Dense Graphs | 2015-01-21 | Paper |
| Orientations of graphs with prescribed weighted out-degrees | 2015-01-20 | Paper |
| Minimum number of affine simplices of given dimension | 2014-11-28 | Paper |
| Total transversals and total domination in uniform hypergraphs | 2014-09-04 | Paper |
| Uniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphs | 2014-08-08 | Paper |
| Equality of domination and transversal numbers in hypergraphs | 2014-04-22 | Paper |
| Relaxations of Hall’s Condition: Optimal batch codes with multiple queries | 2014-02-07 | Paper |
| Cordial labeling of hypertrees | 2014-01-24 | Paper |
| Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\) | 2014-01-13 | Paper |
| Choice-perfect graphs | 2013-12-13 | Paper |
| Color-bounded hypergraphs. VI: Structural and functional jumps in complexity | 2013-12-06 | Paper |
| Problems on cycles and colorings | 2013-12-06 | Paper |
| Color the cycles | 2013-12-06 | Paper |
| Bin packing with ``largest in bottom constraint: tighter bounds and generalizations | 2013-12-02 | Paper |
| Combinatorial batch codes: extremal problems under Hall-type conditions | 2013-11-01 | Paper |
| Decompositions of plane graphs under parity constrains given by faces | 2013-10-31 | Paper |
| Black and White Bin Packing | 2013-09-13 | Paper |
| \([1,1,t]\)-colorings of complete graphs | 2013-07-19 | Paper |
| Colorability of mixed hypergraphs and their chromatic inversions | 2013-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4913435 | 2013-04-05 | Paper |
| Small edge sets meeting all triangles of a graph | 2012-12-27 | Paper |
| List colorings of \(K_5\)-minor-free graphs with special list assignments | 2012-09-12 | Paper |
| Proper connection of graphs | 2012-08-10 | Paper |
| Distance domination versus iterated domination | 2012-08-10 | Paper |
| Vertex coloring without large polychromatic stars | 2012-07-04 | Paper |
| The most vital nodes with respect to independent set and vertex cover | 2012-04-30 | Paper |
| Maximum number of colors: C-coloring and related problems | 2012-04-12 | Paper |
| THE GRAPH-BIN PACKING PROBLEM | 2012-03-13 | Paper |
| 3-consecutive edge coloring of a graph | 2012-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3106220 | 2011-12-19 | Paper |
| Transversals and domination in uniform hypergraphs | 2011-11-29 | Paper |
| Optimal batch codes: many items or low retrieval requirement | 2011-11-03 | Paper |
| Color-bounded hypergraphs, V: host graphs and subdivisions | 2011-08-24 | Paper |
| Complexity and approximation of the constrained forest problem | 2011-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3012388 | 2011-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3011760 | 2011-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3001210 | 2011-05-31 | Paper |
| Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures | 2011-05-19 | Paper |
| 3-consecutive C-colorings of graphs | 2011-05-09 | Paper |
| Learning of winning strategies for terminal games with linear-size memory | 2011-05-05 | Paper |
| Finding weakly reversible realizations of chemical reaction networks using optimization | 2011-03-24 | Paper |
| Computing weakly reversible realizations of chemical reaction networks | 2011-03-15 | Paper |
| Improper C-colorings of graphs | 2011-03-09 | Paper |
| Optimal guard sets and the Helly property | 2010-11-22 | Paper |
| C-perfect hypergraphs | 2010-11-10 | Paper |
| Approximation algorithms for the minimum rainbow subgraph problem | 2010-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3581671 | 2010-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3575455 | 2010-07-27 | Paper |
| Groupies in random graphs | 2010-06-16 | Paper |
| Satisfactory graph partition, variants, and generalizations | 2010-06-11 | Paper |
| Geometric representation for semi on-line scheduling on uniform processors | 2010-05-21 | Paper |
| Infinite versus finite graph domination | 2010-05-05 | Paper |
| Color-bounded hypergraphs, IV: Stable colorings of hypertrees | 2010-05-05 | Paper |
| Smallest set-transversals of \(k\)-partitions | 2010-05-05 | Paper |
| Hall number for list colorings of graphs: Extremal results | 2010-03-29 | Paper |
| Hypergraph domination and strong independence | 2010-01-12 | Paper |
| Covering a graph with a constrained forest (extended abstract) | 2009-12-17 | Paper |
| On list critical graphs | 2009-12-15 | Paper |
| Color-bounded hypergraphs. I: General results | 2009-12-15 | Paper |
| Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees | 2009-12-15 | Paper |
| Color-bounded hypergraphs, III: model comparison | 2009-12-03 | Paper |
| Semi on-line scheduling on three processors with known sum of the tasks | 2009-08-28 | Paper |
| Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs | 2009-08-20 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Some complexity problems on single input double output controllers | 2009-06-30 | Paper |
| Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3 | 2009-05-13 | Paper |
| On rainbow connection | 2009-04-07 | Paper |
| A minimax problem for set system | 2009-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3509409 | 2008-07-01 | Paper |
| Approximation of satisfactory bisection problems | 2008-06-26 | Paper |
| Upper chromatic number of finite projective planes | 2008-06-05 | Paper |
| New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks | 2008-05-27 | Paper |
| Uniform mixed hypergraphs: the possible numbers of colors | 2008-04-16 | Paper |
| Semi-online scheduling on two uniform processors | 2008-04-15 | Paper |
| A class of Steiner systems \(S(2,4,v)\) with arcs of extremal size | 2008-02-28 | Paper |
| The cost chromatic number and hypergraph parameters | 2008-01-18 | Paper |
| The on-line multiprocessor scheduling problem with known sum of the tasks | 2007-12-20 | Paper |
| Lower bound on the profile of degree pairs in cross-intersecting set systems | 2007-11-12 | Paper |
| Orderings of uniquely colorable hypergraphs | 2007-07-19 | Paper |
| On-line arbitrarily vertex decomposable trees | 2007-07-19 | Paper |
| Efficient algorithms for decomposing graphs under degree constraints | 2007-05-30 | Paper |
| Mixed colorings of hypergraphs | 2007-05-29 | Paper |
| Extremal jumps of the Hall number | 2007-05-29 | Paper |
| Largest non-unique subgraphs | 2007-05-24 | Paper |
| Steiner system and large non-Hamiltonian hypergraphs | 2007-05-09 | Paper |
| Game list colouring of graphs | 2007-03-23 | Paper |
| Characterization of graphs dominated by induced paths | 2007-03-02 | Paper |
| Highly connected counterexamples to a conjecture on α -domination | 2006-10-16 | Paper |
| The satisfactory partition problem | 2006-06-30 | Paper |
| Degree-constrained decompositions of graphs: Bounded treewidth and planarity | 2006-04-28 | Paper |
| List version of \(L(d,s)\)-labelings | 2006-03-20 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Dominating Bipartite Subgraphs in Graphs | 2005-09-12 | Paper |
| Graph Domination in Distance Two | 2005-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5462155 | 2005-08-01 | Paper |
| The cover pebbling number of graphs | 2005-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5461526 | 2005-07-26 | Paper |
| Graphs without induced P5and C5 | 2005-04-19 | Paper |
| Local Anti-Ramsey Numbers of Graphs | 2005-03-08 | Paper |
| Strong branchwidth and local transversals | 2005-02-22 | Paper |
| Semi-on-line scheduling on two parallel processors with an upper bound on the items | 2005-02-11 | Paper |
| Partition of \(C_4\)-designs into minimum and maximum number of \(P_3\)-designs | 2005-01-20 | Paper |
| On short cycles through prescribed vertices of a graph | 2004-10-01 | Paper |
| Schttes Tournament Problem and Intersecting Families of Sets | 2004-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448764 | 2004-02-18 | Paper |
| Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types | 2003-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4405635 | 2003-09-05 | Paper |
| Domination in partitioned graphs | 2003-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414507 | 2003-07-25 | Paper |
| Marking games and the oriented game chromatic number of partial \(k\)-trees | 2003-07-08 | Paper |
| On the complexity of bicoloring clique hypergraphs of graphs | 2003-05-14 | Paper |
| Strict colorings of Steiner triple and quadruple systems: A survey | 2003-03-16 | Paper |
| Distance graphs with finite chromatic number | 2002-12-10 | Paper |
| A note on planar 5-list colouring: Non-extendability at distance 4 | 2002-08-29 | Paper |
| Oriented list colorings of graphs | 2002-08-28 | Paper |
| Reconstruction graphs and testing their properties in a relational spatial database | 2002-08-15 | Paper |
| Efficient approximation algorithms for the subset-sums equality problem. | 2002-08-04 | Paper |
| The chromatic spectrum of mixed hypergraphs | 2002-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4532751 | 2002-07-14 | Paper |
| Uniquely colorable mixed hypergraphs | 2002-05-28 | Paper |
| Minimally non-preperfect graphs of small maximum degree | 2002-05-20 | Paper |
| Sharpness of some intersection theorems | 2001-10-30 | Paper |
| Heredity properties of connectedness in edge-coloured complete graphs | 2001-10-23 | Paper |
| Chromatic spectrum is broken | 2001-09-23 | Paper |
| Ramsey numbers for tournaments | 2001-08-20 | Paper |
| Capelli polynomials, almost-permutation matrices and sparse Eulerian graphs. | 2001-07-05 | Paper |
| Remarks on the existence of uniquely partitionable planar graphs | 2001-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4518396 | 2000-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4489145 | 2000-11-22 | Paper |
| Complexity of choosing subsets from color sets | 2000-11-02 | Paper |
| On-line rankings of graphs | 2000-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952596 | 2000-10-16 | Paper |
| Uncolorable mixed hypergraphs | 2000-09-05 | Paper |
| Extremal bi-Helly families | 2000-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940074 | 2000-03-01 | Paper |
| On light cycles in plane triangulations | 2000-02-13 | Paper |
| Disjoint blocking sets in cycle systems | 2000-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263476 | 2000-01-03 | Paper |
| Rankings of Directed Graphs | 1999-11-23 | Paper |
| Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality | 1999-09-02 | Paper |
| On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs | 1999-08-31 | Paper |
| On-line approximation algorithms for scheduling tasks on identical machines with extendable working time | 1999-06-10 | Paper |
| A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors: Short communication: Special issue on task sheduling problems on parallel and distributed systems | 1999-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400814 | 1999-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4233832 | 1999-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232782 | 1999-03-15 | Paper |
| Generalized colorings and avoidable orientations | 1999-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4227911 | 1999-02-02 | Paper |
| Semi on-line algorithms for the partition problem | 1998-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4221912 | 1998-12-02 | Paper |
| Upper chromatic number of Steiner triple and quadruple systems | 1998-11-26 | Paper |
| Strict colouring for classes of Steiner triple systems | 1998-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4219034 | 1998-11-15 | Paper |
| Graph colorings with local constraints -- a survey | 1998-11-08 | Paper |
| Brooks-type theorems for choosability with separation | 1998-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4390702 | 1998-05-26 | Paper |
| Rankings of Graphs | 1998-05-11 | Paper |
| The color cost of a caterpillar | 1998-05-06 | Paper |
| Zero‐sum block designs and graph labelings | 1998-04-20 | Paper |
| List colorings and reducibility | 1998-01-28 | Paper |
| Choosability and fractional chromatic numbers | 1997-12-02 | Paper |
| A weighted generalization of Tur�n's theorem | 1997-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347897 | 1997-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4344452 | 1997-07-15 | Paper |
| Efficiency and effectiveness of normal schedules on three dedicated processors | 1997-06-10 | Paper |
| Hamiltonian properties of Toeplitz graphs | 1997-06-09 | Paper |
| Comparability graph augmentation for some multiprocessor scheduling problems | 1997-04-21 | Paper |
| Solving systems of linear equations over lie nilpotent rings | 1997-03-31 | Paper |
| Ramsey-remainder | 1997-03-23 | Paper |
| Covering and independence in triangle structures | 1997-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5284571 | 1997-02-17 | Paper |
| Minimal colorings for properly colored subgraphs | 1997-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4888118 | 1996-12-09 | Paper |
| The forwarding index of directed networks | 1996-10-09 | Paper |
| Precoloring Extension III: Classes of Perfect Graphs | 1996-09-29 | Paper |
| Small transversals in uniform hypergraphs | 1996-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4878671 | 1996-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4877597 | 1996-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4882474 | 1996-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871079 | 1996-07-17 | Paper |
| The irregularity strength and cost of the union of cliques | 1996-07-02 | Paper |
| Cycle-saturated graphs of minimum size | 1996-07-02 | Paper |
| Stronger bounds for generalized degress and Menger path systems | 1996-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4840774 | 1996-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4865523 | 1996-02-25 | Paper |
| Searching for acyclic orientations of graphs | 1996-02-12 | Paper |
| Degree Sums and Covering Cycles | 1996-01-01 | Paper |
| The expected relative error of the polyhedral approximation of the max- cut problem | 1995-10-25 | Paper |
| Perfect Triangle Families | 1995-10-23 | Paper |
| How to make a random graph irregular | 1995-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4323132 | 1995-09-12 | Paper |
| 4-chromatic graphs with large odd girth | 1995-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4838466 | 1995-07-12 | Paper |
| The acyclic orientation game on random graphs | 1995-05-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4326650 | 1995-03-22 | Paper |
| Small representations of the relation algebra \(\mathcal E_{n+1}(1,2,3)\) | 1995-02-22 | Paper |
| Packing problems in edge-colored graphs | 1995-02-14 | Paper |
| Bipartite Subgraphs of Triangle-Free Graphs | 1995-02-13 | Paper |
| Characterization of \((m,1)\)-transitive and \((3,2)\)-transitive semi- complete directed graphs | 1995-02-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4320452 | 1995-02-01 | Paper |
| Inequalities for minimal covering sets in set systems of given rank | 1994-12-01 | Paper |
| Local and global average degree in graphs and multigraphs | 1994-11-30 | Paper |
| Largest size and union of Helly families | 1994-11-14 | Paper |
| The spectrum of \(\lambda\)-times repeated blocks for \(\text{TS}(v,\lambda)\) | 1994-11-06 | Paper |
| Eulerian polynomial identities on matrix rings | 1994-10-24 | Paper |
| Blocking Sets in SQS(2v) | 1994-10-24 | Paper |
| Intersection dimensions of graph classes | 1994-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4278353 | 1994-09-20 | Paper |
| Algorithmic complexity of list colorings | 1994-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3139750 | 1994-06-28 | Paper |
| Menger-type theorems with restrictions on path lengths | 1994-06-12 | Paper |
| Two graph-colouring games | 1994-05-30 | Paper |
| Large \(s\)-representable set systems with low maximum degree | 1994-05-24 | Paper |
| On conjectures of Berge and Chvátal | 1994-05-24 | Paper |
| Bounded degrees and prescribed distances in graphs | 1994-05-05 | Paper |
| ON k-LOCAL AND k-MEAN COLORINGS OF GRAPHS AND HYPERGRAPHS | 1994-05-05 | Paper |
| Monochromatic coverings and tree Ramsey numbers | 1994-05-05 | Paper |
| Linear-Time Approximation Algorithms for the Max Cut Problem | 1994-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3137219 | 1994-04-06 | Paper |
| Domination properties and induced subgraphs | 1994-03-17 | Paper |
| The Number of Maximal Independent Sets in Triangle-Free Graphs | 1994-01-12 | Paper |
| An upper bound on the number of cliques in a graph | 1993-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4693370 | 1993-08-17 | Paper |
| Algorithmic Aspects of Neighborhood Numbers | 1993-06-29 | Paper |
| Graphs with no induced \(C_ 4\) and \(2K_ 2\) | 1993-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036779 | 1993-05-18 | Paper |
| One More Occurrence of Variables Makes Satisfiability Jump from Trivial to NP-Complete | 1993-05-16 | Paper |
| Helly property in finite set systems | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028414 | 1993-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028415 | 1993-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028456 | 1993-03-28 | Paper |
| Asymptotic growth of sparse saturated structures is locally determined | 1993-01-17 | Paper |
| Covering the cliques of a graph with vertices | 1993-01-17 | Paper |
| Perfect couples of graphs | 1993-01-16 | Paper |
| Multipartite Turán problem for connected graphs and hypergraphs | 1993-01-01 | Paper |
| Nearly uniform distribution of edges amongk-subgraphs of a graph | 1992-12-17 | Paper |
| Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets | 1992-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4011737 | 1992-09-27 | Paper |
| Saturated \(r\)-uniform hypergraphs | 1992-06-28 | Paper |
| Narrowness, pathwidth, and their application in natural language processing | 1992-06-28 | Paper |
| Rainbow subgraphs in properly edge‐colored graphs | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3990593 | 1992-06-28 | Paper |
| Dissections into equilateral triangles | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3984228 | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3983109 | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3984533 | 1992-06-27 | Paper |
| Extensions of Gallai's graph covering theorems for uniform hypergraphs | 1992-06-26 | Paper |
| Asymptotic results on saturated graphs | 1992-06-25 | Paper |
| Perfect graph decompositions | 1992-06-25 | Paper |
| Covering all cliques of a graph | 1992-06-25 | Paper |
| Improved lower bounds on k‐independence | 1992-06-25 | Paper |
| Dominating cliques in \(P_ 5\)-free graphs | 1992-06-25 | Paper |
| Decompositions of regular bipartite graphs | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4711897 | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4713034 | 1992-06-25 | Paper |
| Graph coloring in linear time | 1992-01-01 | Paper |
| A periodic division pattern that cannot be generated by D0L systems | 1991-01-01 | Paper |
| Local constraints ensuring small representing sets | 1991-01-01 | Paper |
| Clique-transversal sets of line graphs and complements of line graphs | 1991-01-01 | Paper |
| Erratum volume 50, number 2 (1990): Peter Horák, ``A coloring problem related to the Erdős-Faber-Lovász conjecture, pp. 321-322 | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3197338 | 1991-01-01 | Paper |
| Hypergraph coverings and local colorings | 1991-01-01 | Paper |
| Periodic string division generated by deterministic L systems | 1990-01-01 | Paper |
| Self-generating hexagonal cell division patterns | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5202210 | 1990-01-01 | Paper |
| Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments | 1990-01-01 | Paper |
| The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree | 1990-01-01 | Paper |
| A conjecture on triangles of graphs | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3472148 | 1990-01-01 | Paper |
| A characterization of graphs without long induced paths | 1990-01-01 | Paper |
| Contractions and minimal k-colorability | 1990-01-01 | Paper |
| A coloring problem related to the Erdős, Faber, Lovasz conjecture | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5750908 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3828028 | 1989-01-01 | Paper |
| Radius, diameter, and minimum degree | 1989-01-01 | Paper |
| Induced matchings in bipartite graphs | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5750884 | 1989-01-01 | Paper |
| Langford strings are square-free | 1989-01-01 | Paper |
| Minimum number of elements of representing a set system of given rank | 1989-01-01 | Paper |
| On the maximum number of qualitative independent partitions | 1989-01-01 | Paper |
| Sub-Ramsey numbers of arithmetic progressions | 1989-01-01 | Paper |
| Decompositions of partially ordered sets into chains and antichains of given size | 1988-01-01 | Paper |
| Isomorphism of two infinite-chromatic triangle-free graphs | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3812267 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3211348 | 1988-01-01 | Paper |
| Inequalities for two set systems with prescribed intersections | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3794217 | 1987-01-01 | Paper |
| On two intersecting set systems and k-continuous Boolean functions | 1987-01-01 | Paper |
| On the context-free production complexity of finite languages | 1987-01-01 | Paper |
| Linear upper bounds for local Ramsey numbers | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5203068 | 1987-01-01 | Paper |
| An upper bound on the Ramsey number of trees | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798697 | 1987-01-01 | Paper |
| Another extremal property of some Turán graphs | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3777480 | 1987-01-01 | Paper |
| Maximum bipartite subgraphs of Kneser graphs | 1987-01-01 | Paper |
| Neighborhood perfect graphs | 1986-01-01 | Paper |
| Saturated graphs with minimal number of edges | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3774942 | 1986-01-01 | Paper |
| Hypergraphs without a large star | 1985-01-01 | Paper |
| On color critical graphs | 1985-01-01 | Paper |
| Critical hypergraphs and interesting set-pair systems | 1985-01-01 | Paper |
| Helly-type hypergraphs and Sperner families | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3708835 | 1984-01-01 | Paper |
| Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3218168 | 1983-01-01 | Paper |
| Upper bound for transversals of tripartite hypergraphs | 1982-01-01 | Paper |
| Worst-case behavior of string-searching algorithms | 1982-01-01 | Paper |
| Triangle-free partial graphs and edge covering theorems | 1982-01-01 | Paper |
| Ensembles d'articulation d'un graphe \(\gamma\)-critique | 1980-01-01 | Paper |
| Induced subtrees in graphs of large chromatic number | 1980-01-01 | Paper |
| Indicated domination game | N/A | Paper |
| Edge mappings of graphs: Ramsey type parameters | N/A | Paper |
| Edge mappings of graphs: Tur\'an type parameters | N/A | Paper |
