Dieter Rautenbach

J. Graph Algorithms Appl., 2026

Complexity of deciding the equality of matching numbers.

[BibT_eX]

[DOI]

Guilherme C. M. Gomes

Bruno Porto Masquio

Paulo E. D. Pinto

J. Comput. Syst. Sci., 2026

Maximum common induced subforests and minimum common induced superforests of a set of forests.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2026

Leaf to leaf path lengths in trees of given degree sequence.

[BibT_eX]

[DOI]

Johannes Scherer

Discret. Math., 2026

An optimization approach to degree deviation and spectral radius.

[BibT_eX]

[DOI]

Discret. Optim., 2026

2025

Cutwidth and Crossings.

[BibT_eX]

[DOI]

CoRR, January, 2025

A faster algorithm for independent cut.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2025

On conflict-free cuts: Algorithms and complexity.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2025

Forest cuts in sparse graphs.

[BibT_eX]

[DOI]

Vsevolod Chernyshev

Discret. Math., 2025

Degree Deviation and Spectral Radius.

[BibT_eX]

[DOI]

Electron. J. Comb., 2025

Revisiting Extremal Graphs Having No Stable Cutsets.

[BibT_eX]

[DOI]

Electron. J. Comb., 2025

Sparse Vertex Cutsets and the Maximum Degree.

[BibT_eX]

[DOI]

Electron. J. Comb., 2025

2024

Bounding the Mostar index.

[BibT_eX]

[DOI]

Discret. Math., January, 2024

Mostar index and bounded maximum degree.

[BibT_eX]

[DOI]

Discret. Optim., 2024

FPT algorithms for packing k-safe spanning rooted sub(di)graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

Induced Subforests and Superforests.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Vertex degrees close to the average degree.

[BibT_eX]

[DOI]

Discret. Math., December, 2023

Relating the independence number and the dissociation number.

[BibT_eX]

[DOI]

J. Graph Theory, October, 2023

A bound on the dissociation number.

[BibT_eX]

[DOI]

J. Graph Theory, August, 2023

Efficiently recognizing graphs with equal independence and annihilation numbers.

[BibT_eX]

[DOI]

Inf. Process. Lett., August, 2023

Diameter, edge-connectivity, and C4-freeness.

[BibT_eX]

[DOI]

Vanessa Hiebeler

Discret. Math., May, 2023

Maximizing the Mostar index for bipartite graphs and split graphs.

[BibT_eX]

[DOI]

Discret. Optim., May, 2023

Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation.

[BibT_eX]

[DOI]

Discret. Appl. Math., March, 2023

Biholes in balanced bipartite graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2023

Irregularity of Graphs Respecting Degree Bounds.

[BibT_eX]

[DOI]

Electron. J. Comb., 2023

Majority Edge-Colorings of Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2023

Unbalanced Spanning Subgraphs in Edge Labeled Complete Graphs.

[BibT_eX]

[DOI]

Lucas Picasarri-Arrieta

Electron. J. Comb., 2023

Exact and Parameterized Algorithms for the Independent Cutset Problem.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2022

Additive tree O(ρlog⁡n)-spanners from tree breadth ρ.

[BibT_eX]

[DOI]

Oliver Bendele

Theor. Comput. Sci., 2022

Zero-Sum Copies of Spanning Forests in Zero-Sum Complete Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2022

Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2022

On Hamiltonian cycles in claw-free cubic graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2022

Almost color-balanced perfect matchings in color-balanced complete graphs.

[BibT_eX]

[DOI]

Discret. Math., 2022

Acyclic matchings in graphs of bounded maximum degree.

[BibT_eX]

[DOI]

Discret. Math., 2022

Relating dissociation, independence, and matchings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Algorithmic aspects of broadcast independence.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Factorially Many Maximum Matchings Close to the Erdős-Gallai Bound.

[BibT_eX]

[DOI]

Lucas Picasarri-Arrieta

Electron. J. Comb., 2022

On the computational complexity of the bipartizing matching problem.

[BibT_eX]

[DOI]

Carlos V. G. C. Lima

Ann. Oper. Res., 2022

2021

