Boris Brimkov

J. Comb. Optim., 2022

2021

On the status sequences of trees.

[BibT_eX]

[DOI]

Aida Abiad

Alexander Grigoriev

Theor. Comput. Sci., 2021

Tangle bases: Revisited.

[BibT_eX]

[DOI]

Networks, 2021

Improved Computational Approaches and Heuristics for Zero Forcing.

[BibT_eX]

[DOI]

Derek Mikesell

INFORMS J. Comput., 2021

2020

The Slater and sub-k-domination number of a graph with applications to domination and k-domination.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2020

On Connectedness of Discretized Sets.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Image Analysis - 20th International Workshop, 2020

2019

Power domination throttling.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Connected power domination in graphs.

[BibT_eX]

[DOI]

Derek Mikesell

Logan A. Smith

J. Comb. Optim., 2019

Restricted power domination and zero forcing problems.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

Computational approaches for zero forcing and related problems.

[BibT_eX]

[DOI]

Caleb C. Fast

Eur. J. Oper. Res., 2019

The zero forcing polynomial of a graph.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Cop throttling number: Bounds, values, and variants.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Throttling for the game of Cops and Robbers on graphs.

[BibT_eX]

[DOI]

Discret. Math., 2018

2017

Injective choosability of subcubic planar graphs with girth 6.

[BibT_eX]

[DOI]

Discret. Math., 2017

Complexity and computation of connected zero forcing.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Memory efficient algorithms for cactus graphs and block graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

On the Wiener index, distance cospectrality and transmission-regular graphs.

[BibT_eX]

[DOI]

Xavier Martínez-Rivera

Suil O

Sung-Yell Song

Jason Williford

Discret. Appl. Math., 2017

Graphs with Extremal Connected Forcing Numbers.

[BibT_eX]

[DOI]

Caleb C. Fast

CoRR, 2017

On Sets of Line Segments Featuring a Cactus Structure.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Image Analysis - 18th International Workshop, 2017

2016

On the logspace shortest path problem.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2016

Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Characterizations of the Connected Forcing Number of a Graph.

[BibT_eX]

[DOI]

Randy Davila

CoRR, 2016

Complexity and Computation of Connected Zero Forcing.

[BibT_eX]

[DOI]

CoRR, 2016

The sub-$k$-domination number of a graph with applications to $k$-domination.

[BibT_eX]

[DOI]

CoRR, 2016

2015

A reduction of the logspace shortest path problem to biconnected graphs.

[BibT_eX]

[DOI]

CoRR, 2015

A note on the clique number of complete k-partite graphs.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Geometric approach to string analysis for biosequence classification.

[BibT_eX]

[DOI]

J. Integr. Bioinform., 2014

Geometric Approach to Biosequence Analysis.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Practical Applications of Computational Biology & Bioinformatics, 2014

2013

Memory Efficient Shortest Path Algorithms for Cactus Graphs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Visual Computing - 9th International Symposium, 2013

2012

A spectral and radial basis function hybrid method for visualizing vascular flows.

[BibT_eX]

[DOI]

Proceedings of the Computational Modelling of Objects Represented in Images, 2012

2011

Connected distance-based rasterization of objects in arbitrary dimension.

[BibT_eX]

[DOI]

Reneta P. Barneva

Graph. Model., 2011

2009

Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in nD.

[BibT_eX]

[DOI]

Reneta P. Barneva

Proceedings of the Discrete Geometry for Computer Imagery, 2009

2008

Offset Approach to Defining 3D Digital Lines.

[BibT_eX]

[DOI]

Reneta P. Barneva