Andrzej Zak

Discret. Appl. Math., December, 2023

Constructing sparsest ℓ-hamiltonian saturated k-uniform hypergraphs for a wide range of ℓ.

[BibT_eX]

[DOI]

Eur. J. Comb., 2023

2022

A note on packing of uniform hypergraphs.

[BibT_eX]

[DOI]

Jerzy Konarski

Mariusz Wozniak

Discuss. Math. Graph Theory, 2022

Real-time path planning for Autonomous Navigation Systems of Unmanned Surface Vehicles.

[BibT_eX]

[DOI]

Agnieszka Lazarowska

Proceedings of the 26th International Conference on Methods and Models in Automation and Robotics, 2022

2021

A Method for Underwater Wireless Data Transmission in a Hydroacoustic Channel under NLOS Conditions.

[BibT_eX]

[DOI]

Sensors, 2021

Largest Component and Node Fault Tolerance for Grids.

[BibT_eX]

[DOI]

Jakub Przybylo

Electron. J. Comb., 2021

2020

Application of Diversity Combining with RLS Adaptive Filtering in Data Transmission in a Hydroacoustic Channel.

[BibT_eX]

[DOI]

Sensors, 2020

Reduction of the Multipath Propagation Effect in a Hydroacoustic Channel Using Filtration in Cepstrum.

[BibT_eX]

[DOI]

Sensors, 2020

On the Minimum Size of Hamilton Saturated Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

2019

Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2017

Packing large trees of consecutive orders.

[BibT_eX]

[DOI]

Discret. Math., 2017

Near packings of two graphs.

[BibT_eX]

[DOI]

Jerzy Konarski

Discret. Math., 2017

2016

Upper Bounds on the Minimum Size of Hamilton Saturated Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

On Erdős-Sós Conjecture for Trees of Large Size.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

2015

General lower bound on the size of (H;k)-stable graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

2014

On Packing Two Graphs with Bounded Sum of Sizes and Maximum Degree.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

On embedding graphs with bounded sum of size and maximum degree.

[BibT_eX]

[DOI]

Discret. Math., 2014

A generalization of an independent set with application to (Kp;k)-stable graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2013

On (Kq;k)-Stable Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

Growth order for the size of smallest hamiltonian chain saturated uniform hypergraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

Near Packings of Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

Hamilton Saturated Hypergraphs of Essentially Minimum Size.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

2012

On Hamilton-chain saturated uniform hypergraphs.

[BibT_eX]

[DOI]

Aneta Dudek

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

Sparse graphs of girth at least five are packable.

[BibT_eX]

[DOI]

Discret. Math., 2012

A lower bound on the size of (H; 1)-vertex stable graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

2011

A note on k-placeable graphs.

[BibT_eX]

[DOI]

Discret. Math., 2011

On (Cn;k) Stable Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2011

2010

On Packable Digraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Dissections of Polygons into Convex Polygons.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2010

On vertex stability with regard to complete bipartite subgraphs.

[BibT_eX]

[DOI]

Aneta Dudek

Discuss. Math. Graph Theory, 2010

Hamilton-chain saturated hypergraphs.

[BibT_eX]

[DOI]

Aneta Dudek

Gyula Y. Katona

Discret. Math., 2010

2009

Harmonious order of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

Maximizing hamiltonian pairs and k-sets via numerous leaves in a tree.

[BibT_eX]

[DOI]

Artur Fortuna

Zdzislaw Skupien

Discret. Math., 2009

A Note on Packing Graphs Without Cycles of Length up to Five.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

A note on perfect dissections of an equilateral triangle.

[BibT_eX]

[DOI]

Australas. J Comb., 2009

2008

Rainbow regular order of graphs.

[BibT_eX]

[DOI]

Zdzislaw Skupien

Australas. J Comb., 2008

2006

Preface to proceedings.

[BibT_eX]

[DOI]

Waclaw Frydrych

Discuss. Math. Graph Theory, 2006

2005

Dissection of a Triangle into Similar Triangles.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2005

Walsh transform as method of mimo systems identification.

[BibT_eX]