On the maximum number of maximum independent sets in connected graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Uniquely restricted matchings in subcubic graphs without short cycles.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Reconfiguring Dominating Sets in Minor-Closed Graph Classes.

[BibT_eX]

[DOI]

Johannes Redl

Graphs Comb., 2021

Cubic graphs with equal independence number and matching number.

[BibT_eX]

[DOI]

Discret. Math., 2021

Exponential independence in subcubic graphs.

[BibT_eX]

[DOI]

Discret. Math., 2021

Bounding and approximating minimum maximal matchings in regular graphs.

[BibT_eX]

[DOI]

Discret. Math., 2021

2020

On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

A short proof for a lower bound on the zero forcing number.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2020

Equating k maximum degrees in graphs without short cycles.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2020

Partial immunization of trees.

[BibT_eX]

[DOI]

Discret. Optim., 2020

Linear programming based approximation for unweighted induced matchings - Breaking the Δ barrier.

[BibT_eX]

[DOI]

Discret. Optim., 2020

Approximating connected safe sets in weighted trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Constant threshold intersection graphs of orthodox paths in trees.

[BibT_eX]

[DOI]

Claudson F. Bornstein

José Wilson Coura Pinto

Discret. Appl. Math., 2020

Domination versus edge domination.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Additive Tree O(ρ log n)-Spanners from Tree Breadth ρ.

[BibT_eX]

[DOI]

Oliver Bendele

CoRR, 2020

Low Weight Perfect Matchings.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

Closed-neighborhood union-closed graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2020

Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

Vaccinate your trees!

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

On the Kőnig?Egerváry theorem for k?paths.

[BibT_eX]

[DOI]

Pascal Ochem

J. Graph Theory, 2019

Upper bounds on the uniquely restricted chromatic index.

[BibT_eX]

[DOI]

Ignasi Sau

J. Graph Theory, 2019

Lower Bounds on the Uniquely Restricted Matching Number.

[BibT_eX]

[DOI]

Graphs Comb., 2019

Identifying Codes in the Complementary Prism of Cycles.

[BibT_eX]

[DOI]

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On the maximum number of minimum total dominating sets in forests.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2019

Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives.

[BibT_eX]

[DOI]

Christoph Brause

Discret. Math., 2019

On matching numbers of tree and bipartite degree sequences.

[BibT_eX]

[DOI]

Felix Bock

Discret. Math., 2019

Relating broadcast independence and independence.

[BibT_eX]

[DOI]

Discret. Math., 2019

On the maximum number of minimum dominating sets in forests.

[BibT_eX]

[DOI]

Discret. Math., 2019

On some tractable and hard instances for partial incentives and target set selection.

[BibT_eX]

[DOI]

Discret. Optim., 2019

Forcing brushes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Uniquely restricted matchings in subcubic graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Dynamic monopolies for interval graphs with bounded thresholds.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Approximating maximum uniquely restricted matchings in bipartite graphs.

[BibT_eX]

[DOI]

Ignasi Sau

Discret. Appl. Math., 2019

On some hard and some tractable cases of the maximum acyclic matching problem.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2019

Sandwiches missing two ingredients of order four.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2019

The Hull Number in the Convexity of Induced Paths of Order 3.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

2018

Locally searching for large induced matchings.

[BibT_eX]

[DOI]

Marilena Leichter

Theor. Comput. Sci., 2018

Graphs in which some and every maximum matching is uniquely restricted.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

Smallest domination number and largest independence number of graphs and forests with given degree sequence.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

Dominating sets inducing large components in maximal outerplanar graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

On some graphs with a unique perfect matching.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

On the hardness of finding the geodetic number of a subcubic graph.

[BibT_eX]

[DOI]

Letícia Rodrigues Bueno

Inf. Process. Lett., 2018

On the Maximum Number of Maximum Independent Sets.

[BibT_eX]

[DOI]

Graphs Comb., 2018

Hereditary equality of domination and exponential domination.

[BibT_eX]

[DOI]

Simon Jäger

Discuss. Math. Graph Theory, 2018

The cat and the noisy mouse.

[BibT_eX]

[DOI]

Moritz Schneider

Discret. Math., 2018

Large values of the clustering coefficient.

[BibT_eX]

[DOI]

Discret. Math., 2018

