2024
Bounding the Mostar index.
Discret. Math., January, 2024
Induced Subforests and Superforests.
CoRR, 2024
Largest common subgraph of two forests.
CoRR, 2024
2023
Vertex degrees close to the average degree.
Discret. Math., December, 2023
Relating the independence number and the dissociation number.
J. Graph Theory, October, 2023
A bound on the dissociation number.
J. Graph Theory, August, 2023
Efficiently recognizing graphs with equal independence and annihilation numbers.
Inf. Process. Lett., August, 2023
Diameter, edge-connectivity, and <i>C</i><sub>4</sub>-freeness.
Discret. Math., May, 2023
Maximizing the Mostar index for bipartite graphs and split graphs.
Discret. Optim., May, 2023
Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation.
Discret. Appl. Math., March, 2023
Biholes in balanced bipartite graphs.
Discuss. Math. Graph Theory, 2023
On Conflict-Free Cuts: Algorithms and Complexity.
CoRR, 2023
Irregularity of Graphs Respecting Degree Bounds.
Electron. J. Comb., 2023
Majority Edge-Colorings of Graphs.
Electron. J. Comb., 2023
Unbalanced Spanning Subgraphs in Edge Labeled Complete Graphs.
Electron. J. Comb., 2023
Exact and Parameterized Algorithms for the Independent Cutset Problem.
Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023
2022
The hull number in the convexity of induced paths of order 3.
Theor. Comput. Sci., 2022
Additive tree O(ρlogn)-spanners from tree breadth <i>ρ</i>.
Theor. Comput. Sci., 2022
Zero-Sum Copies of Spanning Forests in Zero-Sum Complete Graphs.
Graphs Comb., 2022
Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree.
Discret. Math. Theor. Comput. Sci., 2022
On Hamiltonian cycles in claw-free cubic graphs.
Discuss. Math. Graph Theory, 2022
Almost color-balanced perfect matchings in color-balanced complete graphs.
Discret. Math., 2022
Acyclic matchings in graphs of bounded maximum degree.
Discret. Math., 2022
Relating dissociation, independence, and matchings.
Discret. Appl. Math., 2022
Algorithmic aspects of broadcast independence.
Discret. Appl. Math., 2022
Factorially Many Maximum Matchings Close to the Erdős-Gallai Bound.
Electron. J. Comb., 2022
On the computational complexity of the bipartizing matching problem.
Ann. Oper. Res., 2022
2021
On the maximum number of maximum independent sets in connected graphs.
J. Graph Theory, 2021
Uniquely restricted matchings in subcubic graphs without short cycles.
J. Graph Theory, 2021
Reconfiguring Dominating Sets in Minor-Closed Graph Classes.
Graphs Comb., 2021
Cubic graphs with equal independence number and matching number.
Discret. Math., 2021
Exponential independence in subcubic graphs.
Discret. Math., 2021
Bounding and approximating minimum maximal matchings in regular graphs.
Discret. Math., 2021
FPT algorithms for packing k-safe spanning rooted sub(di)graphs.
CoRR, 2021
2020
On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs.
Theor. Comput. Sci., 2020
A short proof for a lower bound on the zero forcing number.
Discuss. Math. Graph Theory, 2020
Equating <i>k</i> maximum degrees in graphs without short cycles.
Discuss. Math. Graph Theory, 2020
Partial immunization of trees.
Discret. Optim., 2020
Linear programming based approximation for unweighted induced matchings - Breaking the Δ barrier.
Discret. Optim., 2020
Approximating connected safe sets in weighted trees.
Discret. Appl. Math., 2020
Constant threshold intersection graphs of orthodox paths in trees.
Discret. Appl. Math., 2020
Domination versus edge domination.
Discret. Appl. Math., 2020
Additive Tree O(ρ log n)-Spanners from Tree Breadth ρ.
CoRR, 2020
Low Weight Perfect Matchings.
Electron. J. Comb., 2020
Closed-neighborhood union-closed graphs.
Australas. J Comb., 2020
Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020
2019
Theor. Comput. Sci., 2019
On the Kőnig?Egerváry theorem for k?paths.
J. Graph Theory, 2019
Upper bounds on the uniquely restricted chromatic index.
J. Graph Theory, 2019
Lower Bounds on the Uniquely Restricted Matching Number.
Graphs Comb., 2019
Identifying Codes in the Complementary Prism of Cycles.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019
On the maximum number of minimum total dominating sets in forests.
Discret. Math. Theor. Comput. Sci., 2019
Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives.
Discret. Math., 2019
On matching numbers of tree and bipartite degree sequences.
Discret. Math., 2019
Relating broadcast independence and independence.
Discret. Math., 2019
On the maximum number of minimum dominating sets in forests.
Discret. Math., 2019
On some tractable and hard instances for partial incentives and target set selection.
Discret. Optim., 2019
Discret. Appl. Math., 2019
Uniquely restricted matchings in subcubic graphs.
Discret. Appl. Math., 2019
Dynamic monopolies for interval graphs with bounded thresholds.
Discret. Appl. Math., 2019
Approximating maximum uniquely restricted matchings in bipartite graphs.
Discret. Appl. Math., 2019
On some hard and some tractable cases of the maximum acyclic matching problem.
Ann. Oper. Res., 2019
Sandwiches missing two ingredients of order four.
Ann. Oper. Res., 2019
2018
Locally searching for large induced matchings.
Theor. Comput. Sci., 2018
Graphs in which some and every maximum matching is uniquely restricted.
J. Graph Theory, 2018
Smallest domination number and largest independence number of graphs and forests with given degree sequence.
J. Graph Theory, 2018
Dominating sets inducing large components in maximal outerplanar graphs.
J. Graph Theory, 2018
On some graphs with a unique perfect matching.
Inf. Process. Lett., 2018
On the hardness of finding the geodetic number of a subcubic graph.
Inf. Process. Lett., 2018
On the Maximum Number of Maximum Independent Sets.
Graphs Comb., 2018
Hereditary equality of domination and exponential domination.
Discuss. Math. Graph Theory, 2018
The cat and the noisy mouse.
Discret. Math., 2018
Large values of the clustering coefficient.
Discret. Math., 2018
A lower bound on the acyclic matching number of subcubic graphs.
Discret. Math., 2018
Approximately locating an invisible agent in a graph with relative distance queries.
Discret. Math., 2018
Some bounds on the zero forcing number of a graph.
Discret. Appl. Math., 2018
Bounds on the burning number.
Discret. Appl. Math., 2018
Degenerate matchings and edge colorings.
Discret. Appl. Math., 2018
And/or-convexity: a graph convexity based on processes and deadlock models.
Ann. Oper. Res., 2018
Bipartizing with a Matching.
Proceedings of the Combinatorial Optimization and Applications, 2018
2017
Corrigendum to "Complexity analysis of P<sub>3</sub>-convexity problems on bounded-degree and planar graphs" [Theoret. Comput. Sci. 607 Part 1 (2015) 83-95].
Theor. Comput. Sci., 2017
Generalized threshold processes on graphs.
Theor. Comput. Sci., 2017
Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees.
Theor. Comput. Sci., 2017
Complexity properties of complementary prisms.
J. Comb. Optim., 2017
Decycling with a matching.
Inf. Process. Lett., 2017
Extremal Values of the Chromatic Number for a Given Degree Sequence.
Graphs Comb., 2017
Optimal Colorings with Rainbow Paths.
Graphs Comb., 2017
Intersection Graphs of Orthodox Paths in Trees.
Electron. Notes Discret. Math., 2017
The Geodetic Hull Number is Hard for Chordal Graphs.
Electron. Notes Discret. Math., 2017
Relating 2-rainbow domination to Roman domination.
Discuss. Math. Graph Theory, 2017
Exponential independence.
Discret. Math., 2017
Some comments on the Slater number.
Discret. Math., 2017
Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability.
Discret. Math., 2017
Bounds on the exponential domination number.
Discret. Math., 2017
Relating domination, exponential domination, and porous exponential domination.
Discret. Optim., 2017
Geodetic convexity parameters for (q, q-4)-graphs.
Discret. Appl. Math., 2017
Discret. Appl. Math., 2017
Eliminating Odd Cycles by Removing a Matching.
CoRR, 2017
Uniquely Restricted Matchings and Edge Colorings.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017
2016
On the geodetic hull number of P<sub>k</sub>-free graphs.
Theor. Comput. Sci., 2016
Cycles Avoiding a Color in Colorful Graphs.
J. Graph Theory, 2016
The Cycle Spectrum of Claw-free Hamiltonian Graphs.
Graphs Comb., 2016
On the geodetic iteration number of distance-hereditary graphs.
Discret. Math., 2016
Independence in uniform linear triangle-free hypergraphs.
Discret. Math., 2016
Forbidden induced subgraphs for bounded p-intersection number.
Discret. Math., 2016
Dominating sets inducing large components.
Discret. Math., 2016
Induced 2-regular subgraphs in k-chordal cubic graphs.
Discret. Appl. Math., 2016
Extremal values and bounds for the zero forcing number.
Discret. Appl. Math., 2016
Largest domination number and smallest independence number of forests with given degree sequence.
Discret. Appl. Math., 2016
Near-linear-time algorithm for the geodetic Radon number of grids.
Discret. Appl. Math., 2016
Slash and burn on graphs - Firefighting with general weights.
Discret. Appl. Math., 2016
A lower bound on the independence number of a graph in terms of degrees and local clique sizes.
Discret. Appl. Math., 2016
Strong equality of Roman and weak Roman domination in trees.
Discret. Appl. Math., 2016
Averaging 2-rainbow domination and Roman domination.
Discret. Appl. Math., 2016
Exponential Domination in Subcubic Graphs.
Electron. J. Comb., 2016
Geodetic Convexity Parameters for Graphs with Few Short Induced Paths.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016
How to Determine if a Random Graph with a Fixed Degree Sequence Has a Giant Component.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016
2015
Two greedy consequences for maximum induced matchings.
Theor. Comput. Sci., 2015
Complexity analysis of P<sub>3</sub>-convexity problems on bounded-degree and planar graphs.
Theor. Comput. Sci., 2015
Maximum induced matchings close to maximum matchings.
Theor. Comput. Sci., 2015
Robust recoverable perfect matchings.
Networks, 2015
The Maximum Number of Dominating Induced Matchings.
J. Graph Theory, 2015
Cycle Lengths of Hamiltonian P<sub>ℓ</sub>-free Graphs.
Graphs Comb., 2015
On Graphs with Induced Matching Number Almost Equal to Matching Number.
Electron. Notes Discret. Math., 2015
Remarks on dynamic monopolies with given average thresholds.
Discuss. Math. Graph Theory, 2015
Equality of distance packing numbers.
Discret. Math., 2015
Forests and trees among Gallai graphs.
Discret. Math., 2015
Feedback vertex sets in cubic multigraphs.
Discret. Math., 2015
Factor-critical graphs with the minimum number of near-perfect matchings.
Discret. Math., 2015
Perfectly relating the domination, total domination, and paired domination numbers of a graph.
Discret. Math., 2015
Discret. Appl. Math., 2015
Cycles in complementary prisms.
Discret. Appl. Math., 2015
Asymptotic surviving rate of trees with multiple fire sources.
Discret. Appl. Math., 2015
Discret. Appl. Math., 2015
New potential functions for greedy independence and coloring.
Discret. Appl. Math., 2015
Distance k-domination, distance k-guarding, and distance k-vertex cover of maximal outerplanar graphs.
Discret. Appl. Math., 2015
Complexity of Geodetic Number Problem in Graphs with Maximum Degree 4.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015
The P3-Convexity in the Complementary Prism of a Graph.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015
2014
Recognizing some complementary products.
Theor. Comput. Sci., 2014
Transversals of Longest Paths and Cycles.
SIAM J. Discret. Math., 2014
Induced Matchings in Subcubic Graphs.
SIAM J. Discret. Math., 2014
The Erdős-Pósa Property for Long Circuits.
J. Graph Theory, 2014
Irreversible conversion processes with deadlines.
J. Discrete Algorithms, 2014
Graphs of interval count two with a given partition.
Inf. Process. Lett., 2014
On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs.
Discret. Math. Theor. Comput. Sci., 2014
Induced matchings in subcubic graphs without short cycles.
Discret. Math., 2014
Independent domination in subcubic bipartite graphs of girth at least six.
Discret. Appl. Math., 2014
On defensive alliances and strong global offensive alliances.
Discret. Appl. Math., 2014
Domination and total domination in cubic graphs of large girth.
Discret. Appl. Math., 2014
The Carathéodory number of the P<sub>3</sub> convexity of chordal graphs.
Discret. Appl. Math., 2014
The circumference of the square of a connected graph.
Comb., 2014
CLOUDFARM: An Elastic Cloud Platform with Flexible and Adaptive Resource Management.
Proceedings of the 7th IEEE/ACM International Conference on Utility and Cloud Computing, 2014
On P 3-Convexity of Graphs with Bounded Degree.
Proceedings of the Algorithmic Aspects in Information and Management, 2014
2013
On the Carathéodory number of interval and graph convexities.
Theor. Comput. Sci., 2013
Geodetic Number versus Hull Number in P<sub>3</sub>-Convexity.
SIAM J. Discret. Math., 2013
Unit Interval Graphs of Open and Closed Intervals.
J. Graph Theory, 2013
Ramsey Results for Cycle Spectra.
J. Graph Theory, 2013
On the Cycle Spectrum of Cubic Hamiltonian Graphs.
Graphs Comb., 2013
Polynomial time algorithm for the Radon number of grids in the geodetic convexity.
Electron. Notes Discret. Math., 2013
Matchings in Graphs of Odd Regularity and Girth.
Electron. Notes Discret. Math., 2013
On Minimal and Minimum Hull Sets.
Electron. Notes Discret. Math., 2013
A short proof of the versatile version of Fleischner's theorem.
Discret. Math., 2013
Open packing, total domination, and the <i>P</i><sub>3</sub>-Radon number.
Discret. Math., 2013
On the geodetic Radon number of grids.
Discret. Math., 2013
Extending Berge's and Favaron's results about well-covered graphs.
Discret. Math., 2013
Cycles in squares of trees without generalized claws.
Discret. Math., 2013
On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7.
Discret. Math., 2013
Integral mixed unit interval graphs.
Discret. Appl. Math., 2013
More fires and more fighters.
Discret. Appl. Math., 2013
Chiraptophobic Cockroaches evading a Torch Light.
Ars Comb., 2013
Algorithmic and structural aspects of the P 3-Radon number.
Ann. Oper. Res., 2013
2012
Reversible iterative graph processes.
Theor. Comput. Sci., 2012
The potential of greed for independence.
J. Graph Theory, 2012
Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number.
J. Discrete Algorithms, 2012
Cycle spectra of Hamiltonian graphs.
J. Comb. Theory, Ser. B, 2012
Characterization and recognition of Radon-independent sets in split graphs.
Inf. Process. Lett., 2012
Pairs of Disjoint Dominating Sets in Connected Cubic Graphs.
Graphs Comb., 2012
On the Convexity Number of Graphs.
Graphs Comb., 2012
Graphs with many Vertex-Disjoint Cycles.
Discret. Math. Theor. Comput. Sci., 2012
Independent sets and matchings in subcubic graphs.
Discret. Math., 2012
An upper bound on the P<sub>3</sub>-Radon number.
Discret. Math., 2012
Mixed unit interval graphs.
Discret. Math., 2012
Greedy colorings of words.
Discret. Appl. Math., 2012
Unit and single point interval graphs.
Discret. Appl. Math., 2012
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012
Immediate versus Eventual Conversion: Comparing Geodetic and Hull Numbers in P 3-Convexity.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012
On the Radon Number for P 3-Convexity.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012
2011
Combinatorial Optimization in VLSI Design.
Proceedings of the Combinatorial Optimization - Methods and Applications, 2011
Irreversible conversion of graphs.
Theor. Comput. Sci., 2011
Strict Betweennesses Induced by Posets as well as by Graphs.
Order, 2011
Connectivity and diameter in distance graphs.
Networks, 2011
Independence, odd girth, and average degree.
J. Graph Theory, 2011
Unit Interval Graphs: A Story with Open Ends.
Electron. Notes Discret. Math., 2011
On the Carathéodory Number for the Convexity of Paths of Order Three.
Electron. Notes Discret. Math., 2011
Dominating sets, packings, and the maximum degree.
Discret. Math., 2011
On finite convexity spaces induced by sets of paths in graphs.
Discret. Math., 2011
Finite Sholander trees, trees, and their betweenness.
Discret. Math., 2011
Characterization and representation problems for intersection betweennesses.
Discret. Appl. Math., 2011
Average distance and domination number revisited.
Discret. Appl. Math., 2011
Lower bounds on the independence number of certain graphs of odd girth at least seven.
Discret. Appl. Math., 2011
Recolouring-resistant colourings.
Discret. Appl. Math., 2011
Powers of cycles, powers of paths, and distance graphs.
Discret. Appl. Math., 2011
Independence in connected graphs.
Discret. Appl. Math., 2011
On subbetweennesses of trees: Hardness, algorithms, and characterizations.
Comput. Math. Appl., 2011
On Hamiltonian paths in distance graphs.
Appl. Math. Lett., 2011
The South Zone: Distributed Algorithms for Alliances.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011
2010
Theor. Comput. Sci., 2010
On the Hull Number of Triangle-Free Graphs.
SIAM J. Discret. Math., 2010
Edge-Injective and Edge-Surjective Vertex Labellings.
SIAM J. Discret. Math., 2010
Cycle length parities and the chromatic number.
J. Graph Theory, 2010
The repeater tree construction problem.
Inf. Process. Lett., 2010
Pairs of Disjoint Dominating Sets and the Minimum Degree of Graphs.
Graphs Comb., 2010
Minimum degree and density of binary sequences.
Eur. J. Comb., 2010
Convex Partitions of Graphs induced by Paths of Order Three.
Discret. Math. Theor. Comput. Sci., 2010
Partitioning a graph into a dominating set, a total dominating set, and something else.
Discuss. Math. Graph Theory, 2010
Long cycles and paths in distance graphs.
Discret. Math., 2010
Packing disjoint cycles over vertex cuts.
Discret. Math., 2010
Packing edge-disjoint cycles in graphs and the cyclomatic number.
Discret. Math., 2010
Some remarks on the geodetic number of a graph.
Discret. Math., 2010
Edge colouring by total labellings.
Discret. Math., 2010
Interpolating between bounds on the independence number.
Discret. Math., 2010
Disjoint dominating and total dominating sets in graphs.
Discret. Appl. Math., 2010
Random Procedures for Dominating Sets in Graphs.
Electron. J. Comb., 2010
An independent dominating set in the complement of a minimum dominating set of a tree.
Appl. Math. Lett., 2010
Brief Announcement: On Reversible and Irreversible Conversions.
Proceedings of the Distributed Computing, 24th International Symposium, 2010
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010
2009
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing.
J. Discrete Algorithms, 2009
On packing shortest cycles in graphs.
Inf. Process. Lett., 2009
An Omega(nlogn) lower bound for computing the sum of even-ranked elements.
Inf. Process. Lett., 2009
Binary trees with choosable edge lengths.
Inf. Process. Lett., 2009
On <i> F</i>-independence in graphs.
Discuss. Math. Graph Theory, 2009
On the existence of edge cuts leaving several large components.
Discret. Math., 2009
On the OBDD size for graphs of bounded tree- and clique-width.
Discret. Math., 2009
On spanning tree congestion.
Discret. Math., 2009
Remarks about disjoint dominating sets.
Discret. Math., 2009
Domination in bipartite graphs.
Discret. Math., 2009
Edge irregular total labellings for graphs of linear size.
Discret. Math., 2009
A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers.
Discret. Math., 2009
Cycles, Paths, Connectivity and Diameter in Distance Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009
Fast buffering for optimizing worst slack and resource consumption in repeater trees.
Proceedings of the 2009 International Symposium on Physical Design, 2009
2008
Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles.
Networks, 2008
On a conjecture about edge irregular total labelings.
J. Graph Theory, 2008
Domination in Graphs of Minimum Degree at least Two and Large Girth.
Graphs Comb., 2008
On the cost of optimal alphabetic code trees with unequal letter costs.
Eur. J. Comb., 2008
Some remarks on lambda<sub>p, q</sub>-connectedness.
Discret. Math., 2008
A note on domination, girth and minimum degree.
Discret. Math., 2008
The independence number in graphs of maximum degree three.
Discret. Math., 2008
alpha-Domination perfect trees.
Discret. Math., 2008
A class of problems for which cyclic relaxation converges linearly.
Comput. Optim. Appl., 2008
2007
BonnTools: Mathematical Innovation for Layout and Timing Closure of Systems on a Chip.
Proc. IEEE, 2007
The relative clique-width of a graph.
J. Comb. Theory, Ser. B, 2007
Dominating and large induced trees in regular graphs.
Discret. Math., 2007
Small step-dominating sets in trees.
Discret. Math., 2007
On the irregularity of bipartite graphs.
Discret. Math., 2007
Reconstructing graphs from size and degree properties of their induced k-subgraphs.
Discret. Math., 2007
The delay of circuits whose inputs have specified arrival times.
Discret. Appl. Math., 2007
Regular Weighted Graphs Without Positive Cuts.
Ars Comb., 2007
New bounds on the <i>k</i>-domination number and the <i>k</i>-tuple domination number.
Appl. Math. Lett., 2007
Domination in Cubic Graphs of Large Girth.
Proceedings of the Computational Geometry and Graph Theory, 2007
Timing optimization by restructuring long combinatorial paths.
Proceedings of the 2007 International Conference on Computer-Aided Design, 2007
2006
Delay optimization of linear depth boolean circuits with prescribed input arrival times.
J. Discrete Algorithms, 2006
Extremal Problems for Imbalanced Edges.
Graphs Comb., 2006
Distance-Hereditary 5-Leaf Powers.
Electron. Notes Discret. Math., 2006
A Conjecture of Borodin and a Coloring of Grünbaum.
Electron. Notes Discret. Math., 2006
Some remarks about leaf roots.
Discret. Math., 2006
A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2.
Discret. Math., 2006
The tree- and clique-width of bipartite graphs in special classes.
Australas. J Comb., 2006
t-partitions and s-complete t-partitions of a graph.
Australas. J Comb., 2006
Fundamental Limits on the Anonymity Provided by the MIX Technique.
Proceedings of the 2006 IEEE Symposium on Security and Privacy (S&P 2006), 2006
Efficient generation of short and fast repeater tree topologies.
Proceedings of the 2006 International Symposium on Physical Design, 2006
2005
Lower bounds on treespan.
Inf. Process. Lett., 2005
On the maximum number of cycles in a Hamiltonian graph.
Discret. Math., 2005
Cuts leaving components of given minimum order.
Discret. Math., 2005
A note on the number of matchings and independent sets in trees.
Discret. Appl. Math., 2005
Extremal Trees with Respect to Dominance Order.
Ars Comb., 2005
2004
On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree.
SIAM J. Discret. Math., 2004
The Numbers of Shared Upper Bounds Determine a Poset.
Order, 2004
Note on the connectivity of line graphs.
Inf. Process. Lett., 2004
Graphs with small additive stretch number.
Discuss. Math. Graph Theory, 2004
Some remarks on alpha-domination.
Discuss. Math. Graph Theory, 2004
Chordal bipartite graphs of bounded tree- and clique-width.
Discret. Math., 2004
The solution of two problems on bound polysemy.
Discret. Math., 2004
Rectilinear Spanning Trees Versus Bounding Boxes.
Electron. J. Comb., 2004
Propagation of Mean Degrees.
Electron. J. Comb., 2004
2003
Some results on graphs without long induced paths.
Inf. Process. Lett., 2003
Extremal subgraphs with respect to vertex degree bounds.
Discret. Math., 2003
On alpha<sub>r</sub>gamma<sub>s</sub>(<i>k</i>)-perfect graphs.
Discret. Math., 2003
A note on trees of maximum weight and restricted degrees.
Discret. Math., 2003
Maximum graphs with a unique minimum dominating set.
Discret. Math., 2003
Remarks on the bondage number of planar graphs.
Discret. Math., 2003
A Linear-programming Approach to the Generalized Randic Index.
Discret. Appl. Math., 2003
Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees.
Discret. Appl. Math., 2003
Finite sets in Rn given up to translation have reconstruction number three.
Ars Comb., 2003
Four traps are almost always enough to catch a square-celled animal.
Ars Comb., 2003
2002
How local irregularity gets global in a graph.
J. Graph Theory, 2002
Reconstructing Infinite Sets of Integers.
J. Comb. Theory, Ser. A, 2002
On a Reconstruction Problem of Harary and Manvel.
J. Comb. Theory, Ser. A, 2002
Independent domination and matchings in graphs.
Discret. Math., 2002
Reconstruction up to isometries.
Discret. Math., 2002
On Kelly's lemma for infinite sets of integers.
Discret. Math., 2002
Reconstructing infinite objects.
Discret. Math., 2002
On the Randic Image index.
Discret. Math., 2002
On the reconstruction of the degree sequence.
Discret. Math., 2002
Weighted domination in triangle-free graphs.
Discret. Math., 2002
Wiener index versus maximum degree in trees.
Discret. Appl. Math., 2002
Extensions of α-polynomial classes.
Australas. J Comb., 2002
2001
Reconstructing Finite Sets of Points in <i>R</i><sup>n</sup>up to Groups of Isometries.
Eur. J. Comb., 2001
Perfect graphs of strong domination and independent strong domination.
Discret. Math., 2001
On vertex orderings and the stability number in triangle-free graphs.
Discret. Math., 2001
On domination and annihilation in graphs with claw-free blocks.
Discret. Math., 2001
i gamma(1)-perfect graphs.
Discret. Math., 2001
The Erdos-Pósa Property for Odd Cycles in Highly Connected Graphs.
Comb., 2001
Approximately covering by cycles in planar graphs.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
2000
Some results on graph parameters in weighted graphs.
Electron. Notes Discret. Math., 2000
Bounds on the strong domination number.
Discret. Math., 2000
A characterization of rho alpha(<i>k</i>)-perfect graphs.
Discret. Math., 2000
1999
A linear vizing-like relation between the size and the domination number of a graph.
J. Graph Theory, 1999
The influence of special vertices on strong domination.
Discret. Math., 1999
On the differences between the upper irredundance, upper domination and independence numbers of a graph.
Discret. Math., 1999
1998
The domatic number of block-cactus graphs.
Discret. Math., 1998
Some structural results on linear arboricity.
Australas. J Comb., 1998
Bounds on the weak domination number.
Australas. J Comb., 1998
