| Publication | Date of Publication | Type |
|---|
| Mostar index and bounded maximum degree | 2025-01-23 | Paper |
| Exact and parameterized algorithms for the independent cutset problem | 2024-12-27 | Paper |
| On conflict-free cuts: algorithms and complexity | 2024-09-11 | Paper |
| The burning of the snark | 2024-04-22 | Paper |
| Complexity of comparing the domination number to the independent domination, connected domination, and paired domination numbers | 2024-04-22 | Paper |
| Structural properties and applications to sandwich problem of the two forbidden four-vertex graph classes | 2024-04-22 | Paper |
| Irregularity of graphs respecting degree bounds | 2024-02-16 | Paper |
| FPT algorithms for packing \(k\)-safe spanning rooted sub(di)graphs | 2024-02-14 | Paper |
| On Conflict-Free Cuts: Algorithms and Complexity | 2023-11-02 | Paper |
| Bounding the Mostar index | 2023-10-30 | Paper |
| A bound on the dissociation number | 2023-10-10 | Paper |
| Relating the independence number and the dissociation number | 2023-10-09 | Paper |
| Vertex degrees close to the average degree | 2023-10-04 | Paper |
| On the maximum number of maximum independent sets in connected graphs | 2023-09-29 | Paper |
| Uniquely restricted matchings in subcubic graphs without short cycles | 2023-09-29 | Paper |
| Exact and Parameterized Algorithms for the Independent Cutset Problem | 2023-07-05 | Paper |
| Maximizing the Mostar index for bipartite graphs and split graphs | 2023-06-30 | Paper |
| Mostar index and bounded maximum degree | 2023-06-15 | Paper |
| Efficiently recognizing graphs with equal independence and annihilation numbers | 2023-06-05 | Paper |
| Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree | 2023-05-30 | Paper |
| Sparse vertex cutsets and the maximum degree | 2023-04-20 | Paper |
| Majority edge-colorings of graphs | 2023-03-21 | Paper |
| Unbalanced spanning subgraphs in edge labeled complete graphs | 2023-03-21 | Paper |
| Diameter, edge-connectivity, and \(C_4\)-freeness | 2023-03-10 | Paper |
| Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation | 2023-02-22 | Paper |
| Restricted matchings | 2022-12-21 | Paper |
| Relating dissociation, independence, and matchings | 2022-10-13 | Paper |
| On the computational complexity of the bipartizing matching problem | 2022-09-26 | Paper |
| Zero-sum copies of spanning forests in zero-sum complete graphs | 2022-08-08 | Paper |
| Factorially many maximum matchings close to the Erdős-Gallai bound | 2022-07-11 | Paper |
| Majority Edge-Colorings of Graphs | 2022-05-23 | Paper |
| Acyclic matchings in graphs of bounded maximum degree | 2022-05-17 | Paper |
| Identifying codes in the complementary prism of cycles | 2022-04-27 | Paper |
| Algorithmic aspects of broadcast independence | 2022-04-20 | Paper |
| Additive tree \(O(\rho \log n)\)-spanners from tree breadth \(\rho \) | 2022-04-19 | Paper |
| The hull number in the convexity of induced paths of order \(3\) | 2022-02-21 | Paper |
| Maximally distance-unbalanced trees | 2022-01-12 | Paper |
| On Hamiltonian cycles in claw-free cubic graphs | 2022-01-03 | Paper |
| Diameter, edge-connectivity, and $C_4$-freeness | 2021-12-16 | Paper |
| Reconfiguring dominating sets in minor-closed graph classes | 2021-11-30 | Paper |
| Almost color-balanced perfect matchings in color-balanced complete graphs | 2021-11-23 | Paper |
| Unbalanced spanning subgraphs in edge labeled complete graphs | 2021-07-20 | Paper |
| Exponential independence in subcubic graphs | 2021-06-14 | Paper |
| Geodetic convexity parameters for \((q, q - 4)\)-graphs | 2021-06-07 | Paper |
| Minimum distance-unbalancedness of trees | 2021-05-10 | Paper |
| Approximating maximum acyclic matchings by greedy and local search strategies | 2021-04-21 | Paper |
| Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation | 2021-02-22 | Paper |
| Low weight perfect matchings | 2021-01-29 | Paper |
| Bounding and approximating minimum maximal matchings in regular graphs | 2021-01-27 | Paper |
| Cubic graphs with equal independence number and matching number | 2021-01-21 | Paper |
| Linear programming based approximation for unweighted induced matchings -- breaking the \(\varDelta\) barrier | 2021-01-15 | Paper |
| Relating $2$-rainbow domination to weak Roman domination | 2020-11-12 | Paper |
| Domination versus edge domination | 2020-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3300696 | 2020-07-29 | Paper |
| Constant threshold intersection graphs of orthodox paths in trees | 2020-05-29 | Paper |
| Approximating connected safe sets in weighted trees | 2020-05-29 | Paper |
| Equating \(\kappa\) maximum degrees in graphs without short cycles | 2020-04-28 | Paper |
| Biholes in balanced bipartite graphs | 2020-04-07 | Paper |
| The hull number in the convexity of induced paths of order 3 | 2020-02-25 | Paper |
| Partial immunization of trees | 2020-02-24 | Paper |
| On some hard and some tractable cases of the maximum acyclic matching problem | 2020-01-20 | Paper |
| Sandwiches missing two ingredients of order four | 2020-01-20 | Paper |
| A short proof for a lower bound on the zero forcing number | 2020-01-08 | Paper |
| On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs | 2019-12-27 | Paper |
| On some tractable and hard instances for partial incentives and target set selection | 2019-11-28 | Paper |
| Girth, minimum degree, independence, and broadcast independence | 2019-11-08 | Paper |
| Relating broadcast independence and independence | 2019-10-17 | Paper |
| Bipartizing with a matching | 2019-10-11 | Paper |
| Approximating maximum uniquely restricted matchings in bipartite graphs | 2019-09-05 | Paper |
| Upper bounds on the uniquely restricted chromatic index | 2019-08-15 | Paper |
| On matching numbers of tree and bipartite degree sequences | 2019-06-27 | Paper |
| Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives | 2019-06-18 | Paper |
| On the Kőnig‐Egerváry theorem for ‐paths | 2019-06-14 | Paper |
| On the maximum number of minimum total dominating sets in forests | 2019-05-23 | Paper |
| Uniquely restricted matchings in subcubic graphs | 2019-05-23 | Paper |
| Vaccinate your trees! | 2019-05-17 | Paper |
| Dynamic monopolies for interval graphs with bounded thresholds | 2019-05-03 | Paper |
| Lower bounds on the uniquely restricted matching number | 2019-03-21 | Paper |
| Forcing brushes | 2019-03-11 | Paper |
| On the maximum number of minimum dominating sets in forests | 2019-02-20 | Paper |
| On the maximum number of maximum independent sets | 2019-01-11 | Paper |
| Graphs in which some and every maximum matching is uniquely restricted | 2018-10-31 | Paper |
| On some graphs with a unique perfect matching | 2018-10-19 | Paper |
| Dominating sets inducing large components in maximal outerplanar graphs | 2018-07-13 | Paper |
| Smallest domination number and largest independence number of graphs and forests with given degree sequence | 2018-07-13 | Paper |
| Maximal determinants of combinatorial matrices | 2018-06-20 | Paper |
| And/or-convexity: a graph convexity based on processes and deadlock models | 2018-06-12 | Paper |
| Approximately locating an invisible agent in a graph with relative distance queries | 2018-06-07 | Paper |
| A lower bound on the acyclic matching number of subcubic graphs | 2018-06-07 | Paper |
| Relating domination, exponential domination, and porous exponential domination | 2018-05-24 | Paper |
| Robust recoverable perfect matchings | 2018-05-23 | Paper |
| Intersection graphs of orthodox paths in trees | 2018-04-09 | Paper |
| The geodetic hull number is hard for chordal graphs | 2018-04-09 | Paper |
| On the extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives | 2018-04-06 | Paper |
| On the hardness of finding the geodetic number of a subcubic graph | 2018-04-05 | Paper |
| Degenerate matchings and edge colorings | 2018-03-21 | Paper |
| Locally searching for large induced matchings | 2018-03-12 | Paper |
| The Geodetic Hull Number is Hard for Chordal Graphs | 2018-03-05 | Paper |
| The cat and the noisy mouse | 2018-02-23 | Paper |
| How to determine if a random graph with a fixed degree sequence has a giant component | 2018-02-12 | Paper |
| Some bounds on the zero forcing number of a graph | 2018-01-11 | Paper |
| Hereditary equality of domination and exponential domination | 2018-01-10 | Paper |
| Uniquely restricted matchings and edge colorings | 2018-01-04 | Paper |
| Bounds on the burning number | 2017-12-06 | Paper |
| Corrigendum to ``Complexity analysis of \(P_{3}\)-convexity problems on bounded-degree and planar graphs | 2017-11-16 | Paper |
| The repeater tree construction problem | 2017-11-03 | Paper |
| Large values of the clustering coefficient | 2017-10-24 | Paper |
| Burning a graph is hard | 2017-10-17 | Paper |
| Relating 2-rainbow domination to Roman domination | 2017-10-13 | Paper |
| Optimal colorings with rainbow paths | 2017-10-11 | Paper |
| Extremal values of the chromatic number for a given degree sequence | 2017-10-11 | Paper |
| Generalized threshold processes on graphs | 2017-09-07 | Paper |
| Exponential independence | 2017-09-05 | Paper |
| Decycling with a matching | 2017-06-13 | Paper |
| Some comments on the Slater number | 2017-05-10 | Paper |
| Locally Dense Independent Sets in Regular Graphs of Large Girth—An Example of a New Approach | 2017-04-07 | Paper |
| Complexity properties of complementary prisms | 2017-02-22 | Paper |
| Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees | 2017-02-22 | Paper |
| Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability | 2017-02-06 | Paper |
| Exponential domination in subcubic graphs | 2017-01-18 | Paper |
| Geodetic Convexity Parameters for Graphs with Few Short Induced Paths | 2016-12-22 | Paper |
| Bounds on the exponential domination number | 2016-12-22 | Paper |
| On graphs with induced matching number almost equal to matching number | 2016-10-17 | Paper |
| Extremal values and bounds for the zero forcing number | 2016-09-30 | Paper |
| Dominating sets inducing large components | 2016-07-05 | Paper |
| On the geodetic hull number of \(P_{k}\)-free graphs | 2016-07-05 | Paper |
| Some results on graph parameters in weighted graphs | 2016-07-01 | Paper |
| Slash and burn on graphs -- firefighting with general weights | 2016-06-22 | Paper |
| Near-linear-time algorithm for the geodetic Radon number of grids | 2016-06-22 | Paper |
| A lower bound on the independence number of a graph in terms of degrees and local clique sizes | 2016-06-21 | Paper |
| Strong equality of Roman and weak Roman domination in trees | 2016-05-18 | Paper |
| Largest domination number and smallest independence number of forests with given degree sequence | 2016-05-02 | Paper |
| Independence in uniform linear triangle-free hypergraphs | 2016-04-27 | Paper |
| Cycles avoiding a color in colorful graphs | 2016-04-15 | Paper |
| Induced 2-regular subgraphs in \(k\)-chordal cubic graphs | 2016-04-07 | Paper |
| Averaging 2-rainbow domination and Roman domination | 2016-04-07 | Paper |
| The cycle spectrum of claw-free Hamiltonian graphs | 2016-03-02 | Paper |
| Cycle lengths of Hamiltonian \(P_\ell\)-free graphs | 2015-12-17 | Paper |
| Forbidden induced subgraphs for bounded \(p\)-intersection number | 2015-12-08 | Paper |
| Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs | 2015-12-08 | Paper |
| On the geodetic iteration number of distance-hereditary graphs | 2015-12-08 | Paper |
| Two greedy consequences for maximum induced matchings | 2015-09-25 | Paper |
| Distance \(k\)-domination, distance \(k\)-guarding, and distance \(k\)-vertex cover of maximal outerplanar graphs | 2015-09-01 | Paper |
| Brush your trees! | 2015-09-01 | Paper |
| Feedback vertex sets in cubic multigraphs | 2015-08-05 | Paper |
| Factor-critical graphs with the minimum number of near-perfect matchings | 2015-08-05 | Paper |
| Equality of distance packing numbers | 2015-08-05 | Paper |
| Cycles in complementary prisms | 2015-07-24 | Paper |
| Identifying Codes in the Complementary Prism of Cycles | 2015-07-17 | Paper |
| Maximum induced matchings close to maximum matchings | 2015-06-11 | Paper |
| On P 3-Convexity of Graphs with Bounded Degree | 2015-05-20 | Paper |
| Perfectly relating the domination, total domination, and paired domination numbers of a graph | 2015-04-29 | Paper |
| Asymptotic surviving rate of trees with multiple fire sources | 2015-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4982369 | 2015-04-09 | Paper |
| The Maximum Number of Dominating Induced Matchings | 2015-03-24 | Paper |
| Remarks on dynamic monopolies with given average thresholds | 2015-03-04 | Paper |
| New potential functions for greedy independence and coloring | 2015-02-06 | Paper |
| Badly-covered graphs | 2015-02-06 | Paper |
| The circumference of the square of a connected graph | 2015-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2931479 | 2014-11-25 | Paper |
| Forests and trees among Gallai graphs | 2014-11-20 | Paper |
| The Erdös-Pósa property for long circuits | 2014-11-17 | Paper |
| The Erdős-Pósa Property for Long Circuits | 2014-11-17 | Paper |
| Combinatorial optimization in VLSI design | 2014-11-10 | Paper |
| A Density Version of the Corradi-Hajnal Theorem | 2014-10-01 | Paper |
| Independent domination in subcubic bipartite graphs of girth at least six | 2014-09-12 | Paper |
| Domination and total domination in cubic graphs of large girth | 2014-08-22 | Paper |
| Graphs of interval count two with a given partition | 2014-06-23 | Paper |
| Induced Matchings in Subcubic Graphs | 2014-06-19 | Paper |
| Transversals of Longest Paths and Cycles | 2014-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5419967 | 2014-06-11 | Paper |
| The Erdős-Pósa property for long circuits | 2014-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5420034 | 2014-06-11 | Paper |
| Relating ordinary and total domination in cubic graphs of large girth | 2014-06-11 | Paper |
| The Carathéodory number of the \(P_3\) convexity of chordal graphs | 2014-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5413900 | 2014-05-02 | Paper |
| Irreversible conversion processes with deadlines | 2014-04-28 | Paper |
| More fires and more fighters | 2014-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5403028 | 2014-03-25 | Paper |
| On defensive alliances and strong global offensive alliances | 2014-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5396751 | 2014-02-03 | Paper |
| Matchings in graphs of odd regularity and girth | 2014-01-27 | Paper |
| Extending Berge's and Favaron's results about well-covered graphs | 2014-01-24 | Paper |
| Recognizing some complementary products | 2014-01-22 | Paper |
| On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7 | 2014-01-22 | Paper |
| Null-homotopic graphs and triangle-completions of spanning trees | 2014-01-21 | Paper |
| Induced matchings in subcubic graphs without short cycles | 2014-01-16 | Paper |
| On the Carathéodory number of interval and graph convexities | 2014-01-13 | Paper |
| A short proof of the versatile version of Fleischner's theorem | 2013-12-06 | Paper |
| Cycles in squares of trees without generalized claws | 2013-12-06 | Paper |
| Unit interval graphs: a story with open ends | 2013-11-01 | Paper |
| On the Carathéodory number for the convexity of paths of order three | 2013-11-01 | Paper |
| Ramsey results for cycle spectra | 2013-10-21 | Paper |
| Geodetic number versus hull number in \(P_3\)-convexity | 2013-09-26 | Paper |
| Algorithmic and structural aspects of the \(P_3\)-Radon number | 2013-09-03 | Paper |
| On the cycle spectrum of cubic Hamiltonian graphs | 2013-07-19 | Paper |
| Integral mixed unit interval graphs | 2013-04-25 | Paper |
| Unit Interval Graphs of Open and Closed Intervals | 2013-04-19 | Paper |
| Open packing, total domination, and the \(P_3\)-Radon number | 2013-04-11 | Paper |
| Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs | 2013-03-21 | Paper |
| Characterization and recognition of Radon-independent sets in split graphs | 2013-03-21 | Paper |
| On the Carathéodory Number for the Convexity of Paths of Order Three | 2013-01-04 | Paper |
| On the convexity number of graphs | 2012-12-27 | Paper |
| Pairs of disjoint dominating sets in connected cubic graphs | 2012-12-27 | Paper |
| Reversible iterative graph processes | 2012-11-27 | Paper |
| The potential of greed for independence | 2012-11-23 | Paper |
| On the geodetic Radon number of grids | 2012-11-22 | Paper |
| Immediate versus Eventual Conversion: Comparing Geodetic and Hull Numbers in P 3-Convexity | 2012-11-06 | Paper |
| Mixed unit interval graphs | 2012-10-26 | Paper |
| Integral Mixed Unit Interval Graphs | 2012-09-25 | Paper |
| Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number | 2012-09-13 | Paper |
| Cycle spectra of Hamiltonian graphs | 2012-08-14 | Paper |
| Greedy colorings of words | 2012-08-14 | Paper |
| An upper bound on the \(P_3\)-Radon number | 2012-08-10 | Paper |
| On the Radon Number for P 3-Convexity | 2012-06-29 | Paper |
| Independent sets and matchings in subcubic graphs | 2012-06-18 | Paper |
| Unit and single point interval graphs | 2012-06-18 | Paper |
| On subbetweennesses of trees: hardness, algorithms, and characterizations | 2012-04-22 | Paper |
| Cohabitation of independent sets and dominating sets in trees | 2012-01-05 | Paper |
| Dominating sets, packings, and the maximum degree | 2011-10-21 | Paper |
| Finite Sholander trees, trees, and their betweenness | 2011-10-21 | Paper |
| Connectivity and diameter in distance graphs | 2011-08-16 | Paper |
| Average distance and domination number revisited | 2011-08-10 | Paper |
| Irreversible conversion of graphs | 2011-07-14 | Paper |
| Recolouring-resistant colourings | 2011-06-28 | Paper |
| Independence, odd girth, and average degree | 2011-06-07 | Paper |
| Parameterized algorithms for the independent set problem in some hereditary graph classes | 2011-05-19 | Paper |
| Partitioning a graph into a dominating set, a total dominating set, and something else | 2011-05-09 | Paper |
| On finite convexity spaces induced by sets of paths in graphs | 2011-05-06 | Paper |
| On Hamiltonian paths in distance graphs | 2011-05-03 | Paper |
| Powers of cycles, powers of paths, and distance graphs | 2011-04-19 | Paper |
| Edge-injective and edge-surjective vertex labellings | 2011-04-15 | Paper |
| Strict betweennesses induced by posets as well as by graphs | 2011-03-31 | Paper |
| Characterization and representation problems for intersection betweennesses | 2011-03-10 | Paper |
| Lower bounds on the independence number of certain graphs of odd girth at least seven | 2011-01-21 | Paper |
| Independence in connected graphs | 2011-01-14 | Paper |
| On the hull number of triangle-free graphs | 2010-12-03 | Paper |
| Cycle length parities and the chromatic number | 2010-11-10 | Paper |
| Disjoint dominating and total dominating sets in graphs | 2010-11-05 | Paper |
| Long cycles and paths in distance graphs | 2010-10-28 | Paper |
| Minimum degree and density of binary sequences | 2010-10-18 | Paper |
| Interpolating between bounds on the independence number | 2010-10-11 | Paper |
| Pairs of disjoint dominating sets and the minimum degree of graphs | 2010-10-07 | Paper |
| On packing shortest cycles in graphs | 2010-08-20 | Paper |
| An \(\Omega (n\log n)\) lower bound for computing the sum of even-ranked elements | 2010-08-20 | Paper |
| Binary trees with choosable edge lengths | 2010-08-20 | Paper |
| Random procedures for dominating sets in graphs | 2010-08-12 | Paper |
| Exact leaf powers | 2010-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3568719 | 2010-06-15 | Paper |
| Packing disjoint cycles over vertex cuts | 2010-05-28 | Paper |
| On \({\mathcal F}\)-independence in graphs | 2010-05-14 | Paper |
| Packing edge-disjoint cycles in graphs and the cyclomatic number | 2010-05-05 | Paper |
| Some remarks on the geodetic number of a graph | 2010-04-27 | Paper |
| Edge colouring by total labellings | 2010-03-29 | Paper |
| Cycles, Paths, Connectivity and Diameter in Distance Graphs | 2010-01-21 | Paper |
| An independent dominating set in the complement of a minimum dominating set of a tree | 2010-01-08 | Paper |
| Lower bounds on treespan | 2009-12-18 | Paper |
| Remarks about disjoint dominating sets | 2009-12-15 | Paper |
| On spanning tree congestion | 2009-12-10 | Paper |
| A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing | 2009-12-10 | Paper |
| A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers | 2009-12-09 | Paper |
| Edge irregular total labellings for graphs of linear size | 2009-12-09 | Paper |
| A class of problems for which cyclic relaxation converges linearly | 2009-10-09 | Paper |
| Note on the connectivity of line graphs | 2009-07-21 | Paper |
| Some results on graphs without long induced paths | 2009-07-09 | Paper |
| On the existence of edge cuts leaving several large components | 2009-06-17 | Paper |
| On the OBDD size for graphs of bounded tree- and clique-width | 2009-04-09 | Paper |
| Some remarks on \(\lambda _{p,q}\)-connectedness | 2009-01-28 | Paper |
| The independence number in graphs of maximum degree three | 2009-01-28 | Paper |
| Domination in bipartite graphs | 2009-01-28 | Paper |
| Domination in Cubic Graphs of Large Girth | 2009-01-13 | Paper |
| Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles | 2008-12-17 | Paper |
| \(\alpha \)-domination perfect trees | 2008-07-11 | Paper |
| A conjecture of Borodin and a coloring of Grünbaum | 2008-06-12 | Paper |
| On the OBDD Size for Graphs of Bounded Tree- and Clique-Width | 2008-06-03 | Paper |
| On a conjecture about edge irregular total labelings | 2008-05-14 | Paper |
| A note on domination, girth and minimum degree | 2008-04-28 | Paper |
| Domination in graphs of minimum degree at least two and large girth | 2008-04-16 | Paper |
| On the cost of optimal alphabetic code trees with unequal letter costs | 2008-02-25 | Paper |
| New bounds on the \(k\)-domination number and the \(k\)-tuple domination number | 2007-12-06 | Paper |
| Dominating and large induced trees in regular graphs | 2007-12-06 | Paper |
| The relative clique-width of a graph | 2007-08-20 | Paper |
| The delay of circuits whose inputs have specified arrival times | 2007-06-26 | Paper |
| Distance-Hereditary 5-Leaf Powers | 2007-05-29 | Paper |
| A Conjecture of Borodin and a Coloring of Grünbaum | 2007-05-29 | Paper |
| On the irregularity of bipartite graphs | 2007-04-26 | Paper |
| Small step-dominating sets in trees | 2007-03-15 | Paper |
| Reconstructing graphs from size and degree properties of their induced \(k\)-subgraphs | 2007-03-02 | Paper |
| Delay optimization of linear depth Boolean circuits with prescribed input arrival times | 2007-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3412149 | 2006-12-05 | Paper |
| Extremal trees with respect to dominance order. | 2006-10-16 | Paper |
| A note on linear discrepancy and bandwidth | 2006-09-14 | Paper |
| The tree- and clique-width of bipartite graphs in special classes | 2006-09-13 | Paper |
| Some remarks about leaf roots | 2006-08-04 | Paper |
| Extremal problems for imbalanced edges | 2006-06-16 | Paper |
| A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2 | 2006-05-16 | Paper |
| On the maximum number of cycles in a Hamiltonian graph | 2005-12-29 | Paper |
| The numbers of shared upper bounds determine a poset | 2005-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5702652 | 2005-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5466085 | 2005-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5466062 | 2005-08-23 | Paper |
| Cuts leaving components of given minimum order | 2005-04-28 | Paper |
| Propagation of mean degrees | 2005-04-25 | Paper |
| Rectilinear spanning trees versus bounding boxes | 2005-04-25 | Paper |
| Some remarks on alpha-domination | 2005-04-19 | Paper |
| Graphs with small additive stretch number | 2005-04-15 | Paper |
| On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree | 2005-02-28 | Paper |
| A note on the number of matchings and independent sets in trees | 2005-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4820821 | 2004-10-01 | Paper |
| Chordal bipartite graphs of bounded tree- and clique-width | 2004-08-06 | Paper |
| Competition polysemy | 2004-08-06 | Paper |
| The solution of two problems on bound polysemy | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4460564 | 2004-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4457554 | 2004-03-25 | Paper |
| A note on the reconstruction of sets of finite measure | 2003-12-14 | Paper |
| A note on trees of maximum weight and restricted degrees | 2003-09-25 | Paper |
| Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees | 2003-09-22 | Paper |
| On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs | 2003-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780523 | 2003-06-26 | Paper |
| A linear-programming approach to the generalized Randić index | 2003-06-10 | Paper |
| Extremal subgraphs with respect to vertex degree bounds | 2003-04-09 | Paper |
| On a reconstruction problem of Harary and Manvel | 2003-03-26 | Paper |
| Remarks on the bondage number of planar graphs | 2003-03-16 | Paper |
| Independent domination and matchings in graphs | 2003-03-16 | Paper |
| Maximum graphs with a unique minimum dominating set | 2003-03-16 | Paper |
| On the reconstruction of the degree sequence | 2003-03-16 | Paper |
| Reconstruction up to isometries | 2003-03-16 | Paper |
| Wagner's conjecture and the graph-minor project | 2003-03-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537253 | 2002-12-02 | Paper |
| Reconstructing finite sets of points in \(R^n\) up to groups of isometries | 2002-12-02 | Paper |
| On the Randić index | 2002-12-02 | Paper |
| How local irregularity gets global in a graph | 2002-09-29 | Paper |
| Reconstructing infinite sets of integers | 2002-09-12 | Paper |
| Wiener index versus maximum degree in trees | 2002-08-29 | Paper |
| Weighted domination in triangle-free graphs | 2002-08-29 | Paper |
| Reconstructing infinite objects | 2002-08-29 | Paper |
| On Kelly's lemma for infinite sets of integers | 2002-05-15 | Paper |
| \(i\gamma(1)\)-perfect graphs | 2002-05-07 | Paper |
| On vertex orderings and the stability number in triangle-free graphs | 2002-04-21 | Paper |
| The Erdős-Pósa property for odd cycles in highly connected graphs | 2002-02-13 | Paper |
| Approximately covering by cycles in planar graphs. | 2002-01-30 | Paper |
| A characterization of \(\Gamma\alpha(k)\)-perfect graphs | 2001-12-10 | Paper |
| On domination and annihilation in graphs with claw-free blocks | 2001-11-28 | Paper |
| Perfect graphs of strong domination and independent strong domination | 2001-11-07 | Paper |
| The domatic number of block-cactus graphs | 2000-11-02 | Paper |
| Bounds on the strong domination number | 2000-08-28 | Paper |
| The influence of special vertices on strong domination | 1999-12-05 | Paper |
| On the differences between the upper irredundance, upper domination and independence numbers of a graph | 1999-09-12 | Paper |
| A linear vizing-like relation between the size and the domination number of a graph | 1999-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222089 | 1999-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3842534 | 1998-11-01 | Paper |
| Largest common subgraph of two forests | N/A | Paper |
| Induced Subforests and Superforests | N/A | Paper |