A lower bound on the acyclic matching number of subcubic graphs.

[BibT_eX]

[DOI]

Discret. Math., 2018

Approximately locating an invisible agent in a graph with relative distance queries.

[BibT_eX]

[DOI]

Dennis Dayanikli

Discret. Math., 2018

Some bounds on the zero forcing number of a graph.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Bounds on the burning number.

[BibT_eX]

[DOI]

Anthony Bonato

Jeannette C. M. Janssen

Elham Roshanbin

Discret. Appl. Math., 2018

Degenerate matchings and edge colorings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

And/or-convexity: a graph convexity based on processes and deadlock models.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2018

Bipartizing with a Matching.

[BibT_eX]

[DOI]

Carlos V. G. C. Lima

Proceedings of the Combinatorial Optimization and Applications, 2018

2017

Corrigendum to "Complexity analysis of P3-convexity problems on bounded-degree and planar graphs" [Theoret. Comput. Sci. 607 Part 1 (2015) 83-95].

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Generalized threshold processes on graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Complexity properties of complementary prisms.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

Decycling with a matching.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2017

Extremal Values of the Chromatic Number for a Given Degree Sequence.

[BibT_eX]

[DOI]

Graphs Comb., 2017

Optimal Colorings with Rainbow Paths.

[BibT_eX]

[DOI]

Oliver Bendele

Graphs Comb., 2017

Intersection Graphs of Orthodox Paths in Trees.

[BibT_eX]

[DOI]

Claudson F. Bornstein

José Wilson Coura Pinto

Electron. Notes Discret. Math., 2017

The Geodetic Hull Number is Hard for Chordal Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Relating 2-rainbow domination to Roman domination.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2017

Exponential independence.

[BibT_eX]

[DOI]

Simon Jäger

Discret. Math., 2017

Some comments on the Slater number.

[BibT_eX]

[DOI]

Discret. Math., 2017

Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability.

[BibT_eX]

[DOI]

Christoph Brause

Ingo Schiermeyer

Discret. Math., 2017

Bounds on the exponential domination number.

[BibT_eX]

[DOI]

Pascal Ochem

Discret. Math., 2017

Relating domination, exponential domination, and porous exponential domination.

[BibT_eX]

[DOI]

Simon Jäger

Discret. Optim., 2017

Geodetic convexity parameters for (q, q-4)-graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Burning a graph is hard.

[BibT_eX]

[DOI]

Anthony Bonato

Jeannette C. M. Janssen

Elham Roshanbin

Discret. Appl. Math., 2017

Eliminating Odd Cycles by Removing a Matching.

[BibT_eX]

[DOI]

CoRR, 2017

Uniquely Restricted Matchings and Edge Colorings.

[BibT_eX]

[DOI]

Ignasi Sau

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

2016

On the geodetic hull number of Pk-free graphs.

[BibT_eX]

[DOI]

Lucia Draque Penso Rautenbach

Theor. Comput. Sci., 2016

Cycles Avoiding a Color in Colorful Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2016

The Cycle Spectrum of Claw-free Hamiltonian Graphs.

[BibT_eX]

[DOI]

Jonas Eckert

Graphs Comb., 2016

On the geodetic iteration number of distance-hereditary graphs.

[BibT_eX]

[DOI]

Rodolfo Alves de Oliveira

Discret. Math., 2016

Independence in uniform linear triangle-free hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2016

Forbidden induced subgraphs for bounded p-intersection number.

[BibT_eX]

[DOI]

Claudson F. Bornstein

José Wilson Coura Pinto

Discret. Math., 2016

Dominating sets inducing large components.

[BibT_eX]

[DOI]

Discret. Math., 2016

Induced 2-regular subgraphs in k-chordal cubic graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Extremal values and bounds for the zero forcing number.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Largest domination number and smallest independence number of forests with given degree sequence.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Near-linear-time algorithm for the geodetic Radon number of grids.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Slash and burn on graphs - Firefighting with general weights.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

A lower bound on the independence number of a graph in terms of degrees and local clique sizes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Strong equality of Roman and weak Roman domination in trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Averaging 2-rainbow domination and Roman domination.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Exponential Domination in Subcubic Graphs.

[BibT_eX]

