Michal Malafiejski

Krzysztof M. Ocetkiewicz

Krzysztof Pastuszak

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2019

Global edge alliances in graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2018

On incidence coloring of complete multipartite and semicubic bipartite graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2018

2017

Interval incidence coloring of subcubic graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2017

2016

Global defensive sets in graphs.

[BibT_eX]

[DOI]

Robert Lewon

Discret. Math., 2016

Strategic balance in graphs.

[BibT_eX]

[DOI]

Robert Lewon

Discret. Math., 2016

2015

Interval incidence graph coloring.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

2014

Interval incidence coloring of bipartite graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2009

The complexity of the L(p, q)-labeling problem for bipartite planar graphs of small degree.

[BibT_eX]

[DOI]

Discret. Math., 2009

An Improved Strategy for Exploring a Grid Polygon.

[BibT_eX]

[DOI]

Agnieszka Kolenderska

Proceedings of the Structural Information and Communication Complexity, 2009

Interval Wavelength Assignment in All-Optical Star Networks.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing and Applied Mathematics, 2009

2008

Tighter Bounds on the Size of a Maximum P3-Matching in a Cubic Graph.

[BibT_eX]

[DOI]

Graphs Comb., 2008

2007

Packing [1, Delta] -factors in graphs of small degree.

[BibT_eX]

[DOI]

J. Comb. Optim., 2007

A polynomial algorithm for some preemptive multiprocessor task scheduling problems.

[BibT_eX]

[DOI]

Lukasz Kuszner

Eur. J. Oper. Res., 2007

Cooperative mobile guards in grids.

[BibT_eX]

[DOI]

Comput. Geom., 2007

Application of an Online Judge & Contester System in Academic Tuition.

[BibT_eX]

[DOI]

Tomasz Noinski

Proceedings of the Advances in Web Based Learning, 2007

2006

An approximation algorithm for maximum P3-packing in subcubic graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Fault Tolerant Guarding of Grids.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications, 2006

An Efficient Algorithm for Mobile Guarded Guards in Simple Grids.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications, 2006

2005

Parallel Processing Subsystems with Redundancy in a Distributed Environment.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing and Applied Mathematics, 2005

On Bounded Load Routings for Modeling k-Regular Connection Topologies.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Weakly Cooperative Guards in Grids.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications, 2005

2004

Sum Coloring of Bipartite Graphs with Bounded Degree.

[BibT_eX]

[DOI]

Algorithmica, 2004

2003

A polynomial algorithm for finding T-span of generalized cacti.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

The complexity of the T-coloring problem for graphs with small degree.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

2002

A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001

The complexity of the chromatic sum problem on cubic planar graphs and regular graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Consecutive colorings of the edges of general graphs.

[BibT_eX]

[DOI]

Marek Kubale

Discret. Math., 2001

Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing and Applied Mathematics, 2001

1999

On the Deficiency of Bipartite Graphs.

[BibT_eX]

[DOI]

Marek Kubale