[DOI]

Pascal Ochem

Electron. J. Comb., 2016

Geodetic Convexity Parameters for Graphs with Few Short Induced Paths.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015

Two greedy consequences for maximum induced matchings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Complexity analysis of P3-convexity problems on bounded-degree and planar graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Maximum induced matchings close to maximum matchings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Robust recoverable perfect matchings.

[BibT_eX]

[DOI]

Aline Ribeiro de Almeida

Networks, 2015

The Maximum Number of Dominating Induced Matchings.

[BibT_eX]

[DOI]

Min Chih Lin

Veronica A. Moyano

J. Graph Theory, 2015

Cycle Lengths of Hamiltonian Pℓ-free Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2015

On Graphs with Induced Matching Number Almost Equal to Matching Number.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Remarks on dynamic monopolies with given average thresholds.

[BibT_eX]

[DOI]

Carmen C. Centeno

Discuss. Math. Graph Theory, 2015

Equality of distance packing numbers.

[BibT_eX]

[DOI]

Discret. Math., 2015

Forests and trees among Gallai graphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

Feedback vertex sets in cubic multigraphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

Factor-critical graphs with the minimum number of near-perfect matchings.

[BibT_eX]

[DOI]

Tomislav Doslic

Discret. Math., 2015

Perfectly relating the domination, total domination, and paired domination numbers of a graph.

[BibT_eX]

[DOI]

Discret. Math., 2015

Brush your trees!

[BibT_eX]

[DOI]

Aline Ribeiro de Almeida

Discret. Appl. Math., 2015

Cycles in complementary prisms.

[BibT_eX]

[DOI]

Aline Ribeiro de Almeida

Discret. Appl. Math., 2015

Asymptotic surviving rate of trees with multiple fire sources.

[BibT_eX]

[DOI]

Vítor Costa

Discret. Appl. Math., 2015

Badly-covered graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

New potential functions for greedy independence and coloring.

[BibT_eX]

[DOI]

Piotr Borowiecki

Discret. Appl. Math., 2015

Distance k-domination, distance k-guarding, and distance k-vertex cover of maximal outerplanar graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Complexity of Geodetic Number Problem in Graphs with Maximum Degree 4.

[BibT_eX]

Letícia Rodrigues Bueno

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

The P3-Convexity in the Complementary Prism of a Graph.

[BibT_eX]

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

Recognizing some complementary products.

[BibT_eX]

[DOI]

Márcia R. Cappelle

Theor. Comput. Sci., 2014

Transversals of Longest Paths and Cycles.

[BibT_eX]

[DOI]

Jean-Sébastien Sereni

SIAM J. Discret. Math., 2014

Induced Matchings in Subcubic Graphs.

[BibT_eX]

[DOI]

Thomas Sasse

SIAM J. Discret. Math., 2014

The Erdős-Pósa Property for Long Circuits.

[BibT_eX]

[DOI]

Thomas Sasse

J. Graph Theory, 2014

Irreversible conversion processes with deadlines.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

Graphs of interval count two with a given partition.

[BibT_eX]

[DOI]

Fabiano de S. Oliveira

Inf. Process. Lett., 2014

On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs.

[BibT_eX]

[DOI]

Roman Soták

Discret. Math. Theor. Comput. Sci., 2014

Induced matchings in subcubic graphs without short cycles.

[BibT_eX]

[DOI]

Discret. Math., 2014

Independent domination in subcubic bipartite graphs of girth at least six.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

On defensive alliances and strong global offensive alliances.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Domination and total domination in cubic graphs of large girth.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

The Carathéodory number of the P3 convexity of chordal graphs.

[BibT_eX]

[DOI]

Erika M. M. Coelho

Discret. Appl. Math., 2014

The circumference of the square of a connected graph.

[BibT_eX]

[DOI]

Comb., 2014

CLOUDFARM: An Elastic Cloud Platform with Flexible and Adaptive Resource Management.

[BibT_eX]

[DOI]

Proceedings of the 7th IEEE/ACM International Conference on Utility and Cloud Computing, 2014

On P 3-Convexity of Graphs with Bounded Degree.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013

On the Carathéodory number of interval and graph convexities.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Geodetic Number versus Hull Number in P3-Convexity.

[BibT_eX]

[DOI]

Carmen C. Centeno

SIAM J. Discret. Math., 2013

Unit Interval Graphs of Open and Closed Intervals.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

Ramsey Results for Cycle Spectra.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

On the Cycle Spectrum of Cubic Hamiltonian Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2013

Polynomial time algorithm for the Radon number of grids in the geodetic convexity.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Matchings in Graphs of Odd Regularity and Girth.

[BibT_eX]

[DOI]

Vítor Costa

Electron. Notes Discret. Math., 2013

On Minimal and Minimum Hull Sets.

[BibT_eX]

[DOI]

Rommel M. Barbosa

Electron. Notes Discret. Math., 2013

A short proof of the versatile version of Fleischner's theorem.

[BibT_eX]

[DOI]

Discret. Math., 2013

Open packing, total domination, and the P3-Radon number.

[BibT_eX]

[DOI]

Discret. Math., 2013

On the geodetic Radon number of grids.

[BibT_eX]

[DOI]

Discret. Math., 2013

Extending Berge's and Favaron's results about well-covered graphs.

[BibT_eX]

[DOI]

Márcia R. Cappelle

Discret. Math., 2013

Cycles in squares of trees without generalized claws.

[BibT_eX]

[DOI]

Discret. Math., 2013

On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7.

[BibT_eX]

[DOI]

Rommel M. Barbosa

Márcia R. Cappelle

Discret. Math., 2013

More fires and more fighters.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Chiraptophobic Cockroaches evading a Torch Light.

[BibT_eX]

Ars Comb., 2013

Algorithmic and structural aspects of the P 3-Radon number.

[BibT_eX]

[DOI]

Alexandre Toman

Ann. Oper. Res., 2013

2012

Reversible iterative graph processes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

The potential of greed for independence.

[BibT_eX]

[DOI]

J. Graph Theory, 2012

Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Cycle spectra of Hamiltonian graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

Characterization and recognition of Radon-independent sets in split graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Pairs of Disjoint Dominating Sets in Connected Cubic Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2012

On the Convexity Number of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2012

Graphs with many Vertex-Disjoint Cycles.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2012

Independent sets and matchings in subcubic graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

An upper bound on the P3-Radon number.

[BibT_eX]

[DOI]

Alexandre Toman

Discret. Math., 2012

Mixed unit interval graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

Greedy colorings of words.

[BibT_eX]

[DOI]

Zoltán Szigeti

Discret. Appl. Math., 2012

Unit and single point interval graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Account on Intervals.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

Immediate versus Eventual Conversion: Comparing Geodetic and Hull Numbers in P 3-Convexity.

[BibT_eX]

[DOI]

Carmen Cecilia Centeno

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

On the Radon Number for P 3-Convexity.

[BibT_eX]

[DOI]

Alexandre Toman

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs.

[BibT_eX]

[DOI]

Arne Leitert

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Integral Mixed Unit Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011

Combinatorial Optimization in VLSI Design.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Methods and Applications, 2011

Irreversible conversion of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Strict Betweennesses Induced by Posets as well as by Graphs.

[BibT_eX]

[DOI]

Order, 2011

Connectivity and diameter in distance graphs.

[BibT_eX]

[DOI]

Networks, 2011

Independence, odd girth, and average degree.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

Unit Interval Graphs: A Story with Open Ends.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

On the Carathéodory Number for the Convexity of Paths of Order Three.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Dominating sets, packings, and the maximum degree.

[BibT_eX]

[DOI]

Discret. Math., 2011

On finite convexity spaces induced by sets of paths in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2011

Finite Sholander trees, trees, and their betweenness.

[BibT_eX]

[DOI]

Vasek Chvátal

Discret. Math., 2011

Characterization and representation problems for intersection betweennesses.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Average distance and domination number revisited.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Lower bounds on the independence number of certain graphs of odd girth at least seven.

[BibT_eX]

[DOI]

Anders Sune Pedersen

Discret. Appl. Math., 2011

Recolouring-resistant colourings.

[BibT_eX]

[DOI]

Anders Sune Pedersen

Discret. Appl. Math., 2011

Powers of cycles, powers of paths, and distance graphs.

[BibT_eX]

[DOI]

Min Chih Lin

Francisco J. Soulignac

Discret. Appl. Math., 2011

Independence in connected graphs.

[BibT_eX]

[DOI]

Jochen Harant

Discret. Appl. Math., 2011

On subbetweennesses of trees: Hardness, algorithms, and characterizations.

[BibT_eX]

[DOI]

Comput. Math. Appl., 2011

On Hamiltonian paths in distance graphs.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2011

The South Zone: Distributed Algorithms for Alliances.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011

2010

Exact leaf powers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

On the Hull Number of Triangle-Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Edge-Injective and Edge-Surjective Vertex Labellings.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Cycle length parities and the chromatic number.

[BibT_eX]

[DOI]

Ingo Schiermeyer

J. Graph Theory, 2010

The repeater tree construction problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Pairs of Disjoint Dominating Sets and the Minimum Degree of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2010

Minimum degree and density of binary sequences.

[BibT_eX]

[DOI]

Eur. J. Comb., 2010

Convex Partitions of Graphs induced by Paths of Order Three.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2010

Partitioning a graph into a dominating set, a total dominating set, and something else.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2010

Long cycles and paths in distance graphs.

[BibT_eX]

[DOI]

Discret. Math., 2010

Packing disjoint cycles over vertex cuts.

[BibT_eX]

[DOI]

Discret. Math., 2010

Packing edge-disjoint cycles in graphs and the cyclomatic number.

[BibT_eX]

[DOI]

Discret. Math., 2010

Some remarks on the geodetic number of a graph.

[BibT_eX]

[DOI]

Discret. Math., 2010

Edge colouring by total labellings.

[BibT_eX]

[DOI]

Discret. Math., 2010

Interpolating between bounds on the independence number.

[BibT_eX]

[DOI]

Anett Boßecker

Discret. Math., 2010

Disjoint dominating and total dominating sets in graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

Random Procedures for Dominating Sets in Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2010

An independent dominating set in the complement of a minimum dominating set of a tree.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2010

Brief Announcement: On Reversible and Irreversible Conversions.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 24th International Symposium, 2010

Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2009

A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing.

[BibT_eX]

[DOI]

Sven Peyer

Jens Vygen

J. Discrete Algorithms, 2009

On packing shortest cycles in graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

An Omega(nlogn) lower bound for computing the sum of even-ranked elements.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Binary trees with choosable edge lengths.

[BibT_eX]

[DOI]

Jens Maßberg

Inf. Process. Lett., 2009

On F-independence in graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2009

On the existence of edge cuts leaving several large components.

[BibT_eX]

[DOI]

Discret. Math., 2009

On spanning tree congestion.

[BibT_eX]

[DOI]

Discret. Math., 2009

Remarks about disjoint dominating sets.

[BibT_eX]

[DOI]

Discret. Math., 2009

Domination in bipartite graphs.

[BibT_eX]

[DOI]

Jochen Harant

Discret. Math., 2009

Edge irregular total labellings for graphs of linear size.

[BibT_eX]

[DOI]

Jozef Miskuf

Discret. Math., 2009

A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers.

[BibT_eX]

[DOI]

Discret. Math., 2009

Cycles, Paths, Connectivity and Diameter in Distance Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Fast buffering for optimizing worst slack and resource consumption in repeater trees.

[BibT_eX]

[DOI]

Proceedings of the 2009 International Symposium on Physical Design, 2009

2008

Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles.

[BibT_eX]

[DOI]

Networks, 2008

On a conjecture about edge irregular total labelings.

[BibT_eX]

[DOI]

Jozef Miskuf

J. Graph Theory, 2008

Domination in Graphs of Minimum Degree at least Two and Large Girth.

[BibT_eX]

[DOI]

Graphs Comb., 2008

On the cost of optimal alphabetic code trees with unequal letter costs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2008

Some remarks on lambdap, q-connectedness.

[BibT_eX]

[DOI]

Discret. Math., 2008

A note on domination, girth and minimum degree.

[BibT_eX]

[DOI]

Discret. Math., 2008

The independence number in graphs of maximum degree three.

[BibT_eX]

[DOI]

Discret. Math., 2008

alpha-Domination perfect trees.

[BibT_eX]

[DOI]

F. Dahme

Discret. Math., 2008

A class of problems for which cyclic relaxation converges linearly.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2008

2007

BonnTools: Mathematical Innovation for Layout and Timing Closure of Systems on a Chip.

[BibT_eX]

[DOI]

Bernhard Korte

Jens Vygen

Proc. IEEE, 2007

The relative clique-width of a graph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

Dominating and large induced trees in regular graphs.

[BibT_eX]

[DOI]

Discret. Math., 2007

Small step-dominating sets in trees.

[BibT_eX]

[DOI]

Frédéric Maffray

Discret. Math., 2007

On the irregularity of bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 2007

Reconstructing graphs from size and degree properties of their induced k-subgraphs.

[BibT_eX]

[DOI]

Yair Caro

Discret. Math., 2007

The delay of circuits whose inputs have specified arrival times.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Regular Weighted Graphs Without Positive Cuts.

[BibT_eX]

Ars Comb., 2007

New bounds on the k-domination number and the k-tuple domination number.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2007

Domination in Cubic Graphs of Large Girth.

[BibT_eX]

[DOI]

Bruce A. Reed

Proceedings of the Computational Geometry and Graph Theory, 2007

Timing optimization by restructuring long combinatorial paths.

[BibT_eX]

[DOI]

Proceedings of the 2007 International Conference on Computer-Aided Design, 2007

2006

Delay optimization of linear depth boolean circuits with prescribed input arrival times.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2006

Extremal Problems for Imbalanced Edges.

[BibT_eX]

[DOI]

Ingo Schiermeyer

Graphs Comb., 2006

Distance-Hereditary 5-Leaf Powers.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

A Conjecture of Borodin and a Coloring of Grünbaum.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

Some remarks about leaf roots.

[BibT_eX]

[DOI]

Discret. Math., 2006

A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2.

[BibT_eX]

[DOI]

Discret. Math., 2006

The tree- and clique-width of bipartite graphs in special classes.

[BibT_eX]

[DOI]

Australas. J Comb., 2006

t-partitions and s-complete t-partitions of a graph.

[BibT_eX]

[DOI]

Renu C. Laskar

Australas. J Comb., 2006

Fundamental Limits on the Anonymity Provided by the MIX Technique.

[BibT_eX]

[DOI]

Proceedings of the 2006 IEEE Symposium on Security and Privacy (S&P 2006), 2006

On the OBDD Size for Graphs of Bounded Tree- and Clique-Width.

[BibT_eX]

[DOI]

Klaus Meer

Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

Efficient generation of short and fast repeater tree topologies.

[BibT_eX]

[DOI]

Proceedings of the 2006 International Symposium on Physical Design, 2006

2005

Lower bounds on treespan.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

On the maximum number of cycles in a Hamiltonian graph.

[BibT_eX]

[DOI]

Irene Stella

Discret. Math., 2005

Cuts leaving components of given minimum order.

[BibT_eX]

[DOI]

Angelika Hellwig

Discret. Math., 2005

A note on the number of matchings and independent sets in trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

Extremal Trees with Respect to Dominance Order.

[BibT_eX]

Ars Comb., 2005

2004

On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2004

The Numbers of Shared Upper Bounds Determine a Poset.

[BibT_eX]

[DOI]

Order, 2004

Note on the connectivity of line graphs.

[BibT_eX]

[DOI]

Angelika Hellwig

Inf. Process. Lett., 2004

Graphs with small additive stretch number.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2004

Some remarks on alpha-domination.

[BibT_eX]

[DOI]

F. Dahme

Discuss. Math. Graph Theory, 2004

Chordal bipartite graphs of bounded tree- and clique-width.

[BibT_eX]

[DOI]

Discret. Math., 2004

The solution of two problems on bound polysemy.

[BibT_eX]

[DOI]

Discret. Math., 2004

Competition polysemy.

[BibT_eX]

[DOI]

Discret. Math., 2004

Rectilinear Spanning Trees Versus Bounding Boxes.

[BibT_eX]

[DOI]

Electron. J. Comb., 2004

Propagation of Mean Degrees.

[BibT_eX]

[DOI]

Electron. J. Comb., 2004

2003

Some results on graphs without long induced paths.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Extremal subgraphs with respect to vertex degree bounds.

[BibT_eX]

[DOI]

Discret. Math., 2003

On alphargammas(k)-perfect graphs.

[BibT_eX]

[DOI]

Discret. Math., 2003

A note on trees of maximum weight and restricted degrees.

[BibT_eX]

[DOI]

Discret. Math., 2003

Maximum graphs with a unique minimum dominating set.

[BibT_eX]

[DOI]

Discret. Math., 2003

Remarks on the bondage number of planar graphs.

[BibT_eX]

[DOI]

Discret. Math., 2003

A Linear-programming Approach to the Generalized Randic Index.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees.

[BibT_eX]

[DOI]

Charles Delorme

Discret. Appl. Math., 2003

Finite sets in Rn given up to translation have reconstruction number three.

[BibT_eX]

Ars Comb., 2003

Four traps are almost always enough to catch a square-celled animal.

[BibT_eX]

Ars Comb., 2003

2002

How local irregularity gets global in a graph.

[BibT_eX]

[DOI]

J. Graph Theory, 2002

Reconstructing Infinite Sets of Integers.

[BibT_eX]

[DOI]

Eberhard Triesch

J. Comb. Theory A, 2002

On a Reconstruction Problem of Harary and Manvel.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2002

Independent domination and matchings in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

Reconstruction up to isometries.

[BibT_eX]

[DOI]

Eberhard Triesch

Discret. Math., 2002

On Kelly's lemma for infinite sets of integers.

[BibT_eX]

[DOI]

Discret. Math., 2002

Reconstructing infinite objects.

[BibT_eX]

[DOI]

Discret. Math., 2002

On the Randic Image index.

[BibT_eX]

[DOI]

Charles Delorme

Discret. Math., 2002

On the reconstruction of the degree sequence.

[BibT_eX]

[DOI]

Charles Delorme

Discret. Math., 2002

Weighted domination in triangle-free graphs.

[BibT_eX]

[DOI]

Peter Dankelmann

Discret. Math., 2002

Wiener index versus maximum degree in trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

Extensions of α-polynomial classes.

[BibT_eX]

[DOI]

Igor E. Zverovich

Inessa I. Zverovich

Australas. J Comb., 2002

2001

Reconstructing Finite Sets of Points in Rnup to Groups of Isometries.

[BibT_eX]

[DOI]

Eur. J. Comb., 2001

Perfect graphs of strong domination and independent strong domination.

[BibT_eX]

[DOI]

Vadim E. Zverovich

Discret. Math., 2001

On vertex orderings and the stability number in triangle-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2001

On domination and annihilation in graphs with claw-free blocks.

[BibT_eX]

[DOI]

Discret. Math., 2001

i gamma(1)-perfect graphs.

[BibT_eX]

[DOI]

Lothar Dohmen

Discret. Math., 2001

The Erdos-Pósa Property for Odd Cycles in Highly Connected Graphs.

[BibT_eX]

[DOI]

Bruce A. Reed

Comb., 2001

Approximately covering by cycles in planar graphs.

[BibT_eX]

[DOI]

Bruce A. Reed

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000

Some results on graph parameters in weighted graphs.

[BibT_eX]

[DOI]

Peter Dankelmann

Electron. Notes Discret. Math., 2000

Bounds on the strong domination number.

[BibT_eX]

[DOI]

Discret. Math., 2000

A characterization of rho alpha(k)-perfect graphs.

[BibT_eX]

[DOI]

Lothar Dohmen

Discret. Math., 2000

1999

A linear vizing-like relation between the size and the domination number of a graph.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

The influence of special vertices on strong domination.

[BibT_eX]

[DOI]

Discret. Math., 1999

On the differences between the upper irredundance, upper domination and independence numbers of a graph.

[BibT_eX]

[DOI]

Discret. Math., 1999

1998

The domatic number of block-cactus graphs.

[BibT_eX]

[DOI]

Discret. Math., 1998

Some structural results on linear arboricity.

[BibT_eX]

[DOI]

Australas. J Comb., 1998

Bounds on the weak domination number.

[BibT_eX]

[DOI]